Synthesis of Fault-Tolerant Schedules with Transparency/Performance Trade-offs for Distributed Embedded Systems

Viacheslav Izosimov; Paul Pop; Petru Eles; Zebo Peng

doi:10.1109/DATE.2006.244067

Synthesis of Fault-Tolerant Schedules with Transparency/Performance Trade-offs for Distributed Embedded Systems

Viacheslav Izosimov
, Paul Pop
, Petru Eles
, Zebo Peng

Linköping University

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

In this paper we present an approach to the scheduling of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. If process recovery is performed such that the operation of other processes is not affected, we call it transparent recovery. Although transparent recovery has the advantages of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules, it will introduce delays that can violate the timing constraints of the application. We propose a novel algorithm for the synthesis of fault-tolerant schedules that can handle the transparency/performance trade-offs imposed by the designer, and makes use of the fault-occurrence information to reduce the overhead due to fault tolerance. We model the application as a conditional process graph, where the fault occurrence information is represented as conditional edges and the transparent recovery is captured using synchronization nodes.

Original language	English
Title of host publication	Design Automation and Test in Europe Conference
Volume	1
Publication date	2006
Pages	1-6
ISBN (Print)	3981080114
DOIs	https://doi.org/10.1109/DATE.2006.244067
Publication status	Published - 2006
Event	2006 Conference on Design, Automation and Test in Europe - Munich, Germany Duration: 6 Mar 2006 → 10 Mar 2006

Conference

Conference	2006 Conference on Design, Automation and Test in Europe
Country/Territory	Germany
City	Munich
Period	06/03/2006 → 10/03/2006

Bibliographical note

Copyright note for papers published by the IEEE Computer Society: Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE.

Access to Document

10.1109/DATE.2006.244067

http://www2.imm.dtu.dk/pubdb/p.php?4642

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{5deb21b79f6b4a509da4b70758dc620c,

title = "Synthesis of Fault-Tolerant Schedules with Transparency/Performance Trade-offs for Distributed Embedded Systems",

abstract = "In this paper we present an approach to the scheduling of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. If process recovery is performed such that the operation of other processes is not affected, we call it transparent recovery. Although transparent recovery has the advantages of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules, it will introduce delays that can violate the timing constraints of the application. We propose a novel algorithm for the synthesis of fault-tolerant schedules that can handle the transparency/performance trade-offs imposed by the designer, and makes use of the fault-occurrence information to reduce the overhead due to fault tolerance. We model the application as a conditional process graph, where the fault occurrence information is represented as conditional edges and the transparent recovery is captured using synchronization nodes.",

author = "Viacheslav Izosimov and Paul Pop and Petru Eles and Zebo Peng",

note = "Copyright note for papers published by the IEEE Computer Society: Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE.; 2006 Conference on Design, Automation and Test in Europe, DATE 2006 ; Conference date: 06-03-2006 Through 10-03-2006",

year = "2006",

doi = "10.1109/DATE.2006.244067",

language = "English",

isbn = "3981080114",

volume = "1",

pages = "1--6",

booktitle = "Design Automation and Test in Europe Conference",

}

TY - GEN

T1 - Synthesis of Fault-Tolerant Schedules with Transparency/Performance Trade-offs for Distributed Embedded Systems

AU - Izosimov, Viacheslav

AU - Pop, Paul

AU - Eles, Petru

AU - Peng, Zebo

N1 - Copyright note for papers published by the IEEE Computer Society: Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE.

PY - 2006

Y1 - 2006

N2 - In this paper we present an approach to the scheduling of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. If process recovery is performed such that the operation of other processes is not affected, we call it transparent recovery. Although transparent recovery has the advantages of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules, it will introduce delays that can violate the timing constraints of the application. We propose a novel algorithm for the synthesis of fault-tolerant schedules that can handle the transparency/performance trade-offs imposed by the designer, and makes use of the fault-occurrence information to reduce the overhead due to fault tolerance. We model the application as a conditional process graph, where the fault occurrence information is represented as conditional edges and the transparent recovery is captured using synchronization nodes.

AB - In this paper we present an approach to the scheduling of fault-tolerant embedded systems for safety-critical applications. Processes and messages are statically scheduled, and we use process re-execution for recovering from multiple transient faults. If process recovery is performed such that the operation of other processes is not affected, we call it transparent recovery. Although transparent recovery has the advantages of fault containment, improved debugability and less memory needed to store the fault-tolerant schedules, it will introduce delays that can violate the timing constraints of the application. We propose a novel algorithm for the synthesis of fault-tolerant schedules that can handle the transparency/performance trade-offs imposed by the designer, and makes use of the fault-occurrence information to reduce the overhead due to fault tolerance. We model the application as a conditional process graph, where the fault occurrence information is represented as conditional edges and the transparent recovery is captured using synchronization nodes.

U2 - 10.1109/DATE.2006.244067

DO - 10.1109/DATE.2006.244067

M3 - Article in proceedings

SN - 3981080114

VL - 1

SP - 1

EP - 6

BT - Design Automation and Test in Europe Conference

T2 - 2006 Conference on Design, Automation and Test in Europe

Y2 - 6 March 2006 through 10 March 2006

ER -