Towards Optimal Multi-Level Checkpointing - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2016

Towards Optimal Multi-Level Checkpointing

Résumé

We provide a framework to analyze multi-level checkpointing protocols, by formally defining a $k$-level checkpointing pattern. We provide a first-order approximation to the optimal checkpointing pattern, and show that the corresponding overhead is of the order of $\sum_{\ell=1}^{k}\sqrt{2\la_\ell C_\ell}$, where $\la_\ell$ is the error rate at level~$\ell$, and $C_\ell$ the checkpointing cost at level~$\ell$. This nicely extends the classical Young/Daly formula. Furthermore, we are able to fully characterize the shape of the optimal pattern (number and positions of checkpoints), and we provide a dynamic programming algorithm to determine which levels should be used. Finally, we perform simulations to check the accuracy of the theoretical study and to confirm the optimality of the subset of levels returned by the dynamic programming algorithm. The results nicely corroborate the theoretical study, and demonstrate the usefulness of multi-level checkpointing with the optimal subset of levels.
Fichier principal
Vignette du fichier
RR-8930.pdf (842.96 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01339788 , version 1 (30-06-2016)
hal-01339788 , version 2 (14-12-2016)
hal-01339788 , version 3 (19-12-2016)

Identifiants

  • HAL Id : hal-01339788 , version 1

Citer

Anne Benoit, Aurélien Cavelan, Valentin Le Fèvre, Yves Robert, Hongyang Sun. Towards Optimal Multi-Level Checkpointing. [Research Report] RR-8930, INRIA Grenoble - Rhone-Alpes. 2016. ⟨hal-01339788v1⟩
139 Consultations
210 Téléchargements

Partager

Gmail Facebook X LinkedIn More