The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Design, Modeling, and Evaluation of a Scalable Multi-level Checkpointing System
Abstract
High-performance computing (HPC) systems are growing more powerful by utilizing more hardware components. As the system mean-time-before-failure correspondingly drops, applications must checkpoint more frequently to make progress. However, as the system memory sizes grow faster than the bandwidth to the parallel file system, the cost of checkpointing begins to dominate application run times. Multi-level checkpointing potentially solves this problem through multiple types of checkpoints with different costs and different levels of resiliency in a single run. This solution employs lightweight checkpoints to handle the most common failure modes and relies on more expensive checkpoints for less common, but more severe failures. This theoretically promising approach has not been fully evaluated in a large- scale, production system context. We have designed the Scalable Checkpoint/Restart (SCR) library, a multi-level checkpoint system that writes checkpoints to RAM, Flash, or disk on the compute nodes in addition to the parallel file system. We present the performance and reliability properties of SCR as well as a probabilistic Markov model that predicts its performance on current and future systems. We show that multi-level checkpointing improves efficiency on existing large-scale systems and that this benefit increases as the system size grows. In particular, we developed low-cost checkpoint schemes that are 100x-1000x faster than the parallel file system and effective against 85% of our system failures. This leads to a gain in machine efficiency of up to 35%, and it reduces the the load on the parallel file system by a factor of two on current and future systems.
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
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · Proceedings of the 1988 ACM SIGMOD international conference on Management of data - SIGMOD '88 · doi:10.1145/50202.50214 · Cited by 1,443
The Use of Triple-Modular Redundancy to Improve Computer Reliability
Lyons, R. E., & Vanderkulk, W. (1962) · IBM Journal of Research and Development · doi:10.1147/rd.62.0200 · Cited by 780
A large-scale study of failures in high-performance computing systems
Schroeder, B., & Gibson, G. A. (2006) · International Conference on Dependable Systems and Networks (DSN'06) · doi:10.1109/dsn.2006.5 · Cited by 584
Understanding failures in petascale computers
Schroeder, B., & Gibson, G. A. (2007) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/78/1/012022 · Cited by 358
Adaptive incremental checkpointing for massively parallel systems
Agarwal, S., Garg, R., Gupta, M. S., & Moreira, J. E. (2004) · Proceedings of the 18th annual international conference on Supercomputing · doi:10.1145/1006209.1006248 · Cited by 183
Processor Allocation and Checkpoint Interval Selection in Cluster Computing Systems
Plank, J. S., & Thomason, M. G. (2001) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.2001.1757 · Cited by 92
Cited by
A survey of AIOps methods for failure management
Notaro, P., Cardoso, J., & Gerndt, M. (2021) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3483424 · Cited by 142
Understanding Error Propagation in GPGPU Applications
Li, G., Pattabiraman, K., Cher, C.-Y., & Bose, P. (2016) · SC16: International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2016.20 · Cited by 89
Metadata
- Authors
- Moody, A., Bronevetsky, G., Mohror, K., & Supinski, B. R. D.
- Venue
- 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
- Publisher
- IEEE
- Published
- 2010-11
- Pages
- 1-11
- OpenAlex
- W1984564341
- Cited by
- 521
- References
- 7
- FWCI
- 31.23
- 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: Design, Modeling, and Evaluation of a Scalable Multi-level Checkpointing System. https://app.cochat.ai/papers/10.1109/sc.2010.18
- The paper
- Moody, A., Bronevetsky, G., Mohror, K., & Supinski, B. R. D. (2010). Design, Modeling, and Evaluation of a Scalable Multi-level Checkpointing System. 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis. https://doi.org/10.1109/sc.2010.18
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.