An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules

DMCA

An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Alain Girault , Hamoudi Kalla , Yves Sorel , Mihaela Sighireanu

Venue:	In International Conference on Dependable Systems and Networks, DSN’03
Citations:	30 - 7 self

BibTeX

@INPROCEEDINGS{Girault03analgorithm,
    author = {Alain Girault and Hamoudi Kalla and Yves Sorel and Mihaela Sighireanu},
    title = {An Algorithm for Automatically Obtaining Distributed and Fault-Tolerant Static Schedules},
    booktitle = {In International Conference on Dependable Systems and Networks, DSN’03},
    year = {2003}
}

OpenURL

Abstract

Our goal is to automatically obtain a distributed and fault-tolerant embedded system: distributed because the system must run on a distributed architecture; fault-tolerant because the system is critical. Our starting point is a source algorithm, a target distributed architecture, some distribution constraints, some indications on the execution times of the algorithm operations on the processors of the target architecture, some indications on the communication times of the data-dependencies on the communication links of the target architecture, a number of fail-silent processor failures that the obtained system must tolerate, and finally some real-time constraints that the obtained system must satisfy. In this article, we present a scheduling heuristic which, given all these inputs, produces a fault-tolerant, distributed, and static scheduling of the algorithm on the architecture, with an indication whether or not the real-time constraints are satisfied. The algorithm we propose consist of a list scheduling heuristic based active replication strategy, that allows at least +1 replicas of an operation to be scheduled on different processors, which are run in parallel to tolerate at most failures. Due to the strategy used to schedule operations, simulation results show that the proposed heuristic improve the performance of our method, both in the absence and in the presence of failures.

Keyphrases

fault-tolerant static schedule automatically obtaining distributed obtained system real-time constraint target architecture fail-silent processor failure different processor communication time distributed architecture fault-tolerant embedded system target distributed architecture algorithm operation communication link execution time static scheduling scheduling heuristic active replication strategy distribution constraint source algorithm simulation result

DMCA