Adaptive page-level incremental checkpointing based on expected recovery time

Authors:
Sangho Yi;Junyoung Heo;Yookun Cho;Jiman Hong
Affiliations:
Seoul National University;Seoul National University;Seoul National University;Kwangwoon University
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 6
Cited 0

An On-Line Algorithm for Checkpoint Placement

IEEE Transactions on Computers
Diskless Checkpointing

IEEE Transactions on Parallel and Distributed Systems
Memory exclusion: optimizing the performance of checkpointing systems

Software—Practice & Experience
Efficient Incremental Checkpointing of Java Programs

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Space-efficient page-level incremental checkpointing

Proceedings of the 2005 ACM symposium on Applied computing
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, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. This means that in incremental checkpointing, the time consumed for checkpointing varies according to the amount of modified pages. Thus, an efficient interval of checkpointing have to be determined on run-time of a process. In this paper, we present an efficient and adaptive page-level incremental checkpointing facility that is based on the interval determination mechanism for minimizing the expected execution time. Our simulation results show that the expected execution time was significantly reduced compared with existing periodic page-level incremental checkpointing.