Checkpointing à la Young/Daly: An Overview
- Benoit, Anne
- Du, Yishu
- Herault, Thomas
- Marchal, Loris
- Pallez, Guillaume
- Perotin, Lucas
- Robert, Yves
- Sun, Hongyang
- Vivien, Frédéric
Publication date
August 2022
DOI Publisher
Association for Computing Machinery (ACM)Abstract
International audienceThe 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
Add to ORKG