@inproceedings {, title = {Checkpointing {\`a} la Young/Daly: An Overview}, journal = {IC3-2022: Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing}, year = {2022}, month = {2022-08}, pages = {701-710}, publisher = {ACM Press}, address = {Noida, India}, abstract = {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.}, isbn = {9781450396752}, doi = {10.1145/3549206}, url = {https://dl.acm.org/doi/fullHtml/10.1145/3549206.3549328}, author = {Anne Benoit and Yishu Du and Thomas Herault and Loris Marchal and Guillaume Pallez and Lucas Perotin and Yves Robert and Hongyang Sun and Frederic Vivien} }