Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs
ACM Transactions on Embedded Computing Systems (TECS).
In this paper, we propose a strategy for the synthesis of fault-tolerant schedules and for the mapping of fault tolerant applications. Our techniques handle transparency/performance trade-offs and use the fault-occurrence information to reduce the overhead due to fault tolerance. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. We propose a fine-grained transparent recovery, where the property of transparency can be selectively applied to processes and messages.Transparency hides the recovery actions in a selected part of the application so that they do not affect the schedule of other processes and messages. While leading to longer schedules, transparent recovery has the advantage of both improved debuggability and less memory needed to store the fault-tolerant schedules.
Copyright note for papers published by ACM:
Permission to make digital or hard copies of this work for personal or
classroom use is granted without fee provided that copies bear this
notice and the full citation on the first page. Copyrights for
components of this work owned by others than ACM must be
honored. Abstracting with credit is permitted. To copy otherwise, to
republish, to post on servers or to distribute to lists, requires
prior specific permission and/or a fee.
[IPEP11] Viacheslav Izosimov, Paul Pop, Petru Eles, Zebo Peng, "Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs", ACM Transactions on Embedded Computing Systems (TECS).