Scheduling Divisible Workloads on Heterogeneous Platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Parallel Computing Year : 2003

Scheduling Divisible Workloads on Heterogeneous Platforms

Abstract

In this paper, we discuss several algorithms for scheduling divisible workloads 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 solutions on a large variety of platforms, especially when the communication-to-computation ratio is not very high (the difficult case).

Dates and versions

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

Identifiers

Cite

Olivier Beaumont, Arnaud Legrand, Yves Robert. Scheduling Divisible Workloads on Heterogeneous Platforms. Parallel Computing, 2003, 29, pp.1121―1152. ⟨10.1016/S0167-8191(03)00095-4⟩. ⟨hal-00789431⟩
163 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More