| /* |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the License. |
| */ |
| |
| package org.apache.sysds.runtime.controlprogram.parfor; |
| |
| import java.util.LinkedList; |
| import java.util.List; |
| |
| import org.apache.sysds.runtime.DMLRuntimeException; |
| import org.apache.sysds.runtime.controlprogram.ParForProgramBlock; |
| import org.apache.sysds.runtime.controlprogram.parfor.Task.TaskType; |
| import org.apache.sysds.runtime.instructions.cp.IntObject; |
| |
| /** |
| * This naive task partitioner virtually iterates over the given FOR loop (from, to, incr), |
| * creates iterations and group them to tasks according to the given task size. There, all |
| * tasks are equally sized. |
| * |
| */ |
| public class TaskPartitionerFixedsize extends TaskPartitioner |
| { |
| protected int _firstnPlus1 = 0; //add one to these firstn tasks |
| |
| public TaskPartitionerFixedsize( long taskSize, String iterVarName, IntObject fromVal, IntObject toVal, IntObject incrVal ) |
| { |
| super(taskSize, iterVarName, fromVal, toVal, incrVal); |
| } |
| |
| @Override |
| public List<Task> createTasks() |
| { |
| LinkedList<Task> tasks = new LinkedList<>(); |
| |
| //range tasks (similar to run-length encoding) make only sense if taskSize>3 |
| TaskType type = (ParForProgramBlock.USE_RANGE_TASKS_IF_USEFUL && _taskSize>3 ) ? |
| TaskType.RANGE : TaskType.SET; |
| |
| long lFrom = _fromVal.getLongValue(); |
| long lTo = _toVal.getLongValue(); |
| long lIncr = _incrVal.getLongValue(); |
| long lfnp1 = _firstnPlus1; |
| |
| for( long i = lFrom; i<=lTo; ) |
| { |
| //create new task and add to list of tasks |
| Task lTask = new Task(_iterVarName, type); |
| tasks.addLast(lTask); |
| |
| int corr = (lfnp1-- > 0)? 1:0; //correction for static partitioner |
| |
| // add <tasksize> iterations to task |
| // (last task might have less) |
| if( type == TaskType.SET ) |
| { |
| //value based tasks |
| for( long j=0; j<_taskSize+corr && i<=lTo; j++, i+=lIncr ) |
| lTask.addIteration(new IntObject(i)); |
| } |
| else |
| { |
| //determine end of task |
| long to = Math.min( i+(_taskSize-1+corr)*lIncr, lTo ); |
| |
| //range based tasks |
| lTask.addIteration(new IntObject(i)); //from |
| lTask.addIteration(new IntObject(to)); //to |
| lTask.addIteration(new IntObject(lIncr)); //increment |
| |
| i = to + lIncr; |
| } |
| } |
| |
| return tasks; |
| } |
| |
| @Override |
| public long createTasks(LocalTaskQueue<Task> queue) |
| { |
| long numCreatedTasks=0; |
| |
| //range tasks (similar to run-length encoding) make only sense if taskSize>3 |
| TaskType type = (ParForProgramBlock.USE_RANGE_TASKS_IF_USEFUL && _taskSize>3 ) ? |
| TaskType.RANGE : TaskType.SET; |
| |
| long lFrom = _fromVal.getLongValue(); |
| long lTo = _toVal.getLongValue(); |
| long lIncr = _incrVal.getLongValue(); |
| long lfnp1 = _firstnPlus1; |
| |
| try |
| { |
| for( long i = lFrom; i<=lTo; ) |
| { |
| //create new task and add to list of tasks |
| Task lTask = new Task(_iterVarName, type); |
| |
| int corr = (lfnp1-- > 0)? 1:0; //correction for static partitioner |
| |
| // add <tasksize> iterations to task |
| // (last task might have less) |
| if( type == TaskType.SET ) |
| { |
| //value based tasks |
| for( long j=0; j<_taskSize+corr && i<=lTo; j++, i+=lIncr ) |
| lTask.addIteration(new IntObject(i)); |
| } |
| else |
| { |
| //determine end of task |
| long to = Math.min( i+(_taskSize-1+corr)*lIncr, lTo ); |
| |
| //range based tasks |
| lTask.addIteration(new IntObject(i)); //from |
| lTask.addIteration(new IntObject(to)); //to |
| lTask.addIteration(new IntObject(lIncr)); //increment |
| |
| i = to + lIncr; |
| } |
| |
| //add task to queue (after all iteration added for preventing raise conditions) |
| queue.enqueueTask( lTask ); |
| numCreatedTasks++; |
| } |
| |
| // mark end of task input stream |
| queue.closeInput(); |
| } |
| catch(Exception ex) |
| { |
| throw new DMLRuntimeException(ex); |
| } |
| |
| return numCreatedTasks; |
| } |
| |
| |
| } |