Skip to content Skip to main navigation Report an accessibility issue

EECS Publication

Revisiting the Double Checkpointing Algorithm

Jack Dongarra, Thomas Herault, and Yves Robert

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 [1], with the non-blocking algorithm of Ni, Meneses and Kale [2] in terms of both performance and risk. We also extend the model proposed in [1], [2] 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.

Published  2013-01-03 05:00:00  as  ut-cs-13-705 (ID:17)


« Back to Listing