Skip to main content

Independent Global Snapshots in Large Distributed Systems

  • Chapter
New Horizons of Parallel and Distributed Computing
  • 334 Accesses

Abstract

Distributed systems depend on consistent global snapshots for process recovery and garbage collection activity. We provide exact conditions for an arbitrary checkpoint based on independent dependency tracking within clusters of nodes. The method permits that nodes (within clusters) can independently compute dependency information based on available (local) information.

The existing models of global snapshot computations provide the necessary and sufficient conditions. But, these require expensive global computations. The proposed computations can be performed by a node to identify existing global checkpoints. The nodes can also compute conditions to make a checkpoint, or conditions, such that a collection of checkpoints, can belong to a global snapshot.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.H. Abawajy, Orphan Problems and Remedies in Distributed Systems, Operating Systems Review, vol. 27, no. 1, 1993, pp. 27–32.

    Article  Google Scholar 

  2. M. Ahuja, A.D. Kshemkalyani and T. Carlson, A Basic Unit of Computation in Distributed Systems, In Proceedings of 10th Int. Conference on Distributed Computer Systems, 1990, pp. 12–19.

    Google Scholar 

  3. S. Bhalla, and M.V. Sreenivas, Independent Node and Process Recovery in Message Passing Distributed Systems, Proceedings of the 3rd International Conference on High Performance Computing, Trivandrum, IEEE Computer Society Press, December 1996, pp. 283–288.

    Google Scholar 

  4. B. Bhargava and S.R. Lian, “Independent checkpoint and Concurrent Rollback for Recovery-An Optimistic Approach”, in Proceedings of IEEE Symposium on Reliable Distributed Systems, 1988, pp 3–12.

    Google Scholar 

  5. A.D. Birrel and B.J. Nelson, Implementing Remote Procedure Calls, ACM Transactions on Computer Systems, vol. 2, no. 1, 1984, pp. 39–58.

    Article  Google Scholar 

  6. K.M. Chandy, and L. Lamport, Distributed Snapshots: Determining global states of Distributed Systems, ACM Transactions on Computer Systems, vol. 3, no. 1, 1985, pp. 63–75.

    Article  Google Scholar 

  7. E.N. Elnozahy, D.B. Johnson, Y.M. Wang, ”A Survey of Rollback-Recovery Protocols in Message-Passing Systems,” technical report CMU-CS-96-181, Carnegie Mellon University, USA, 1996, pp. 1–46.

    Google Scholar 

  8. A.P. Goldberg, A. Gopal, A. Lowry and R. Strom, Restoring Consistent Global States of Distributed Computations, In Proc. oftheACM/ONR Workshop on Parallel and Distributed Debugging, Santa Cruz, CA, 1991, pp. 144–154.

    Google Scholar 

  9. J. Gray, Notes on Database Operating Systems, Operating Systems: An Advanced Course, Lecture Notes in Computer Science LNCS 60, Springer-Verlag, 1978, pp. 393–481.

    Google Scholar 

  10. D.B. Johnson, and W. Zwaenepoel, Recovery in Distributed Systems Using Optimistic Message Logging and Check-pointing, Journal of Algorithms, 11, 1990, pp. 462–491.

    Article  MathSciNet  Google Scholar 

  11. D.B. Johnson, and W. Zwaenepoel, Recovery in Distributed Systems Using Optimistic Message Logging and Check-pointing, Proceedings of ACM Symposium on Principles of Distributed Computing, 1988, pp. 171–180.

    Google Scholar 

  12. T. Juang and S. Venkatesan, Efficient Algorithms for Crash Recovery in Distributed Systems, Lecture Notes in Computer Science LNCS 472, Springer-Verlag, 1990, pp. 349–361.

    Google Scholar 

  13. T. Juang and S. Venkatesan,, Crash Recovery with Little Overhead, In Proceedings of the 11th International Conference on Distributed Computing Systems, 1991, pp. 454–461.

    Google Scholar 

  14. S. Hariri and A. Choudhary, Architectural Support for Designing Fault-Tolerant Open Distributed Systems, IEEE Computer, June, 1992, pp. 50–62.

    Google Scholar 

  15. J.-M. Helary, R.H.B. Netzer, and M. Raynal, ”Consistency Issues in Distributed Checkpoints,” IEEE Transactions on Software Engineering, Vol. 25, No. 2, March–April 1999.

    Google Scholar 

  16. J.-M. Helary, A. Mostefaoui, and M. Raynal, ”Communication-Induced Determination of Consistent Snapshots,“ IEEE Transactions on Software Engineering, Vol. 25, No. 2, March–April 1999.

    Google Scholar 

  17. J.L. Kim and T. Park, ”An efficient Protocol for Checkpointing Recovery in Distributed Systems“, IEEE Transactions on Parallel and Distributed Systems, vol. 4., no. 8, pp. 955–960, August 1993.

    Article  Google Scholar 

  18. R. Koo, and S. Toueg, Checkpointing and Rollback Recovery for Distributed Systems, IEEE Transactions on Software Engineering, vol. SE-13, no. 1, 1987, pp. 23–31.

    Google Scholar 

  19. L. Lamport, ”Time, Clocks, and the Ordering of Events in a Distributed System”, Communications of ACM, vol. 21, no. 7, pp. 558–565, July 1978.

    Article  MATH  Google Scholar 

  20. A. Lowry, J.R. Russell and A.P. Goldberg, Optimistic Failure Recovery for Very Large Networks, Proceedings of 10th Symposium on Reliable Distributed Systems, 1991, pp. 66–75.

    Google Scholar 

  21. F. Mattern, ”Efficient Algorithms for Distributed Snapshots and Global Virtual Time Appriximation”, Journal of Parallel and Distributed Computing, August 1993, pp. 423–434.

    Google Scholar 

  22. D. Manivannan, R.H.B. Netzer and M. Singhal, ”Finding Consistent Global Checkpoints in a Distributed Computation”, IEEE Transactions on Parallel and Distributed Systems, vol. 8, No. 6, June 1997, pp. 623–627.

    Article  Google Scholar 

  23. C. Morin, and I. Puaut, ”A Survey of Recoverable Distributed Shared Virtual Memory Systems”, IEEE Transactions on Parallel and Distributed Systems, vol. 8, No. 9, September 1997, pp. 959–969.

    Article  Google Scholar 

  24. R.H.B. Netzer and J. Xu, ”Necessary and Sufficient Conditions for Consistent Global Snapshots”, IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 2, Feb 1995, pp. 165–169.

    Article  Google Scholar 

  25. M.T. Ozsu, and P. Valduriez, Principles of Distributed Database Systems, New Jersey: Prentice Hall, 1990.

    Google Scholar 

  26. M.L. Powell and D.L. Presotto, Publishing: A Reliable broadcast Communication Mechanism, Proc. of 9th ACM Symposium on Operating System Principles, October 1983, pp. 100–109.

    Google Scholar 

  27. B. Randell, System Structure for Software Fault Tolerance, IEEE Transactions on Software Engineering, SE-1, no. 2, 1975, pp. 220–232.

    Google Scholar 

  28. B. Randell, P.A. Lee and P.C. Treleaven, Reliability Issues in Computing Systems Design, ACM Computing Surveys, vol. 10, no. 2, June 1978, pp. 123–166.

    Article  Google Scholar 

  29. D.L. Russell, State Restoration in Systems of Communicating Processes, IEEE Transactions on Software Engineering, SE-6, no. 2, 1980, pp. 183–194.

    Google Scholar 

  30. R.D. Schlichting, and F.B. Schneider, Fail-Stop Processors: An approach to Designing Fault-Tolerant Distributed Computing Systems, ACM Transactions on Computer Systems, vol. 1, no. 3, 1983, pp. 222–238.

    Article  Google Scholar 

  31. FB. Schneider, Byzantine Generals in Action: Implementing Fail-Stop Processors, ACM Transactions on Computer Systems, vol. 2, no. 2, 1984, pp. 145–154.

    Article  Google Scholar 

  32. A. Sistla and J. Welch, Efficient Distributed Recovery Using Message Logging, In Proc. of ACM Symposium on Principles of Distributed Computing, 1989, pp. 223–238.

    Google Scholar 

  33. R.E. Strom, and S. Yemini, Optimistic Recovery in Distributed Systems, ACM Transactions on Computer Systems, vol. 3, no. 3, August 1985, pp. 204–226.

    Article  Google Scholar 

  34. M.V. Sreenivas, and S. Bhalla, Garbage Collection in Message Passing Distributed Systems, in Proceedings of International Symposium on Parallel Algorithms /Architecture Synthesis, March 1995, IEEE Computer Society Press.

    Google Scholar 

  35. M.V. Sreenivas, and S. Bhalla, Independent Global Snapshots in Large Distributed Systems, Proceedings of the 4th International Conference on High Performance Computing, Banglore, IEEE Computer Society Press, December 1997, pp. 462–467.

    Google Scholar 

  36. G. Tel, “Introduction to Distributed Algorithms”, on Snapshots, chapter 10, Cambridge University Press, 1994.

    Google Scholar 

  37. K. Venkatesh, T. Radhakrishnan and H. Li, Optimal Checkpointing and Local Recording for Domino-free Rollback Recovery, Information Processing Letters, 25,5, 1987, pp. 295–304.

    Article  Google Scholar 

  38. S. Venkatesan, and T. Juang, Efficient Algorithms for Optimistic Crash Recovery, Distributed Computing, Volume 8, No. 2, pp. 105–114, Springer-Verlag, 1994.

    Article  Google Scholar 

  39. Yi-Min Wang, “Consistent Global Checkpoints that Contain a Given Set of Local Checkpoints” IEEE Transactions on Computers, Vol. 46, No. 4, April 1997, pp. 456–468.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Sreenivas, M.V., Bhalla, S. (2005). Independent Global Snapshots in Large Distributed Systems. In: Guo, M., Yang, L.T. (eds) New Horizons of Parallel and Distributed Computing. Springer, Boston, MA. https://doi.org/10.1007/0-387-28967-4_15

Download citation

  • DOI: https://doi.org/10.1007/0-387-28967-4_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-24434-1

  • Online ISBN: 978-0-387-28967-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics