Skip to Main content Skip to Navigation
Reports

Revisiting the double checkpointing algorithm

Abstract : 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.
Complete list of metadatas

https://hal.inria.fr/hal-00768491
Contributor : Equipe Roma <>
Submitted on : Friday, December 21, 2012 - 4:25:22 PM
Last modification on : Wednesday, November 20, 2019 - 2:54:24 AM
Long-term archiving on: : Sunday, December 18, 2016 - 8:10:54 AM

File

RR-8196.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00768491, version 1

Collections

Citation

Jack Dongarra, Thomas Hérault, Yves Robert. Revisiting the double checkpointing algorithm. [Research Report] RR-8196, 2012. ⟨hal-00768491⟩

Share

Metrics

Record views

303

Files downloads

373