Revisiting the double checkpointing algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Revisiting the double checkpointing algorithm


Fast checkpointing algorithms require distributed access to stable storage. This paper revisits the approach base upon double checkpointing, and compares the blocking algorithm of Zheng, Shi and Kalé, with the non-blocking algorithm of Ni, Meneses and Kalé in terms of both performance and risk. We also extend the model that they have proposed to assess the impact of the overhead associated to non-blocking communications. We then provide a new peer-to-peer checkpointing algorithm, called the triple checkpointing algorithm, that can work at constant memory, and achieves both higher efficiency and better risk handling than the double checkpointing algorithm. We provide performance and risk models for all the evaluated protocols, and compare them through comprehensive simulations.
Voir le résumé en anglais.
Fichier principal
Vignette du fichier
buddy.pdf (521.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00925168 , version 1 (07-01-2014)


  • HAL Id : hal-00925168 , version 1


Jack Dongarra, Thomas Herault, Yves Robert. Revisiting the double checkpointing algorithm. APDCM 2013, IEEE, 2013, Boston, United States. ⟨hal-00925168⟩
173 View
261 Download


Gmail Facebook Twitter LinkedIn More