Checkpointing à la Young/Daly: An Overview - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Checkpointing à la Young/Daly: An Overview


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.
Fichier principal
Vignette du fichier
ic3-invited.pdf (643.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03830322 , version 1 (26-10-2022)



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⟩
42 View
36 Download



Gmail Facebook Twitter LinkedIn More