Checkpointing à la Young/Daly: An Overview

Anne Benoit (1) , Yishu Du (1) , Thomas Herault (2) , Loris Marchal (1) , Guillaume Pallez (3) , Lucas Perotin (1) , Yves Robert (1) , Hongyang Sun (1) , Frédéric Vivien (1)

1 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
2 The University of Tennessee [Knoxville]
3 TADAAM - Topology-Aware System-Scale Data Management for High-Performance Computing

The Young/Daly formula provides an approximation of the optimal checkpoint period for a parallel application executing on a supercomputing platform. The Young/Daly formula was originally designed for preemptible tightly-coupled applications. We provide some background and survey various application scenarios to assess the usefulness and limitations of the formula.

Keywords: Checkpoint; Optimal period; Young/Daly formula

Domains: Computer Science [cs]; Distributed, Parallel, and Cluster Computing [cs.DC]; Performance [cs.PF]

Anne Benoit, Yishu Du, Thomas Herault, Loris Marchal, Guillaume Pallez, et al.. Checkpointing à la Young/Daly: An Overview. IC3 2022 - 2022 Fourteenth International Conference on Contemporary Computing, Aug 2022, Noida, India. pp.701-710, ⟨10.1145/3549206.3549328⟩. ⟨hal-03830322⟩