Predictable performance in the event of failures is of paramount importance in most safety critical real-time systems. Various hardware as well as software fault-tolerant techniques are employed towards this goal among which checkpointing is a relatively cost-effective scheme. 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 a 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.
Download Not Available

BibTex Entry

@article{Punnekkat2001,
 author = {S. Punnekkat and A. Burns and R. Davis},
 category = {scheduling},
 journal = {Real-Time Systems Journal},
 month = {Jan},
 number = {1},
 pages = {83-102},
 title = {Analysis of Checkpointing for Real-Time Systems},
 volume = {20},
 year = {2001}
}