| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] |
¡@
Sangho Yi, Junyoung Heo, Yookun Cho and Jiman Hong+
School of Computer Science and Engineering
Seoul National University
Seoul 151-172, Korea
+School of Computing
Soongsil University
Seoul 156-743, Korea
E-mail: jiman@ssu.ac.kr
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, efficient intervals 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 taking point decision mechanism for minimizing the
total execution time. Our simulation results show that the expected execution time was
significantly reduced compared with existing periodic page-level incremental checkpointing.
Received November 15, 2006; accepted February 15, 2007.
Communicated by Sung Shin and Tei-Wei Kuo.
*This research was supported by the Soongsil University Research Fund and the Brain Korea 21 project. +Corresponding author