We present in this paper a heuristic for producing automatically a distributed fault-tolerant schedule of a given data-flow algorithm onto a given distributed architecture. The faults considered are processor failures, with a fail-silent behavior. Fault-tolerance is achieved with the software redundancy of computations and the time redundancy of data-dependencies.
@InProceedings{GLSS01a, author = {A. Girault and C. Lavarenne and M. Sighireanu and Y. Sorel}, title = {Fault-Tolerant Static Scheduling for Real-Time Distributed Embedded Systems}, booktitle = {21st International Conference on Distributed Computing Systems, ICDCS'01}, year = {2001}, address = {Phoenix, USA}, month = {April} }