|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Hong, J., Kim, S., Cho, Y.: Cost analysis of optimistic recovery model for forked checkpointing. IEICE Transactions on Information and Systems E86-D (2003) 1534--1541
|
| |
2
|
Plank, J., Beck, M., Kingsley, G.: Compiler-assisted memory exclusion for fast checkpointing. In: IEEE Technical Committee on Operating Systems and Application Environments, Special Issue on Fault-Tolerance. (1995) 62--67
|
| |
3
|
|
| |
4
|
|
| |
5
|
Plank, J., Beck, M., Kingsley, G., Li, K.: Libckpt:transparent checkpointing under unix. In: Usenix Winter Technical Conference. (1995) 213--223
|
| |
6
|
|
| |
7
|
|
| |
8
|
Duda, A.: The effects of checkpointing on program execution time. Information Processing Letters 16 (1983) 221--229
|
 |
9
|
Junyoung Heo , Sangho Yi , Yookun Cho , Jiman Hong , Sung Y. Shin, Space-efficient page-level incremental checkpointing, Proceedings of the 2005 ACM symposium on Applied computing, March 13-17, 2005, Santa Fe, New Mexico
[doi> 10.1145/1066677.1067026]
|
|