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

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 Npf 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 ...

• Type: Conference
• Year: 2003
• Where: DSN
• Authors: Alain Girault, Hamoudi Kalla, Mihaela Sighireanu, Yves Sorel
• Keywords: Computer Networks, Distributed Architecture, DSN 2003, Real-time Constraints, Target Architecture