Off-line and on-line scheduling on heterogeneous master-slave platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

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.
Fichier principal
Vignette du fichier
europdp.pdf (312.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00804402 , version 1 (20-11-2018)

Identifiers

  • HAL Id : hal-00804402 , version 1

Cite

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⟩
115 View
77 Download

Share

Gmail Facebook X LinkedIn More