Cost Analysis of Optimistic Recovery Model for Forked Checkpointing

Jiman HONG  Sangsu KIM  Yookun CHO  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E86-D   No.9   pp.1534-1541
Publication Date: 2003/09/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
Category: Networking and Architectures
Keyword: 
checkpointing and recovery,  forked checkpointing,  checkpoint overhead,  expected execution time,  

Full Text: PDF(390.2KB)>>
Buy this Article



Summary: 
Forked checkpointing scheme is proposed to achieve low checkpoint overhead. When a process wants to take a checkpoint in the forked checkpointing scheme, it creates a child process and continues its normal computation. Two recovery models can be used for forked checkpointing when the parent process fails before the child process establishes the checkpoint. One is the pessimistic recovery model where the recovery process rolls back to the previous checkpoint state. The other is the optimistic recovery model where a recovery process waits for the checkpoint to be established by the child process. In this paper, we present the recovery models for forked checkpointing by deriving the expected execution time of a process with and without checkpointing and also show that the expected recovery time of the optimistic recovery model is smaller than that of the pessimistic recovery model.