Submitted by claxton on
| Title | Checkpointing à la Young/Daly: An Overview |
| Publication Type | Conference Proceedings |
| Year of Publication | 2022 |
| Authors | Benoit, A., Y. Du, T. Herault, L. Marchal, G. Pallez, L. Perotin, Y. Robert, H. Sun, and F. Vivien |
| Conference Name | IC3-2022: Proceedings of the 2022 Fourteenth International Conference on Contemporary Computing |
| Pagination | 701-710 |
| Date Published | 2022-08 |
| Publisher | ACM Press |
| Conference Location | Noida, India |
| ISBN Number | 9781450396752 |
| 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. |
| URL | https://dl.acm.org/doi/fullHtml/10.1145/3549206.3549328 |
| DOI | 10.1145/3549206 |
File:
External Publication Flag:
