Impact on the writing granularity for incremental checkpointing

Authors:
Junyoung Heo;Xuefeng Piao;Sangho Yi;Geunyoung Park;Minkyu Park;Jiman Hong;Yookun Cho
Affiliations:
Seoul National University;Seoul National University;Seoul National University;Seoul National University;Seoul National University;Kwangwoon University;Seoul National University
Venue:
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Year:
2005

Citing 3
Cited 0

Memory exclusion: optimizing the performance of checkpointing systems

Software—Practice & Experience
Adaptive incremental checkpointing for massively parallel systems

Proceedings of the 18th annual international conference on Supercomputing
Libckpt: transparent checkpointing under Unix

TCON'95 Proceedings of the USENIX 1995 Technical Conference Proceedings

Quantified Score

Hi-index	0.00

Visualization

Abstract

Incremental checkpointing is an cost-efficient fault tolerant technique for long running programs such as genetic algorithms. In this paper, we derive the equations for the writing granularity of incremental checkpointing and find factors associated with the time overhead and disk space for incremental checkpoint. We also verify the applicability of the derived equation and the acceptability of the factors through experiments.