Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2016
Session Number:T1-4
Session:
Number:4476
ILP-based Scheduling for Malleable Parallel Tasks
Kana Shimada, Shogo Kitano, Ittetsu Taniguchi, Hiroyuki Tomiyama ,
pp.445-446
Publication Date:2016/7/10
Online ISSN:2188-5079
Summary:
Task scheduling is one of the most important processes in the design of multicore computing systems. This paper presents a technique for scheduling of malleable tasks. Our scheduling technique decides not only the execution order of the tasks but also the number of cores assigned to the individual tasks, simultaneously. We formulate the scheduling problem as an integer linear programming (ILP) problem, and the optimal schedule can be obtained by solving the ILP problem. Experiments using a standard task-set suite clarify both the strength and weakness of this work.