The Community for Technology Leaders
Green Image
Issue No. 09 - September (1997 vol. 46)
ISSN: 0018-9340
pp: 976-985
<p><b>Abstract</b>—Checkpointing enables us to reduce the time to recover from a fault by saving intermediate states of the program in a reliable storage. The length of the intervals between checkpoints affects the execution time of programs. On one hand, long intervals lead to long reprocessing time, while, on the other hand, too frequent checkpointing leads to high checkpointing overhead. In this paper, we present an on-line algorithm for placement of checkpoints. The algorithm uses knowledge of the current cost of a checkpoint when it decides whether or not to place a checkpoint. The total overhead of the execution time when the proposed algorithm is used is smaller than the overhead when fixed intervals are used. Although the proposed algorithm uses only on-line knowledge about the cost of checkpointing, its behavior is close to the off-line optimal algorithm that uses a complete knowledge of checkpointing cost.</p>
Fault-tolerant computing, checkpointing, on-line algorithm, performance optimization.

A. Ziv and J. Bruck, "An On-Line Algorithm for Checkpoint Placement," in IEEE Transactions on Computers, vol. 46, no. , pp. 976-985, 1997.
79 ms
(Ver 3.3 (11022016))