Checkpoint Time Arrangement Rotation in Hybrid State Saving with a Limited Number of Periodical Checkpoints
Summary :
This paper discusses hybrid state saving for applications in which processes should create checkpoints at constant intervals and can hold a finite number of checkpoints. We propose a reclamation technique for checkpoint space, that provides effective checkpoint time arrangements for a rollback distance distribution. Numerical examples show that when we cannot use the optimal checkpoint interval due to the system requirements, the proposed technique can achieve lower expected overhead compared to the conventional technique without considering the form of the rollback distance distribution.
- Publication
- IEICE TRANSACTIONS on Information Vol.E96-D No.1 pp.141-145
- Publication Date
- 2013/01/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E96.D.141
- Type of Manuscript
- LETTER
- Category
- Dependable Computing
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
Ryo SUZUKI, Mamoru OHARA, Masayuki ARAI, Satoshi FUKUMOTO, Kazuhiko IWASAKI, "Checkpoint Time Arrangement Rotation in Hybrid State Saving with a Limited Number of Periodical Checkpoints" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 1, pp. 141-145, January 2013, doi: 10.1587/transinf.E96.D.141.
Abstract: This paper discusses hybrid state saving for applications in which processes should create checkpoints at constant intervals and can hold a finite number of checkpoints. We propose a reclamation technique for checkpoint space, that provides effective checkpoint time arrangements for a rollback distance distribution. Numerical examples show that when we cannot use the optimal checkpoint interval due to the system requirements, the proposed technique can achieve lower expected overhead compared to the conventional technique without considering the form of the rollback distance distribution.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.141/_p
Copy
@ARTICLE{e96-d_1_141,
author={Ryo SUZUKI, Mamoru OHARA, Masayuki ARAI, Satoshi FUKUMOTO, Kazuhiko IWASAKI, },
journal={IEICE TRANSACTIONS on Information},
title={Checkpoint Time Arrangement Rotation in Hybrid State Saving with a Limited Number of Periodical Checkpoints},
year={2013},
volume={E96-D},
number={1},
pages={141-145},
abstract={This paper discusses hybrid state saving for applications in which processes should create checkpoints at constant intervals and can hold a finite number of checkpoints. We propose a reclamation technique for checkpoint space, that provides effective checkpoint time arrangements for a rollback distance distribution. Numerical examples show that when we cannot use the optimal checkpoint interval due to the system requirements, the proposed technique can achieve lower expected overhead compared to the conventional technique without considering the form of the rollback distance distribution.},
keywords={},
doi={10.1587/transinf.E96.D.141},
ISSN={1745-1361},
month={January},}
Copy
TY - JOUR
TI - Checkpoint Time Arrangement Rotation in Hybrid State Saving with a Limited Number of Periodical Checkpoints
T2 - IEICE TRANSACTIONS on Information
SP - 141
EP - 145
AU - Ryo SUZUKI
AU - Mamoru OHARA
AU - Masayuki ARAI
AU - Satoshi FUKUMOTO
AU - Kazuhiko IWASAKI
PY - 2013
DO - 10.1587/transinf.E96.D.141
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2013
AB - This paper discusses hybrid state saving for applications in which processes should create checkpoints at constant intervals and can hold a finite number of checkpoints. We propose a reclamation technique for checkpoint space, that provides effective checkpoint time arrangements for a rollback distance distribution. Numerical examples show that when we cannot use the optimal checkpoint interval due to the system requirements, the proposed technique can achieve lower expected overhead compared to the conventional technique without considering the form of the rollback distance distribution.
ER -
English
