Abstract
In this paper, we present a unified model for several well-known checkpoint/restart protocols. The proposed model is generic enough to encompass both extremes of the checkpoint/restart space, from coordinated approaches to a variety of uncoordinated checkpoint strategies (with message logging). We identify a set of crucial parameters, instantiate them, and compare the expected efficiency of the fault tolerant protocols, for a given application/platform pair. We then propose a detailed analysis of several scenarios, including some of the most powerful currently available high performance computing platforms, as well as anticipated Exascale designs. The results of this analytical comparison are corroborated by a comprehensive set of simulations. Altogether, they outline comparative behaviors of checkpoint strategies at very large scale, thereby providing insight that is hardly accessible to direct experimentation.
Original language | English (US) |
---|---|
Pages (from-to) | 2772-2791 |
Number of pages | 20 |
Journal | Concurrency and Computation: Practice and Experience |
Volume | 26 |
Issue number | 17 |
DOIs | |
State | Published - Dec 10 2014 |
Keywords
- Checkpoint/restart
- Checkpointing waste optimization problem
- Coordinated checkpoint
- Hierarchical checkpoint with message logging
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Computer Science Applications
- Computer Networks and Communications
- Computational Theory and Mathematics