Scheduling of Malleable Tasks Based on Constraint Programming
Hiroki Nishikawa, Kana Shimada, Ittetsu Taniguchi, Hiroyuki Tomiyama · 2018
This paper proposes a scheduling method for malleable tasks based on constraint programming (CP). For a given task-graph, the proposed method decides the execution order of tasks and the number of cores to execute each task simultaneously 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.