Off-line and on-line scheduling on heterogeneous master-slave platforms

Abstract : In this paper, we deal with the problem of scheduling independent tasks on heterogeneous master-slave platforms. We target both o-line and on-line problems , with several objective functions (makespan, maximum response time, total completion time). On the theoretical side, our results are twofold: (i) For o-line scheduling, we prove several optimality results for problems with release dates; (ii) For on-line scheduling , we establish lower bounds on the competitive ratio of any deterministic algorithm. On the practical side, we have implemented several heuristics, some classical and some new ones derived in this paper, on a small but fully heterogeneous MPI platform. Our results show the superiority of those heuristics which fully take into account the relative capacity of the communication links.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-00804402
Contributor : Equipe Roma <>
Submitted on : Tuesday, November 20, 2018 - 5:15:25 PM
Last modification on : Wednesday, November 21, 2018 - 9:20:08 AM

File

europdp.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00804402, version 1

Collections

Citation

Jean-François Pineau, Yves Robert, Frédéric Vivien. Off-line and on-line scheduling on heterogeneous master-slave platforms. PDP'2006, 14th Euromicro Workshop on Parallel, Distributed and Network-based Processing, 2006, Montbéliard-Sochaux, France. ⟨hal-00804402⟩

Share

Metrics

Record views

254

Files downloads

61