Skip to main content
SpringerLink
Log in

An overview of clock synchronization

  • Conference paper
  • First Online:
Fault-Tolerant Distributed Computing

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 448))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch, “Complexity of Network Synchronization,” J. ACM vol. 32, no. 4, pp. 804–823, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Arjomandi, M. Fischer, and N. Lynch, “Efficiency of Synchronous vs. Asynchronous Distributed Systems,” J. ACM, vol. 30, no. 3, pp. 449–456, July 1983.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Ben-Or, “Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols,” Proc. 2nd Ann. ACM Symp. on Principles of Distributed Computing, pp. 27–30, 1983.

    Google Scholar 

  4. J. Burns and N. Lynch, “The Byzantine Firing Squad Problem,” Advances in Computing Research: Parallel and Distributed Computing, vol. 4, JAI Press, 1987.

    Google Scholar 

  5. G. Bracha, “An O(log n) Expected Rounds Randomized Byzantine Generals Algorithm,” Proc. 17th Ann. ACM Symp. on Theory of Computing, pp. 316–326, 1985.

    Google Scholar 

  6. B. Coan, D. Dolev, C. Dwork, and L. Stockmeyer, “The Distributed Firing Squad Problem,” Proceedings of the 17th Ann. ACM Symp. on Theory of Computing, pp. 335–345, May 1985.

    Google Scholar 

  7. D. Dolev, private communication.

    Google Scholar 

  8. D. Dolev, C. Dwork, and L. Stockmeyer, “On the Minimal Synchronism Needed for Distributed Consensus,” J. ACM, vol. 34, no. 1, pp.77–97, Jan. 1987.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Dolev, J. Halpern, and H. R. Strong, “On the Possibility and Impossibility of Achieving Clock Synchronization,” Journal of Computer and System Sciences, vol. 32, no. 2, pp. 230–250, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  10. D. Dolev, J. Halpern, B. Simons, and H. R. Strong, “A New Look at Fault-Tolerant Network Routing,” Information and Computation, vol. 72, no. 3, pp. 180–198, March 1987.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. Dolev, N. Lynch, S. Pinter, E. Stark, and W. Weihl, “Reaching Approximate Agreement in the Presence of Faults,” J. ACM, vol. 33, no. 3, pp. 499–516, July 1986.

    Article  MathSciNet  Google Scholar 

  12. C. Dwork, N. Lynch, and L. Stockmeyer, “Consensus in the Presence of Partial Synchrony,” J. ACM, vol. 35, no. 2, pp. 288–323, 1988.

    Article  MathSciNet  Google Scholar 

  13. A. Fekete, “Asynchronous Approximate Agreement,” Proc. 6th Ann. ACM Symp. on Principles of Distributed Computing, pp. 64–76, Aug. 1987.

    Google Scholar 

  14. M. Fischer, N. Lynch, and M. Merritt, “Easy Impossibility Proofs for Distributed Consensus Problems,” Distributed Computing, vol.1, no.1, pp. 26–39, 1986.

    Article  MATH  Google Scholar 

  15. M. Fischer, N. Lynch, and M. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, pp. 374–382, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Halpern, N. Megiddo and A. Munshi, “Optimal Precision in the Presence of Uncertainty,” Journal of Complexity, vol. 1, pp. 170–196, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Halpern, B. Simons, R. Strong, and D. Dolev, “Fault-Tolerant Clock Synchronization,” Proc. 3rd Ann. ACM Symp. on Principles of Distributed Computing, pp. 89–102, Aug. 1984.

    Google Scholar 

  18. L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System,” C. ACM, vol. 27, no. 7, pp. 558–565, July, 1978.

    Article  Google Scholar 

  19. L. Lamport, “Using Time Instead of Timeout for Fault-Tolerant Distributed Systems,” Computer Networks, vol. 2, pp. 95–114, 1978.

    Article  MathSciNet  Google Scholar 

  20. J. Lundelius and N. Lynch, “An Upper and Lower Bound for Clock Synchronization,” Information and Control, vol. 62, nos. 2/3, pp. 190–204, Aug./Sept. 1984.

    Article  MATH  MathSciNet  Google Scholar 

  21. L. Lamport and P. Melliar-Smith, “Synchronizing Clocks in the Presence of Faults,” J. ACM, vol. 32, no. 1, pp. 52–78, Jan. 1985.

    Article  MATH  MathSciNet  Google Scholar 

  22. K. Marzullo, Loosely-Coupled Distributed Services: A Distributed Time Service, Ph.D. Thesis, Stanford Univ., 1983.

    Google Scholar 

  23. S. Mahaney and F. Schneider, “Inexact Agreement: Accuracy, Precision and Graceful Degradation,” Proc. 4th Ann. ACM Symp. on Principles of Distributed Computing, pp. 237–249, Aug. 1985.

    Google Scholar 

  24. G. Neiger and S. Toueg, “Substituting for Real Time and Common Knowledge in Asynchronous Distributed Systems,” Proc. 6th Ann. ACM Symp. on Principles of Distributed Computing, pp. 281–293, 1987.

    Google Scholar 

  25. F. Schneider, “A Paradigm for Reliable Clock Synchronization,” Proc. Advanced Seminar on Real-Time Local Area Networks, Bandol, France, April 1986.

    Google Scholar 

  26. T.K. Srikanth and S. Toueg, “Optimal Clock Synchronization,” J. ACM, vol. 34, no. 3, pp. 626–645, July 1987.

    Article  MathSciNet  Google Scholar 

  27. J. Lundelius Welch, “Simulating Synchronous Processors,” Information and Computation, vol. 74, no. 2, pp. 159–171, Aug. 1987.

    Article  MATH  MathSciNet  Google Scholar 

  28. J. Lundelius Welch and N. Lynch, “A New Fault-Tolerant Algorithm for Clock Synchronization,” Information and Computation, vol. 77, no. 1, pp. 1–36, April 1988.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research Center, Jennifer Lundelius Welch, GTE Laboratories Incorporated, Nancy Lynch, MIT

    Barbara Simons

Authors
  1. Barbara Simons
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Barbara Simons Alfred Spector

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simons, B. (1990). An overview of clock synchronization. In: Simons, B., Spector, A. (eds) Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, vol 448. Springer, New York, NY. https://doi.org/10.1007/BFb0042327

Download citation

  • DOI: https://doi.org/10.1007/BFb0042327

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97385-2

  • Online ISBN: 978-0-387-34812-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation