Compiler‐assisted full checkpointing

30 October 1994

journal article
Published by Wiley in Software: Practice and Experience

Vol. 24 (10) , 871-886
https://doi.org/10.1002/spe.4380241002

Abstract

This paper describes a compiler‐based approach to checkpointing for process recovery. The implementation is transparent to both the programmer and the hardware. The compiler‐generatedsparse potential checkpointcode maintains the desired checkpoint interval.Adaptive checkpointingreduces the size of the checkpoints.Trainingis used to select low‐cost, high‐coverage potential checkpoints. The problem of selecting potential checkpoints is shown to be NP‐complete, and a heuristic algorithm is introduced that determines a quick suboptimal solution. These compiler‐assisted checkpointing techniques have been implemented in a modified version of the GNU C (GCC) compiler. Experiments involving the modified version of the GCC compiler on a Sun SPARC workstation are summarized.

Keywords

This publication has 17 references indexed in Scilit:

On the optimal total processing time using checkpoints
IEEE Transactions on Software Engineering, 1991
Compiler-assisted synthesis of algorithm-based checking in multiprocessors
IEEE Transactions on Computers, 1990
An experimental study to determine task size for rollback recovery systems
IEEE Transactions on Computers, 1988
Computing optimal checkpointing strategies for rollback and recovery systems
IEEE Transactions on Computers, 1988
Selection of a checkpoint interval in a critical-task environment
IEEE Transactions on Reliability, 1988
Optimization criteria for checkpoint placement
Communications of the ACM, 1984
On the Optimum Checkpoint Selection Problem
SIAM Journal on Computing, 1984
A Technique for High-Performance Data Compression
Computer, 1984
On the Optimum Checkpoint Interval
Journal of the ACM, 1979
Analytic models for rollback and recovery strategies in data base systems
IEEE Transactions on Software Engineering, 1975