HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

Contributor : Mourad Hakem Connect in order to contact the contributor
Submitted on : Friday, August 1, 2008 - 3:35:02 PM
Last modification on : Saturday, September 11, 2021 - 3:16:51 AM
Long-term archiving on: : Tuesday, June 28, 2011 - 12:22:50 PM


Files produced by the author(s)


  • HAL Id : inria-00308775, version 1



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⟩



Record views


Files downloads