Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2003

Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems

Résumé

In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an asymptotically optimal multi-round algorithm. This multi-round algorithm automatically performs resource selection, a difficult task that was previously left to the user. Because it is periodic, it is simpler to implement, and more robust to changes in the speeds of the processors and/or communication links. On the theoretical side, to the best of our knowledge, this is the first published result assessing the absolute performance of a multi-round algorithm. On the practical side, extensive simulations reveal that our multi-round algorithm outperforms existing solution on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case).
Fichier non déposé

Dates et versions

hal-00789449 , version 1 (18-02-2013)

Identifiants

Citer

Olivier Beaumont, Arnaud Legrand, Yves Robert. Optimal Algorithms for Scheduling Divisible Workloads on Heterogeneous Systems. IPDS'2003, Parallel and Distributed Processing Symposium, 2003, Feb 2003, Nice, France. ⟨10.1109/IPDPS.2003.1213202⟩. ⟨hal-00789449⟩
142 Consultations
0 Téléchargements

Altmetric

Partager

More