Scalable Distributed Checkpointing Algorithm

Abstract

A communication-induced checkpointing algorithm, named HMNR, was introduced to effectively use control information of every other process piggybacked on each sent message for minimizing the number of forced checkpoints. Then, an improved algorithm, called Lazy-HMNR, was presented to lower the possibility of taking forced checkpoints incurred by the asymmetry between checkpointing frequencies of processes. Despite these two different minimization techniques, if the high message interaction traffic occurs, Lazy-HMNR may considerably lower the probability of detecting Z-cycle free patterns due to its shortcoming. Also, there is no prior research attempt to design the algorithms considering network topologies for making the number of forced checkpoints as few as possible with control information piggybacked on each message. This paper introduces a new Lazy-HMNR algorithm for group communication-based distributed systems to synergistically decrease the number of forced checkpoints in a more effective manner.