Realistic Models and Efficient Algorithms for Fault Tolerant Scheduling on Heterogeneous Platforms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Realistic Models and Efficient Algorithms for Fault Tolerant Scheduling on Heterogeneous Platforms

Abstract

Most list scheduling heuristics rely on a simple platform model where communication contention is not taken into account. In addition, it is generally assumed that processors in the systems are completely safe. To schedule precedence graphs in a more realistic framework, we introduce an efficient fault tolerant scheduling algorithm that is both contention-aware and capable of supporting $\varepsilon$ arbitrary fail-silent (fail-stop) processor failures. We focus on a bi-criteria approach, where we aim at minimizing the total execution time, or latency, given a fixed number of failures supported in the system. Our algorithm has a low time complexity, and drastically reduces the number of additional communications induced by the replication mechanism. Experimental results fully demonstrate the usefulness of the proposed algorithm, which leads to efficient execution schemes while guaranteeing a prescribed level of fault tolerance.
Fichier principal
Vignette du fichier
RR-6606.pdf (370.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00308775 , version 1 (01-08-2008)

Identifiers

  • HAL Id : inria-00308775 , version 1

Cite

Anne Benoit, Mourad Hakem, Yves Robert. Realistic Models and Efficient Algorithms for Fault Tolerant Scheduling on Heterogeneous Platforms. [Research Report] RR-6606, INRIA. 2008, pp.28. ⟨inria-00308775⟩
112 View
90 Download

Share

Gmail Facebook Twitter LinkedIn More