Adaptive page-level incremental checkpointing based on expected recovery time

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.

[1]  Jehoshua Bruck,et al.  An On-Line Algorithm for Checkpoint Placement , 1997, IEEE Trans. Computers.

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

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

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

[5]  Yookun Cho,et al.  Space-efficient page-level incremental checkpointing , 2005, SAC '05.

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

[7]  Andrzej Duda,et al.  The Effects of Checkpointing on Program Execution Time , 1983, Inf. Process. Lett..

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