Space-efficient page-level incremental checkpointing

Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. However, the cumulative size of incremental checkpoints increases at a steady rate over time because many updated values may be saved for the same page. In this paper, we present a comprehensive overview of Pickpt, which is a page-level incremental checkpointing facility. Pickpt provides space-efficient techniques for minimizing the use of disk space. For our experiments, the results show that the use of disk space of Pickpt was significantly reduced compared with existing incremental checkpointing.

[1]  Heon Young Yeom,et al.  Kckpt: An efficient checkpoint and recovery facility on unixware kernel , 2000, Computers and Their Applications.

[2]  Kai Li,et al.  Memory Exclusion: Optimizing the Performance of Checkpointing Systems , 1999, Softw. Pract. Exp..

[3]  Miron Livny,et al.  Checkpoint and Migration of UNIX Processes in the Condor Distributed Processing System , 1997 .

[4]  Micah Beck,et al.  Compiler-Assisted Checkpointing , 1994 .

[5]  Kai Li,et al.  Diskless Checkpointing , 1998, IEEE Trans. Parallel Distributed Syst..

[6]  Jongmoo Choi,et al.  An efficient merging algorithm for recovery and garbage collection in incremental checkpointing , 2004, Parallel and Distributed Computing and Networks.

[7]  Julia L. Lawall,et al.  Efficient incremental checkpointing of Java programs , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[8]  Yookun Cho,et al.  Cost Analysis of Optimistic Recovery Model for Forked Checkpointing , 2003 .

[9]  Kai Li,et al.  Libckpt: Transparent Checkpointing under UNIX , 1995, USENIX.

[10]  Micah Beck,et al.  Compiler-Assisted Memory Exclusion for Fast Checkpointing , 1995 .

[11]  Jehoshua Bruck,et al.  An on-line algorithm for checkpoint placement , 1996, Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering.