Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms

DMCA

Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Anne Benoit , Mourad Hakem , Yves Robert

Citations:

9 - 4 self

BibTeX

@MISC{Benoit07faulttolerant,
    author = {Anne Benoit and Mourad Hakem and Yves Robert},
    title = {Fault Tolerant Scheduling of Precedence Task Graphs on Heterogeneous Platforms},
    year = {2007}
}

OpenURL

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 ε 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 [8].

Keyphrases

precedence task graph fault tolerant scheduling heterogeneous platform direct competitor several application way round fault tolerance bi-criteria approach active replication scheme replication mechanism fixed number major achievement additional communication processor failure important requirement low complexity ftbar scheduling algorithm fault tolerant heterogeneous system valid result drastic reduction experimental result

DMCA