Task scheduling algorithms for heterogeneous processors

Haluk Topcuoglu, Salim Hariri, Min You Wu

Research output: Contribution to conferencePaper

189 Scopus citations

Abstract

Scheduling computation tasks on processors is the key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous resources. The existing algorithms for heterogeneous domains are not generally efficient because of their high complexity and/or the quality of the results. We present two low-complexity efficient heuristics, the Heterogeneous Earliest-Finish-Time (HEFT) Algorithm and the Critical-Path-on-a-Processor (CPOP) Algorithm for scheduling directed acyclic weighted task graphs (DAGs) on a bounded number of heterogeneous processors. We compared the performances of these algorithms against three previously proposed heuristics. The comparison study showed that our algorithms outperform previous approaches in terms of performance (schedule length ratio and speedup) and cost (time-complexity).

Original languageEnglish (US)
Pages3-14
Number of pages12
StatePublished - Jan 1 1999
Externally publishedYes
EventProceedings of the 1999 8th Heterogeneous Computing Workshop (HCW '99) - San Juan
Duration: Apr 12 1999Apr 12 1999

Other

OtherProceedings of the 1999 8th Heterogeneous Computing Workshop (HCW '99)
CitySan Juan
Period4/12/994/12/99

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Task scheduling algorithms for heterogeneous processors'. Together they form a unique fingerprint.

  • Cite this

    Topcuoglu, H., Hariri, S., & Wu, M. Y. (1999). Task scheduling algorithms for heterogeneous processors. 3-14. Paper presented at Proceedings of the 1999 8th Heterogeneous Computing Workshop (HCW '99), San Juan, .