On The Theory of Speculative Checkpointing: Time and Energy Considerations
Collective checkpoint-rollback is the most popular approach to dealing with fail-stop errors on high-performance computing (HPC) platforms. Prior work has focused on choosing checkpoint intervals that minimize the total cost of checkpoint-rollback. In this paper, we introduce the notion of speculative checkpointing, where we probabilistically skip some checkpoints. Careful choice of check- points to be taken or skipped has the potential to further reduce the total checkpoint-rollback overhead. We mathematically formulate the overall checkpoint-rollback cost in the presence of speculation. We consider the choice of speculation being a fixed probability or a probability distribution. We formulate two criteria to be minimized: total execution time and approximate total energy. We derive the criteria for beneficial speculative checkpointing for exponential and arbitrary failure distributions. Further, we analyze the joint optimization of energy and time to mathematically express the trade-offs.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1572687
- Report Number(s):
- PNNL-SA-132987
- Resource Relation:
- Conference: Proceedings of the 15th ACM International Conference on Computing Frontiers (CF 2018), May 8-10, 2018, Ischia, Italy
- Country of Publication:
- United States
- Language:
- English
Similar Records
Analyzing checkpointing trends for applications on the IBM Blue Gene/P system.
Towards Low-Overhead Resilience for Data Parallel Deep Learning