ILP-Based Scheduling for Parallelizable Tasks

• SHIMADA Kana

  Ritsumeikan University

• KITANO Shogo

  Ritsumeikan University

• TANIGUCHI Ittetsu

  Ritsumeikan University

• TOMIYAMA Hiroyuki

  Ritsumeikan University

Abstract

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.

Journal

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A (7), 1503-1505, 2017

  The Institute of Electronics, Information and Communication Engineers

Keywords

• task scheduling; integer linear programming

Details

• CRID: 1390282681287056512
• NII Article ID: 130007311787
• DOI: 10.1587/transfun.e100.a.1503
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E100.A/7/E100.A_1503/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed