Cost Analysis of Optimistic Recovery Model for Forked Checkpointing(Special Issue on Parallel and Distributed Computing, Applications and technologies)

概要

論文の詳細を見る
Forked checkpointing scheme is proposed to achieve low checkpoint overhead. When a process wants to take a chekpoint in the forked checkpointing scheme, it creates a child process and continues its computation. Two recovery models can be used for forked chekpointing when the parent process fails before the child process establishes the chekpoint. 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.
社団法人電子情報通信学会の論文
2003-09-01