Skip to Main content Skip to Navigation
New interface
Conference papers

Application-Based Coarse-Grained Incremental Checkpointing Based on Non-volatile Memory

Abstract : The Mean Time to Failure continues to decrease as the scaling of computing systems. To maintain the reliability of computing systems, checkpoint has to be taken more frequently. Incremental checkpointing is a well-researched technique that makes frequent checkpointing possible. Fine-grained incremental checkpointing minimizes checkpoint size but suffers from significant monitoring overhead. We observe the memory access at page granularity and find that the size of contiguous memory regions visited by applications tends to be proportional to size of corresponding memory allocation. In this paper, we propose the Application-Based Coarse-Grained Incremental Checkpointing (ACCK) that leverages the priori information of the memory allocation to release the memory monitoring granularity in an incremental and appropriate way. This provides better opportunities for balancing the tradeoff between monitoring and copying overhead. ACCK is also assisted by hugepage to alleviate the TLB overhead. Our experiment shows that ACCK presents 2.56x performance improvement over the baseline mechanism.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 24, 2017 - 4:49:04 PM
Last modification on : Tuesday, September 3, 2019 - 3:04:02 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Zhan Shi, Kai Lu, Xiaoping Wang, Wenzhe Zhang, Yiqi Wang. Application-Based Coarse-Grained Incremental Checkpointing Based on Non-volatile Memory. 13th IFIP International Conference on Network and Parallel Computing (NPC), Oct 2016, Xi'an, China. pp.45-57, ⟨10.1007/978-3-319-47099-3_4⟩. ⟨hal-01648000⟩



Record views


Files downloads