ACM Home Page
Please provide us with feedback. Feedback
Synthesis of fault-tolerant schedules with transparency/performance trade-offs for distributed embedded systems
Full text PdfPdf (235 KB)
Source Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe: Proceedings table of contents
Munich, Germany
SESSION: Communication-centric system-level synthesis for MPSoC table of contents
Pages: 706 - 711  
Year of Publication: 2006
ISBN:3-9810801-0-6
Authors
Viacheslav Izosimov  Linköping University, Sweden
Paul Pop  Linköping University, Sweden
Petru Eles  Linköping University, Sweden
Zebo Peng  Linköping University, Sweden
Sponsors
: The EDA Consortium
EDAA : European Design and Automation Association
IEEE-CS\DATC : The IEEE Computer Society
Publisher
European Design and Automation Association  3001 Leuven, Belgium, Belgium
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 31,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
A. Burns et al., "Feasibility Analysis for Fault-Tolerant Real-Time Task Sets", Euromicro Workshop on Real-Time Systems, 29--33, 1996.
 
3
 
4
C. Dima et al, "Off-line Real-Time Fault-Tolerant Scheduling", Euromicro Parallel and Distributed Processing Workshop, 410--417, 2001.
 
5
 
6
G. Fohler, "Adaptive Fault-Tolerance with Statically Scheduled Real-Time Systems", Euromicro Real-Time Systems Workshop, 161--167, 1997.
 
7
 
8
 
9
 
10
N. Kandasamy, J. P. Hayes, B. T. Murray, "Transparent Recovery from Intermittent Faults in Time-Triggered Distributed Systems", IEEE Trans. on Computers, 52(2), 113--125, 2003.
 
11
N. Kandasamy, J. P. Hayes B. T. Murray "Dependable Communication Synthesis for Distributed Embedded Systems," Computer Safety, Reliability and Security Conf., 275--288, 2003.
 
12
 
13
 
14
H. Kopetz, Günter Bauer, "The Time-Triggered Architecture", Proc. of the IEEE, 91(1), 112--126, 2003.
 
15
 
16
P. Pop, "Analysis and Synthesis of Communication-Intensive Heterogeneous Real-Time Systems", Ph. D. Thesis No. 833, Dept. of Computer and Information Science, Linköping University, 2003.
 
17
D. Ullman, "NP-Complete Scheduling Problems," in J. of Computer Systems Science, vol. 10, 384--393, 1975.
 
18

Collaborative Colleagues:
Viacheslav Izosimov: colleagues
Paul Pop: colleagues
Petru Eles: colleagues
Zebo Peng: colleagues