A hybrid heuristic for DAG scheduling on heterogeneous systems

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 1571-1583

  Sakellariou, Rizos ^a   Zhao, Henan ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA TRANSFER; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS;

DIRECTED ACYCLIC GRAPH (DAG); FASTEST CRITICAL PATH (FCP); HETEROGENEOUS SYSTEMS; TASK SCHEDULING;

SCHEDULING;

EID: 12444344700     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. S. Ali, H. J. Siegel, M. Maheswaran, D. Hensgen, and S. Ali. Task execution time modeling for heterogeneous computing systems. In Heterogeneous Computing Workshop, 2000.
2. O. Beaumont, V. Boudet, and Y. Robert. A realistic model and an efficient heuristic for scheduling with heterogeneous processors. In 11th Heterogeneous Computing Workshop, 2002.
3. T. D. Braun, H. J. Siegel, N. Beck, L. L. Boloni, M. Maheswaran, A. I. Reuther, J. P. Robertson, M. D. Theys, and B. Yao. A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61:810-837, 2001.
4. T. L. Casavant and J. G. Kuhl. A taxonomy of scheduling in general-purpose distributed computing systems. IEEE Transactions on Software Engineering, 14(2):141-154, 1988.
5. B. Cirou and E. Jeannot. Triplet: A clustering scheduling algorithm for heterogeneous systems. In International Conference on Parallel Processing Workshop, 2001.
6. M. Iverson, F. Ozguner, and G. Follen. Parallelizing existing applications in a distributed heterogeneous environment. In Heterogeneous Computing Workshop, 1995.
7. Y. K. Kwok and I. Ahmad. Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 7(5):506-521, May 1996.
8. Y. K. Kwok and I. Ahmad. Benchmarking and comparison of the task graph scheduling algorithms. Journal of Parallel and Distributed Computing, 59:381-422, 1999.
9. A. Radulescu and A. J. C. van Gemund. On the complexity of list scheduling algorithms for distributed memory systems. In ACM International Conference on Supercomputing, 1999.
10. A. Radulescu and A. J. C. van Gemund. Fast and Effective Task Scheduling in Heterogeneous Systems. In Heterogeneous Computing Workshop, 2000.
11. A. Radulescu and A.J.C. van Gemund. Low-Cost Task Scheduling for Distributed-Memory Machines. IEEE Transactions on Parallel and Distributed Systems, 13(6), pp. 648-658, June 2002.
12. S. Ranaweera and D. P. Agrawal. A task duplication based scheduling algorithm for heterogeneous systems. In 14th International Parallel and Distributed. Processing Symposium (IPDPS'00), Cancun, Mexico, May 2000.
13. G. C. Sih and E. A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architecture. IEEE Transactions on Parallel and Distributed Systems, 4(2):175-187, February 1993.
14. H. Topcuoglu, S. Hariri, and M. Wu. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3):260-274, March 2002.
15. L. Wang, H. J. Siegel, V. P. Roychowdhury, and A. A. Maciejewski. Task matching and scheduling in heterogeneous computing environments using a genetic-algorithm-based approach. Journal of Parallel and Distributed Computing, 47:8-22, 1997.
16. H. Zhao and R. Sakellariou. An experimental investigation into the rank function of the heterogeneous earliest finish time scheduling algorithm. In Euro-Par 2003. Springer-Verlag, LNCS 2790, 2003.