Analysis of checkpointing for schedulability of real-time systems

Author

Punnekkat, Sasikumar ; Burns, Alan

Author_Institution

Dept. of Comput. Sci., York Univ., UK

fYear

1997

fDate

27-29 Oct 1997

Firstpage

198

Lastpage

205

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

Keywords

fault tolerant computing; processor scheduling; real-time systems; checkpointing; exact schedulability tests; failure hypothesis; fault recovery; fault tolerance; fault tolerant task sets; off-line design support tool; real-time systems; schedulability; task response time; time redundancy; Checkpointing; Costs; Database systems; Fault tolerance; Fault tolerant systems; Hardware; Processor scheduling; Real time systems; Redundancy; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Computing Systems and Applications, 1997. Proceedings., Fourth International Workshop on

Conference_Location

Taipei

Print_ISBN

0-8186-8073-3

Type

conf

DOI

10.1109/RTCSA.1997.629219

Filename

629219