Steady-State Scheduling on Heterogeneous Clusters: Why and How?.

Abstract : In this paper, we consider steady-state scheduling techniques for heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to solve a variety of important problems, which would be too difficult to tackle with the objective of makespan minimization. We give a few successful examples before discussing the main limitations of the approach.
Document type :
Reports
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102079
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:13:43 AM
Last modification on : Wednesday, May 1, 2019 - 1:27:34 AM

File

RR2004-11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102079, version 1

Collections

Citation

Olivier Beaumont, Arnaud Legrand, Loris Marchal, Yves Robert. Steady-State Scheduling on Heterogeneous Clusters: Why and How?.. [Research Report] LIP RR-2004-11, Laboratoire de l'informatique du parallélisme. 2004, 2+11p. ⟨hal-02102079⟩

Share

Metrics

Record views

10

Files downloads

42