Efficient checkpoint/verification patterns

Abstract : Errors have become a critical problem for high performance computing. Checkpointing protocols are often used for error recovery after fail-stop failures. However, silent errors cannot be ignored, and their peculiarity is that such errors are identified only when the corrupted data is activated. To cope with silent errors, we need a verification mechanism to check whether the application state is correct. Checkpoints should be supplemented with verifications to detect silent errors. When a verification is successful, only the last checkpoint needs to be kept in memory because it is known to be correct. In this paper, we analytically determine the best balance of verifications and checkpoints so as to optimize platform throughput. We introduce a balanced algorithm using a pattern with p checkpoints and q verifica-tions, which regularly interleaves both checkpoints and verifications across same-size computational chunks. We show how to compute the waste of an arbitrary pattern, and we prove that the balanced algorithm is optimal when the platform MTBF (Mean Time Between Failures) is large in front of the other parameters (checkpointing, verification and recovery costs). We conduct several simulations to show the gain achieved by this balanced algorithm for well-chosen values of p and q, compared to the base algorithm that always perform a verification just before taking a checkpoint (p = q = 1), and we exhibit gains of up to 19%.
Type de document :
Article dans une revue
International Journal of High Performance Computing Applications, SAGE Publications, 2016, 3 (1), pp.52-65. 〈10.1177/1094342015594531〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal-ens-lyon.archives-ouvertes.fr/ensl-01252342
Contributeur : Equipe Roma <>
Soumis le : jeudi 7 janvier 2016 - 14:43:14
Dernière modification le : samedi 21 avril 2018 - 01:27:30
Document(s) archivé(s) le : vendredi 8 avril 2016 - 13:25:57

Fichier

main-IJHPCA.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Anne Benoit, Saurabh K. Raina, Yves Robert. Efficient checkpoint/verification patterns. International Journal of High Performance Computing Applications, SAGE Publications, 2016, 3 (1), pp.52-65. 〈10.1177/1094342015594531〉. 〈ensl-01252342〉

Partager

Métriques

Consultations de la notice

238

Téléchargements de fichiers

119