Advertisement

An Efficient and Scalable Checkpointing and Recovery Algorithm for Distributed Systems

  • K. P. Krishna Kumar
  • R. C. Hansdah
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4308)

Abstract

In this paper, we describe an efficient coordinated checkpointing and recovery algorithm which can work even when the channels are assumed to be non-FIFO, and messages may be lost. Nodes are assumed to be autonomous, and they do not block while taking checkpoints. Based on the local conditions, any process can request the previous coordinator for the ’permission’ to initiate a new checkpoint. Allowing multiple initiators of checkpoints avoids the bottleneck associated with a single initiator, but the algorithm permits only a single instance of checkpointing process at any given time, thus reducing much of the overhead associated with multiple initiators of distributed algorithms.

Keywords

Control Message Recovery Algorithm Message Overhead Receiver Process Application Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Koo, R., Toueg, S.: Checkpointing and rollback-recovery for distributed systems. IEEE Transactions on Software Engineering 13(1), 23–31 (1987)zbMATHCrossRefGoogle Scholar
  2. 2.
    Silva, L.M., Silva, J.G.: Global checkpointing for distributed programs. In: Proceedings of the 10th Symposium on Reliable Distributed Systems, pp. 155–162 (1992)Google Scholar
  3. 3.
    Prakash, R., Singhal, M.: Low cost checkpointing and failure recovery in mobile computing systems. IEEE Transactions on Parallel and Distributed Systems 7(10), 1035–1048 (1996)CrossRefGoogle Scholar
  4. 4.
    Elnozahy, E., Johnson, D., Yang, Y.: A survey of rollback-recovery protocols in message passing systems. ACM Computing Surveys 34(3), 375–408 (2002)CrossRefGoogle Scholar
  5. 5.
    Manivannan, D., Singhal, M.: Quasi synchronous checkpointing: Models, characterization and classification. IEEE Transactions on Parallel and Distributed Systems 10(7), 206–216 (1999)CrossRefGoogle Scholar
  6. 6.
    Briatico, D., Ciuffoletti, A., Simoncini, L.: A distributed domino-effect free recovery algorithm. In: Proceedings of the IEEE International Symposium on Reliability, Distributed Software and Databases, pp. 207–215 (1984)Google Scholar
  7. 7.
    Manivannan, D., Singhal, M.: A low overhead recovery technique using quasi synchronous checkpointing. In: Proceedings of the IEEE International Conference on Distributed Computing Systems, pp. 100–107 (1996)Google Scholar
  8. 8.
    Baldoni, R., Quaglia, F., Fornara, P.: An index-based checkpointing algorithm for autonomous distributed systems. In: Proceedings of the IEEE International Conference on Distributed Computing Systems, pp. 181–188 (1999)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • K. P. Krishna Kumar
    • 1
  • R. C. Hansdah
    • 1
  1. 1.Dept. of Computer Science & AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations