Wait-Free Clock Synchronization

Algorithmica (New York)

Volumn 18, Issue 4, 1997, Pages 486-511

  Dolev, S ^a   Welch, J L ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

Algorithms; Clock synchronization; Distributed computing; Self stabilization; Wait free

Indexed keywords

EID: 0346969506     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009167     Document Type: Article

References (30)

1. A. Arora, S. Dolev, and M. Gouda, Maintaining Digital Clocks in Step, Parallel Processing Letters, Vol. 1, No. 1, 1991, pp. 11-18.
2. Y. Afek, S. Kutten, and M. Yung, Memory-Efficient Self Stabilization on General Networks, Proceedings of the 4th International Workshop on Distributed Algorithms, Bari, September 1990, LNCS 486, Springer-Verlag, pp. 15-28.
3. H. Attiya, N. A. Lynch, and N. Shavit, Are Wait-Free Algorithms Fast?, Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, October 1990, pp. 55-64.
4. B. Awerbuch and G. Varghese. "Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols," Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, October 1991, pp. 258-267.
5. J. E. Burns and N. A. Lynch, The Byzantine Firing Squad Problem, Advances in Computing Research: Parallel and Distributed Computing, Vol. 4, 1987, pp. 147-161.
6. B. A. Coan, D. Dolev, C. Dwork, and L. Stockmeyer, The Distributed Firing Squad Problem, SIAM Journal on Computing, Vol. 18, No. 5, 1989, pp. 990-1012.
7. E. W. Dijkstra, Self Stabilizing Systems in Spite of Distributed Control, Communication of the Association for Computing Machinery, Vol. 17, 1974, pp. 643-644.
8. D. Dolev, J. Y. Halpern, and H. R. Strong, On the Possibility and Impossibility of Achieving Clock Synchronization, Journal of Computer and System Sciences, Vol. 32, No. 2, 1986, pp. 230-250.
9. S. Dolev, A. Israeli, and S. Moran, Self Stabilization of Dynamic Systems Assuming Only Read/Write Atomicity, Proceedings of the 9th ACM Symposium on Principles of Distributed Computing, August 1990, pp. 103-117.
10. S. Dolev, A. Israeli, and S. Moran, Resource Bounds for Self Stabilizing Message Driven Protocols, Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, August 1991, pp. 281-293.
11. S. Dolev and J. Welch, Wait-Free Clock Synchronization, Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, August 1993, pp. 97-108.
12. M. G. Gouda and T. Herman. Stabilizing Unison, Information Processing Letters, Vol. 35, 1990, pp. 171-175.
13. A. Gopal, and K. J. Perry, Unifying Self-Stabilization and Fault-Tolerance, Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, August 1993, pp. 195-206.
14. K. Hwang, Advanced Computer Architecture, Parallelism, Scalability, Programmability, McGraw-Hill, New York, 1993.
15. J. Halpern, B. Simons, R. Strong, and D. Dolev, Fault-Tolerant Clock Synchronization, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, August 1984, pp. 89-102.
16. Z. M. Kedem, K. V. Palem, M. O. Rabin, and A. Raghunathan, Efficient Program Transformations for Resilient Parallel Computation via Randomization, Proceedings of the 24th ACM Symposium on Theory of Computing, 1992, pp. 306-317.
17. R. Karp and V. Ramachandran. Parallel Algorithms for Shared Memory Machines, Handbook of Theoretical Computer Science, J. van Leeuwen, ed., Elsevier Science, Amsterdam (also MIT Press, Cambridge, MA), 1990, pp. 869-941.
18. P. C. Kanellakis and A. A. Shvartsman, Efficient Parallel Algorithms on Restartable Fail-Stop Processors, Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, 1991, pp. 23-36.
19. L. Lamport, The Mutual Exclusion Problem: Part II - Statement and Solutions, Journal of the Association for Computing Machinery, Vol. 33, 1986, pp. 327-348.
20. L. Lamport, On Interprocess Communication, Distributed Computing, Vol. 1, No. 1, 1986, pp. 86-101.
21. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, Los Altos, CA, 1992.
22. L. Lamport and P. M. Melliar-Smith, "Synchronizing Clocks in the Presence of Faults," Journal of the Association for Computing Machinery, Vol. 32, No. 1, 1985, pp. 1-36.
23. K. Marzullo, Loosely-Coupled Distributed Services: A Distributed Time Service, Ph.D. Thesis, Stanford University, 1983.
24. C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980.
25. E. F. Moore, The Firing Squad Synchronization Problem, Sequential Machines, E. F. Moore, ed., Addison-Wesley, Reading, MA, 1964.
26. S. Mahaney and F. Schneider, Inexact Agreement: Accuracy, Precision and Graceful Degradation, Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, August 1985, pp. 237-249.
27. M. Papatriantafilou and P. Tsigas, Self-Stabilizing Wait-Free Clock Synchronization, Technical Report CS-R9421, Centrum Voor Wiskunde en Informatica, 1994.
28. T. K. Srikanth and S. Toueg, Optimal Clock Synchronization, Journal of the Association for Computing Machinery, Vol. 34, No. 3, 1987, pp. 626-645.
29. J. D. Ullman, Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984.
30. J. L. Welch and N. Lynch, A New Fault-Tolerant Algorithm for Clock Synchronization, Information and Computation, Vol. 77, No. 1, 1988, pp. 1-36.