ILP-Based Scheduling for Parallelizable Tasks

Kana SHIMADA  Shogo KITANO  Ittetsu TANIGUCHI  Hiroyuki TOMIYAMA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.7   pp.1503-1505
Publication Date: 2017/07/01
Online ISSN: 1745-1337
Type of Manuscript: Special Section LETTER (Special Section on Design Methodologies for System on a Chip)
Category: 
Keyword: 
task scheduling; integer linear programming,  

Full Text: PDF(246.3KB)
>>Buy this Article


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 the strength of this work.