Advertisement

Self-stabilizing Checkpointing Algorithm in Ring Topology

  • Partha Sarathi Mandal
  • Krishnendu Mukhopadhyaya
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3741)

Abstract

If the variables used for a checkpointing algorithm have data faults, the algorithm may fail. In this paper, a self-stabilizing checkpointing algorithm is proposed for handling data faults in a ring network. The proposed algorithm can deal with concurrent initiations of checkpointing and at most one data fault per process. However, several processes may be faulty.

Keywords

Ring Topology Message Complexity Indian Statistical Institute Ring Network Data Fault 
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.
    Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Communications of the ACM 17, 643–644 (1974)zbMATHCrossRefGoogle Scholar
  2. 2.
    Ghosh, S., He, X.: Scalable Self-Stabilization. Journal of Parallel and Distributed Computing 62(5), 945–960 (2002)zbMATHCrossRefGoogle Scholar
  3. 3.
    Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.V.: Fault-containing self-stabilizing algorithms. In: Proc. 15th ACM Symp. Princ. of Distrib. Comput., pp. 45–54 (1996)Google Scholar
  4. 4.
    Schneider, M.: Self-Stabilization. ACM Computing Surveys 25(1), 45–67 (1993)CrossRefGoogle Scholar
  5. 5.
    Chandy, K.M., Lamport, L.: Distributed snapshots: Determining global states of distributed systems. ACM Trans. Comput. Syst. 3(1), 63–75 (1985)CrossRefGoogle Scholar
  6. 6.
    Manivannan, D., Singhal, M.: Quasi-synchronous checkpointing: Models, characterization, and classification. IEEE Trans. on Parallel and Distributed Systems 10(7), 703–713 (1999)CrossRefGoogle Scholar
  7. 7.
    Vidya, N.H.: Staggered consistent checkpointing. IEEE Trans. on Parallel and Distributed Systems 10(7), 694–702 (1999)CrossRefGoogle Scholar
  8. 8.
    Mandal, P.S., Mukhopadhyaya, K.: Concurrent checkpoint initiation and recovery algorithms on asynchronous ring networks. Journal of Parallel and Distributed Computing 64(5), 649–661 (2004)zbMATHCrossRefGoogle Scholar
  9. 9.
    Mandal, P.S., Mukhopadhyaya, K.: Self-Stabilizing checkpointing algorithm in ring topology, TR: ACMU/2005/01. Indian Statistical Institute, Kolkata (2005)Google Scholar
  10. 10.
    Spezialetti, M., Kearns, P.: Efficient distributed snapshots. In: Proc. 6th International Conference on Distributed Computing Systems, pp. 382–388 (1986)Google Scholar
  11. 11.
    Prakash, R., Singhal, M.: Maximal global snapshot with concurrent initiators. In: Proc. 6th IEEE Symp. Parallel and Distrib, October 1994, pp. 334–351 (1994)Google Scholar
  12. 12.
    Manivannan, D., Singhal, M.: Asynchronous recovery without using vector timestamps. J. Parallel Distrib. Comput. 62(12), 1695–1728 (2002)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Partha Sarathi Mandal
    • 1
  • Krishnendu Mukhopadhyaya
    • 1
  1. 1.Advanced Computing and Microelectronics UnitIndian Statistical InstituteKolkataIndia

Personalised recommendations