ACM Home Page
Please provide us with feedback. Feedback
Adaptive page-level incremental checkpointing based on expected recovery time
Full text PdfPdf (616 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2006 ACM symposium on Applied computing table of contents
Dijon, France
SESSION: Operating systems and adaptive applications (OSAA) table of contents
Pages: 1472 - 1476  
Year of Publication: 2006
ISBN:1-59593-108-2
Authors
Sangho Yi  Seoul National University
Junyoung Heo  Seoul National University
Yookun Cho  Seoul National University
Jiman Hong  Kwangwoon University
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 40,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1141277.1141620
What is a DOI?

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

Collaborative Colleagues:
Sangho Yi: colleagues
Junyoung Heo: colleagues
Yookun Cho: colleagues
Jiman Hong: colleagues