Using Computing Checkpoints Implement Consistent Low-Cost Non-blocking Coordinated Checkpointing
Two approaches are used to reduce the overhead associated with coordinated checkpointing:one is to reduce the number of synchronization messages and the number of checkpoints;the other is to make the checkpointing process non-blocking.In this paper, we introduce the concept of “computing checkpoint” to design an efficient consistent non-blocking coordinated checkpointing algorithm that combines these two approaches.Through piggybacking the information that which processes have taken new checkpoints in the broadcast committing message, the checkpoint sequence number of every process can be kept consistent in all processes,so that the unnecessary checkpoints and orphan messages can be avoided in the future running.The algorithm needn’t block any process and has lower overhead than other proposed consistent coordinated checkpointing algorithms.
KeywordsRequest Message Reply Message Synchronization Message Checkpoint Interval Mutable Checkpoint
Unable to display preview. Download preview PDF.
- 10.Helary, J.M., Mostefaoui, A., Netzer, R.H.B., Raynal, M.: Preventing Useless Checkpoints in Distributed Computations. In: Proceedings of 16th Symposium on Reliable Distributed Systems, pp. 183–190. IEEE Press, Durham (1997)Google Scholar