Heterogeneous task scheduling : a survey

Abstract : Scheduling computation tasks on processors is a 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. We survey here five low-complexity heuristics for heterogeneous platforms, the Best Imaginary Level (BIL), the Generalized Dynamic Level (GDL), the Critical-Path-on-a-Processor (CPOP), the Heterogeneous Earliest Finish Time (HEFT) and the Partial Completion Time (PCT) algorithms. These five heuristics aim at scheduling directed acyclic weighted task graphs on a bounded number of heterogeneous processors. We compare the performances of the heuristics using four classical testbeds.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02101844
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:07:54 AM
Last modification on : Sunday, May 19, 2019 - 1:20:44 AM

File

RR2001-07.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101844, version 1

Collections

Citation

Vincent Boudet. Heterogeneous task scheduling : a survey. [Research Report] LIP RR-2001-*07, Laboratoire de l'informatique du parallélisme. 2001, 2+28p. ⟨hal-02101844⟩

Share

Metrics

Record views

4

Files downloads

7