Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
Yves Robert , ENS Lyon, Université de Lyon, LIP laboratory, UMR 5668, CNRS - INRIA - UCBL, France
Anne Benoit , ENS Lyon, Université de Lyon, LIP laboratory, UMR 5668, CNRS - INRIA - UCBL, France
Mourad Hakem , ENS Lyon, Université de Lyon, LIP laboratory, UMR 5668, CNRS - INRIA - UCBL, France
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 ε arbitrary fail-silent (fail-stop) processor failures, hence valid results will be provided even if ε 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 .
Yves Robert, Anne Benoit, Mourad Hakem, "Fault tolerant scheduling of precedence task graphs on heterogeneous platforms", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-8, 2008, doi:10.1109/IPDPS.2008.4536133