Optimal checkpointing intervals of three error detection schemes by a double modular redundancy

Authors:
Sayori Nakagawa;Satoshi Fukumoto;Naohiro Ishii
Affiliations:
Department of Intelligence and Computer Science Nagoya Institute of Technology, Nagoya, Japan;Department of Electrical Engineering Graduate School of Engineering Tokyo Metropolitan University, Tokyo, Japan;Department of Intelligence and Computer Science Nagoya Institute of Technology, Nagoya, Japan
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2003

Citing 3
Cited 1

Performance Optimization of Checkpointing Schemes with Task Duplication

IEEE Transactions on Computers
Analysis of Checkpointing Schemes with Task Duplication

IEEE Transactions on Computers
Rollback and Recovery Strategies for Computer Programs

IEEE Transactions on Computers

Performance optimization for energy-aware adaptive checkpointing in embedded real-time systems

Proceedings of the conference on Design, automation and test in Europe: Proceedings

Quantified Score

Hi-index	0.98

Visualization

Abstract

This paper considers three checkpointing schemes which combine a double modular redundancy and three types of checkpoints: compare-and-store-checkpoint (CSCP), store-checkpoint (SCP), and compare-checkpoint (CCP). An execution time of a task is divided equally into n intervals, and at the end of each interval, a CSCP is always placed. Further, each CSCP interval is also divided equally into m intervals, and at the end of each interval, either CCP or SCP is placed except the last one. Introducing the overheads of comparison, storage, and retry, the mean execution times to complete a task for three schemes are obtained, using the theory of probability. Optimal checkpointing intervals, which minimize the mean times, are analytically derived, and are numerically computed. Three schemes are compared as numerical examples and the best checkpointing scheme is chosen.