Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2006.13A.4.289

Taking Point Decision Mechanism of Page-level Incremental Checkpointing based on Cost Analysis of Process Execution Time  

Yi Sang-Ho (서울대학교 컴퓨터공학부)
Heo Jun-Young (서울대학교 컴퓨터공학부)
Hong Ji-Man (광운대학교 컴퓨터공학부)
Abstract
Checkpointing is an effective mechanism that allows a process to resume its execution that was discontinued by a system failure without having to restart from the beginning. Especially, page-level incremental checkpointing saves only the modified pages of a process to minimize the checkpointing overhead. This means that in incremental checkpointing, the time consumed for checkpointing varies according to the amount of modified pages. Thus, the efficient interval of checkpointing must be determined on run-time of the process. In this paper, we present an efficient and adaptive page-level incremental checkpointing facility that is based on the cost analysis of process execution time. In our simulation, results show that the proposed mechanism significantly reduced the average process execution time compared with existing fixed-interval-based page-level incremental checkpointing.
Keywords
Checkpointing and Recovery; Incremental Checkpointing; Fault-tolerance; Cost Analysis;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Duda, The effects of checkpointing on program execution time. Information Processing Letters 16, pp.221-229, 1983   DOI   ScienceOn
2 J. Heo, S. Yi Y. Cho, J. Hong, S.Y. Shin, Space-efficient Page-level Incremental Checkpointing. Proceedings of the 2005 ACM symposium on Applied computing, pp.1558-1562, 2005   DOI
3 M. Beck, J. S. Plank and G. Kingsley, Compiler-Assisted Checkpointing, Technical Report of University of Tennessee, UT-CS-94-269, 1994
4 J. Plank, Y. Chen, K. Li, M. Beck and G. Kingsley, Memory exclusion: optimizing the performance of checkpointing systems, Software Practice and Experience, Vol.29, No.2, pp.125-142, Feb., 1999   DOI   ScienceOn
5 J. Lawall and G. Muller, Efficient Incremental Checkpointing of Java Programs, IEEE Proceedings of the International Conference on Dependable Systems and Networks, pp.61-70, Jun., 2000   DOI
6 J. Plank, K. Li and M. Puening, Diskless Checkpointing, IEEE Transactions on Parallel and Distributed Systems, Vol.9, No. 10, pp.303-308, Oct., 1998   DOI   ScienceOn
7 J. Plank, M. Beck and G. Kingsley, and K. Li, Libckpt:Transparent Checkpointing under Unix, Usenix Winter Technical Conference, pp.213-223, Jan., 1995
8 J. Plank, J. Xu, and R. Netzer, Compressed differences: An algorithm for fast incremental checkpointing, Technical Report CS-95-302, Aug., 1995
9 J. Plank, M. Beck and G. Kingsley, Compiler-Assisted Memory Exclusion for Fast Checkpointing, IEEE Technical Committee on Operating Systems and Application Environments, Special Issue on Fault-Tolerance, pp.62-67, Dec., 1995
10 A. Ziv and J. Bruck, An On-Line Algorithm for Checkpoint Placement, IEEE Transactions on Computers, Vol.46, No.9, pp. 976-985, Sep., 1997   DOI   ScienceOn
11 J. Hong, S. Kim and Y. Cho, Cost Analysis of Optimistic Recovery Model for Forked Checkpointing, IEICE Transactions on Information and Systems, Vol.E86-D, No.9, pp.1534-1541, Sep., 2003