Fault Recovery Based on Checkpointing for Hard Real-Time Embedded Systems

Authors:
Ying Zhang;Krishnendu Chakrabarty
Affiliations:
-;-
Venue:
DFT '03 Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems
Year:
2003

Citing 0
Cited 5

A new approach to real-time checkpointing

Proceedings of the 2nd international conference on Virtual execution environments
Software based fault tolerance: a survey

Ubiquity
An energy efficient and self-healing 3-dimensional sensor cover

International Journal of Ad Hoc and Ubiquitous Computing
Improving the fault resilience of an H.264 decoder using static analysis methods

ACM Transactions on Embedded Computing Systems (TECS) - Special Section on ESTIMedia'10
DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors

Microprocessors & Microsystems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Safety-critical embedded systems often operate in harsh environmental conditions that necessitate fault-tolerant computing techniques. Many safety-critical systems also execute real-time applications. The correctness of these systems depends not only on the logical result of computation, but also on the time at which the results are produced. The missing of taskdeadlines can therefore be viewed as a temporal fault. In this paper, we examine fault recovery based on checkpointing for real-time systems. We present schedulability tests for checkpointing in real-time systems. These feasibility-of-scheduling tests provide the criteria under which checkpointing can provide fault tolerance and real-time guarantees for hard real-time embedded systems under two different fault arrival models.