Checkpointing à la Young/Daly: An Overview
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|