Scheduling of Malleable Fork-Join Tasks with Constraint Programming

This paper proposes a scheduling method for fork-join malleable tasks based on constraint programming (CP). For a given task-graph, each of the tasks can be split into multiple sub-tasks, and each sub-task is scheduled independently. The proposed method decides the number of sub-tasks to be split, and the execution order of tasks in such a way that the overall schedule length is minimized. Experimental results show that our CP-based scheduling method could find better schedules than the state-of-the-art method which is based on integer linear programming.