Speculative Memory Checkpointing

D. Vogt, G. Portokalidis, H.J. Bos, A.S. Tanenbaum, C. Giuffrida, Armando Miraglia

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

High-frequency memory checkpointing is an important technique in several application domains, such as automatic error recovery (where frequent checkpoints allow the system to transparently mask failures) and application debugging (where frequent checkpoints enable fast and accurate time-traveling support). Unfortunately, existing (typically incremental) checkpointing frameworks incur substantial performance overhead in high-frequency memory checkpointing applications, thus discouraging their adoption in practice.

This paper presents Speculative Memory Checkpointing (SMC), a new low-overhead technique for high-frequency memory checkpointing. Our motivating analysis identifies key bottlenecks in existing frameworks and demonstrates that the performance of traditional incremental checkpointing strategies in high-frequency checkpointing scenarios is not optimal. To fill the gap, SMC relies on working set estimation algorithms to eagerly checkpoint the memory pages that belong to the writable working set of the running program and only lazily checkpoint the memory pages that do not. Our experimental results demonstrate that SMC is effective in reducing the performance overhead of prior solutions, is robust to variations in the workload, and incurs modest memory overhead compared to traditional incremental checkpointing.
Original languageEnglish
Title of host publicationProceedings of the ACM/IFIP/USENIX Middleware Conference
PublisherACM
Pages197-209
ISBN (Print)978-1-4503-3618-5
DOIs
Publication statusPublished - 2015

Fingerprint Dive into the research topics of 'Speculative Memory Checkpointing'. Together they form a unique fingerprint.

  • Cite this

    Vogt, D., Portokalidis, G., Bos, H. J., Tanenbaum, A. S., Giuffrida, C., & Miraglia, A. (2015). Speculative Memory Checkpointing. In Proceedings of the ACM/IFIP/USENIX Middleware Conference (pp. 197-209). ACM. https://doi.org/10.1145/2814576.2814802