Checkpoint Time Arrangement Rotation in Hybrid State Saving with a Limited Number of Periodical Checkpoints

Ryo SUZUKI  Mamoru OHARA  Masayuki ARAI  Satoshi FUKUMOTO  Kazuhiko IWASAKI  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E96-D   No.1   pp.141-145
Publication Date: 2013/01/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E96.D.141
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Dependable Computing
Keyword: 
distributed checkpointing,  hybrid state saving,  checkpoint-space reclamation,  time arrangement rotation,  

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




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.