IEICE TRANSACTIONS on Information
A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs
Summary :
This paper describes a new approach to the scheduling problem that assigns tasks of a parallel program described as a task graph onto parallel machines. The approach handles interprocessor communication and heterogeneity, based on using both the theoretical results developed so far and a lookahead scheduling strategy. The experimental results on randomly generated task graphs demonstrate the effectiveness of this scheduling heuristic.
- Publication
- IEICE TRANSACTIONS on Information Vol.E80-D No.4 pp.489-494
- Publication Date
- 1997/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Parallel and Distributed Supercomputing)
- Category
Authors
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
Dingchao LI, Akira MIZUNO, Yuji IWAHORI, Naohiro ISHII, "A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs" in IEICE TRANSACTIONS on Information,
vol. E80-D, no. 4, pp. 489-494, April 1997, doi: .
Abstract: This paper describes a new approach to the scheduling problem that assigns tasks of a parallel program described as a task graph onto parallel machines. The approach handles interprocessor communication and heterogeneity, based on using both the theoretical results developed so far and a lookahead scheduling strategy. The experimental results on randomly generated task graphs demonstrate the effectiveness of this scheduling heuristic.
URL: https://global.ieice.org/en_transactions/information/10.1587/e80-d_4_489/_p
Copy
@ARTICLE{e80-d_4_489,
author={Dingchao LI, Akira MIZUNO, Yuji IWAHORI, Naohiro ISHII, },
journal={IEICE TRANSACTIONS on Information},
title={A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs},
year={1997},
volume={E80-D},
number={4},
pages={489-494},
abstract={This paper describes a new approach to the scheduling problem that assigns tasks of a parallel program described as a task graph onto parallel machines. The approach handles interprocessor communication and heterogeneity, based on using both the theoretical results developed so far and a lookahead scheduling strategy. The experimental results on randomly generated task graphs demonstrate the effectiveness of this scheduling heuristic.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Lookahead Heuristic for Heterogeneous Multiprocessor Scheduling with Communication Costs
T2 - IEICE TRANSACTIONS on Information
SP - 489
EP - 494
AU - Dingchao LI
AU - Akira MIZUNO
AU - Yuji IWAHORI
AU - Naohiro ISHII
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E80-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1997
AB - This paper describes a new approach to the scheduling problem that assigns tasks of a parallel program described as a task graph onto parallel machines. The approach handles interprocessor communication and heterogeneity, based on using both the theoretical results developed so far and a lookahead scheduling strategy. The experimental results on randomly generated task graphs demonstrate the effectiveness of this scheduling heuristic.
ER -
English
