Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms

Anne Benoit 1 Mourad Hakem 1 Yves Robert 1
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Fault tolerance and latency are important requirements in several applications which are time critical in nature: such applications require guaranties in terms of latency, even when processors are subject to failures. In this paper, we propose a fault tolerant scheduling heuristic for mapping precedence task graphs on heterogeneous systems. Our approach is based on an active replication scheme, capable of supporting $\varepsilon$ arbitrary fail-silent (fail-stop) processor failures, hence valid results will be provided even if $\varepsilon$ processors fail. We focus on a bi-criteria approach, where we aim at minimizing the latency given a fixed number of failures supported in the system, or the other way round. Major achievements include a low complexity, and a drastic reduction of the number of additional communications induced by the replication mechanism. Experimental results demonstrate that our heuristics, despite their lower complexity, outperform their direct competitor, the FTBAR scheduling algorithm[8].
Complete list of metadatas

Cited literature [31 references]  Display  Hide  Download

https://hal.inria.fr/inria-00207593
Contributor : Mourad Hakem <>
Submitted on : Tuesday, January 22, 2008 - 2:41:10 PM
Last modification on : Friday, April 26, 2019 - 1:35:48 AM

Identifiers

  • HAL Id : inria-00207593, version 3

Collections

Citation

Anne Benoit, Mourad Hakem, Yves Robert. Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms. [Research Report] RR-6418, INRIA, LIP. 2008, 2+18p. ⟨inria-00207593v3⟩

Share

Metrics

Record views

456

Files downloads

402