The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Adaptive incremental checkpointing for massively parallel systems
Abstract
Given the scale of massively parallel systems, occurrence of faults is no longer an exception but a regular event. Periodic checkpointing is becoming increasingly important in these systems. However, huge memory footprints of parallel applications place severe limitations on scalability of normal checkpointing techniques. Incremental checkpointing is a well researched technique that addresses scalability concerns, but most of the implementations require paging support from hardware and the underlying operating system, which may not be always available. In this paper, we propose a software based adaptive incremental checkpoint technique which uses a secure hash function to uniquely identify changed blocks in memory. Our algorithm is the first self-optimizing algorithm that dynamically computes the optimal block boundaries, based on the history of changed blocks. This provides better opportunities for minimizing checkpoint file size. Since the hash is computed in software, we do not need any system support for this. We have implemented and tested this mechanism on the BlueGene/L system. Our results on several well-known benchmarks are encouraging, both in terms of reduction in average checkpoint file size and adaptivity towards application’s memory access patterns.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Cited by
Design, Modeling, and Evaluation of a Scalable Multi-level Checkpointing System
Moody, A., Bronevetsky, G., Mohror, K., & Supinski, B. R. D. (2010) · 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2010.18 · Cited by 521
Metadata
- Authors
- Agarwal, S., Garg, R., Gupta, M. S., & Moreira, J. E.
- Venue
- Proceedings of the 18th annual international conference on Supercomputing
- Publisher
- ACM
- Published
- 2004-06-26
- Pages
- 277-286
- OpenAlex
- W2165022815
- Cited by
- 183
- References
- 1
- FWCI
- 3.17
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Adaptive incremental checkpointing for massively parallel systems. https://app.cochat.ai/papers/10.1145/1006209.1006248
- The paper
- Agarwal, S., Garg, R., Gupta, M. S., & Moreira, J. E. (2004). Adaptive incremental checkpointing for massively parallel systems. Proceedings of the 18th annual international conference on Supercomputing. https://doi.org/10.1145/1006209.1006248
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.