IEICE TRANSACTIONS on Information
Cost Analysis of Optimistic Recovery Model for Forked Checkpointing
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.9 pp.1534-1541
- Publication Date
- 2003/09/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Parallel and Distributed Computing, Applications and Technologies)
- Category
- Networking and Architectures
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jiman HONG, Sangsu KIM, Yookun CHO, "Cost Analysis of Optimistic Recovery Model for Forked Checkpointing" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 9, pp. 1534-1541, September 2003, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_9_1534/_p
Copy
@ARTICLE{e86-d_9_1534,
author={Jiman HONG, Sangsu KIM, Yookun CHO, },
journal={IEICE TRANSACTIONS on Information},
title={Cost Analysis of Optimistic Recovery Model for Forked Checkpointing},
year={2003},
volume={E86-D},
number={9},
pages={1534-1541},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - Cost Analysis of Optimistic Recovery Model for Forked Checkpointing
T2 - IEICE TRANSACTIONS on Information
SP - 1534
EP - 1541
AU - Jiman HONG
AU - Sangsu KIM
AU - Yookun CHO
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 2003
AB - 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.
ER -
English
