The Community for Technology Leaders
2008 37th International Conference on Parallel Processing (2008)
Sept. 9, 2008 to Sept. 11, 2008
ISSN: 0190-3918
ISBN: 978-0-7695-3374-2
pp: 246-253
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.
Communication contention, fault tolerance, multi-criteria scheduling, heterogeneous systems.

Y. Robert, A. Benoit and M. Hakem, "Realistic Models and Efficient Algorithms for Fault Tolerant Scheduling on Heterogeneous Platforms," 2008 37th International Conference on Parallel Processing(ICPP), vol. 00, no. , pp. 246-253, 2008.
90 ms
(Ver 3.3 (11022016))