A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems

Parallel Computing

Volumn 31, Issue 7, 2005, Pages 653-670

  Hagras, T ^a   Janecek J ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPHIC METHODS; HEURISTIC PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM COMPILERS;

COMPLEXITY ALGORITHMS; SCHEDULING ALGORITHMS; SCHEDULING HEURISTICS; TASK SCHEDULING;

SCHEDULING;

EID: 22144471943     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.04.002     Document Type: Conference Paper

References (19)

1. J.G. Webster, Heterogeneous distributed computing, in: Encyclopedia of Electrical and Electronics Engineering, vol. 8, 1999, pp. 679-690.
2. D. Feitelson, L. Rudolph, U. Schwiegelshohm, K. Sevcik, and P. Wong Theory and practice in parallel job scheduling JSSPP 1997 1 34
3. Y. Kwok, I. Ahmed, Benchmarking the task graph scheduling algorithms, in: Proc. IPPS/SPDP, 1998.
4. J. Liou, M. Palis, A comparison of general approaches to multiprocessor scheduling, in: Proc. Int. Parallel Processing Symp., 1997, pp. 152-156.
5. A. Khan, C. McCreary, and M. Jones A comparison of multiprocessor scheduling heuristics ICPP 2 1994 243 250
6. A. Gerasoulis, and T. Yang A comparison of clustering heuristics for scheduling dags on multiprocessors Journal of Parallel and Distributed Computing 16 1992 276 291
7. A. Radulescu, A. van Gemund, Fast and effective task scheduling in heterogeneous systems, 9th Heterogeneous Computing Workshop, 2000, pp. 229-238.
8. H. Topcuoglu, S. Hariri, and W. Min You Performance-effective and low-complexity task scheduling for heterogeneous computing IEEE Trans. Parallel Distributed Syst. 13 3 2002 260 274
9. G. Sih, and E. Lee A compile time scheduling heuristic for interconnection constrained heterogeneous processor architectures IEEE Trans. Parallel Distributed Syst. 4 1993 75 87
10. T. Hagras, J. Janecek, A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments, in: IEEE Proc. Int. Conf. Parallel Processing Workshops (ICPP03) workshops, October 2003, pp. 149-155.
11. K. Taura, A. Chien, A heuristic algorithm for mapping communicating tasks on heterogeneous resources, Heterogeneous Computing Workshop, 2000, pp. 102-118.
12. W. Minyou, and D. Gajski Hypertool: a programming aid for message passing systems IEEE Trans. Parallel Distributed Syst. 1 1990
13. Y. Kwok, and I. Ahmed Dynamic critical path scheduling: an effective technique for allocating task graph to multiprocessors IEEE Trans. Parallel Distributed Syst. 7 1996 506 521
14. I. Ahmed, Y. Kwork, A new approach to scheduling parallel program using task duplication, Int. Conf. Parallel Processing, vol. 2, 1994, pp. 47-51.
15. S. Darbha, D. Agrawal, A fast and scalable scheduling algorithm for distributed memory systems, in: Proc. of Symp. on Parallel and Distributed Processing, 1995, pp. 60-63.
16. I. Ahmed, Y. Kwork, A comparison of task-duplication-based algorithms for scheduling parallel programs to message-passing systems, in: Proc. 11th Int. Symp. of High-Performance Computing Systems, 1997, pp. 39-50.
17. G. Park, B. Shirazi, J. Marquis, DFRN: a new approach for duplication based scheduling for distributed memory multiprocessor system, in: Proc. Int. Conf., Parallel Processing, 1997, pp. 157-166.
18. K. Oh-Han, A. Dharma, S3MP: a task duplication based scalable scheduling algorithm for symmetric multiprocessor, in: Proc. IPDP'00, 2000, pp. 451-456.
19. S. Kim, J. Browne, A general approach to mapping of parallel computation upon multiprocessor architectures, in: Proc. Int. Conf. Parallel Processing, vol. 2, 1988, pp. 1-8.