|Title||Revisiting the Double Checkpointing Algorithm|
|Publication Type||Conference Paper|
|Year of Publication||2013|
|Authors||Dongarra, J., T. Herault, and Y. Robert|
|Conference Name||15th Workshop on Advances in Parallel and Distributed Computational Models, at the IEEE International Parallel & Distributed Processing Symposium|
|Conference Location||Boston, MA|
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 Kale , with the non-blocking algorithm of Ni, Meneses and Kale  in terms of both performance and risk. We also extend the model proposed in ,  to assess the impact of the overhead associated to non-blocking communications. We then provide a new peer-topeer 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.
Revisiting the Double Checkpointing Algorithm