ILP-based scheduling for malleable fork-join tasks-Reference-Cited by-同舟云学术

ILP-based scheduling for malleable fork-join tasks

Published:2019-11-25 Issue:3 Volume:16 Page:21-26
ISSN:1551-3688
Container-title:ACM SIGBED Review
language:en
Short-container-title:SIGBED Rev.

Author:

Shimada Kana¹,Taniguchi Ittetsu²,Tomiyama Hiroyuki¹

Affiliation:

1. Ritsumeikan University, Japan

2. Osaka University, Japan

Abstract

This paper studies scheduling of malleable fork-join tasks. In our scheduling problem, each task can be partitioned into multiple sub-tasks, and the sub-tasks are scheduled independently. The optimal number of sub-tasks is determined during scheduling simultaneously. This paper formulates the scheduling problem as an integer linear programming problem.

Publisher

Association for Computing Machinery (ACM)

Subject

Engineering (miscellaneous),Computer Science (miscellaneous)

Link

https://dl.acm.org/doi/pdf/10.1145/3373400.3373403

Reference17 articles.

1. Practical multiprocessor scheduling algorithms for efficient parallel processing;Kasahara H.;IEEE Transactions on Computers,1984

2. A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling Problem with Improved Lower Bounding Techniques

3. Static scheduling algorithms for allocating directed task graphs to multiprocessors

4. Scheduling Precedence Graphs in Systems with Interprocessor Communication Times

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Genetic Algorithm for Scheduling Splittable Tasks with Precedence Constraints;2021 IEEE Congress on Evolutionary Computation (CEC);2021-06-28

2. Simultaneous Scheduling and Core-Type Optimization for Moldable Fork-Join Tasks on Heterogeneous Multicores;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021

3. Communication-Aware Scheduling of Data-Parallel Tasks on Multicore Architectures;IPSJ Transactions on System LSI Design Methodology;2019