Abstract
This paper is motivated by the observation that different methods to compute the weights of nodes and edges when scheduling DAGs onto heterogeneous machines may lead to significant variations in the generated schedule. To minimize such variations, the paper presents a novel heuristic for DAG scheduling, which is based upon solving a series of independent task scheduling problems. A novel heuristic for the latter problem is also included in the paper. Both heuristics compare favourably with other related heuristics.
Original language | English |
---|---|
Title of host publication | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)|Proc. Int. Parall. Distrib. Process. Symp. IPDPS 2004 |
Pages | 1571-1583 |
Number of pages | 12 |
Volume | 18 |
DOIs | |
Publication status | Published - 2004 |
Event | Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) - Santa Fe, NM Duration: 1 Jul 2004 → … http://dblp.uni-trier.de/db/conf/ipps/ipdps2004-w10.html#CooperDKKMMMMBCCDLOSXJLPRDMSYD04http://dblp.uni-trier.de/rec/bibtex/conf/ipps/CooperDKKMMMMBCCDLOSXJLPRDMSYD04.xmlhttp://dblp.uni-trier.de/rec/bibtex/conf/ipps/CooperDKKMMMMBCCDLOSXJLPRDMSYD04 |
Conference
Conference | Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) |
---|---|
City | Santa Fe, NM |
Period | 1/07/04 → … |
Internet address |