Analysis of checkpointing for schedulability of real-time systems

Authors:
S. Punnekkat;A. Burns
Affiliations:
-;-
Venue:
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
Year:
1997

Citing 0
Cited 6

Supporting Fault-Tolerant Real-Time Applications Using the RED-Linux General Scheduling Framework

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
A new approach to real-time checkpointing

Proceedings of the 2nd international conference on Virtual execution environments
Implementing fault-tolerance in real-time systems by automatic program transformations

EMSOFT '06 Proceedings of the 6th ACM & IEEE International conference on Embedded software
Reliability analysis for MPSoCs with mixed-critical, hard real-time constraints

CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Scheduling and Optimization of Fault-Tolerant Embedded Systems with Transparency/Performance Trade-Offs

ACM Transactions on Embedded Computing Systems (TECS)
Stochastic response-time guarantee for non-preemptive, fixed-priority scheduling under errors

Proceedings of the 50th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Checkpointing is a relatively cost effective method for achieving fault tolerance in real-time systems. Since checkpointing schemes depend on time redundancy, they could affect the correctness of the system by causing deadlines to be missed. This paper provides exact schedulability tests for fault tolerant task sets under specified failure hypothesis and employing checkpointing to assist in fault recovery. The effects of checkpointing strategies on task response time are analysed and some insights for optimal checkpointing are provided. The emphasis here is on utilizing this analysis as an off-line design support tool.