Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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 (Research report)
Complete list of metadata
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:07:54 AM
Last modification on : Wednesday, October 26, 2022 - 8:15:50 AM


Files produced by the author(s)


  • HAL Id : hal-02101844, version 1



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⟩



Record views


Files downloads