The Iso-Level Scheduling Heuristic for Heterogeneous Processors

Abstract : Scheduling computational 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 present a new scheduling heuristic for heterogeneous processors, which improves the load-balancing achieved at each decision step while keeping a low complexity. Experimental comparisons with five heuristics taken from the literature (BIL, GDL, CPOP, HEFT and PCT) and using six classical testbeds, show very favorable results.
Document type :
Reports
Complete list of metadatas

https://hal-lara.archives-ouvertes.fr/hal-02101928
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:09:58 AM
Last modification on : Friday, May 17, 2019 - 1:39:22 AM

File

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

Identifiers

  • HAL Id : hal-02101928, version 1

Collections

Citation

Olivier Beaumont, Vincent Boudet, Yves Robert. The Iso-Level Scheduling Heuristic for Heterogeneous Processors. [Research Report] LIP RR-2001-22, Laboratoire de l'informatique du parallélisme. 2001, 2+24p. ⟨hal-02101928⟩

Share

Metrics

Record views

7

Files downloads

32