Eles, Petru

Izosimov, Viacheslav

Peng, Zebo

Pop, Paul

In this paper we present an approach for the mapping optimization of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled. Process re-execution is used for recovering from multiple transient faults. We call process recovery transparent if it does not affect operation of other processes. Transparent recovery has the advantage of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules. However, it will introduce additional delays that can lead to violations of the timing constraints of the application. We propose an algorithm for the mapping of fault-tolerant applications with transparency. The algorithm decides a mapping of processes on computation nodes such that the application is schedulable and the transparency properties imposed by the designer are satisfied. The mapping algorithm is driven by a heuristic that is able to estimate the worst-case schedule length and indicate whether a certain mapping alternative is schedulabl

Online Research Database In Technology

Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems

http://orbit.dtu.dk/ws/files/3730688/izosimov_dsd06.corrected.pdf

Mapping of Fault-Tolerant Applications with Transparency on Distributed Embedded Systems

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology