IEICE TRANSACTIONS on Fundamentals
ILP-Based Scheduling for Parallelizable Tasks
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.7 pp.1503-1505
- Publication Date
- 2017/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.1503
- Type of Manuscript
- Special Section LETTER (Special Section on Design Methodologies for System on a Chip)
- Category
Authors
Kana SHIMADA
Ritsumeikan University
Shogo KITANO
Ritsumeikan University
Ittetsu TANIGUCHI
Ritsumeikan University
Hiroyuki TOMIYAMA
Ritsumeikan University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Kana SHIMADA, Shogo KITANO, Ittetsu TANIGUCHI, Hiroyuki TOMIYAMA, "ILP-Based Scheduling for Parallelizable Tasks" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 7, pp. 1503-1505, July 2017, doi: 10.1587/transfun.E100.A.1503.
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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1503/_p
Copy
@ARTICLE{e100-a_7_1503,
author={Kana SHIMADA, Shogo KITANO, Ittetsu TANIGUCHI, Hiroyuki TOMIYAMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={ILP-Based Scheduling for Parallelizable Tasks},
year={2017},
volume={E100-A},
number={7},
pages={1503-1505},
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.},
keywords={},
doi={10.1587/transfun.E100.A.1503},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - ILP-Based Scheduling for Parallelizable Tasks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1503
EP - 1505
AU - Kana SHIMADA
AU - Shogo KITANO
AU - Ittetsu TANIGUCHI
AU - Hiroyuki TOMIYAMA
PY - 2017
DO - 10.1587/transfun.E100.A.1503
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2017
AB - 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.
ER -
English
