×

Optimal clock synchronization under different delay assumptions (preliminary version). (English) Zbl 1373.68071

Proceedings of the 12th annual ACM symposium on principles of distributed computing, PODC ’93, Ithaca, NY, USA, August 15–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-613-1). 109-120 (1993).
For the entire collection see [Zbl 1365.68006].

MSC:

68M14 Distributed systems
68M12 Network protocols
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q25 Analysis of algorithms and problem complexity
68R10 Graph theory (including graph drawing) in computer science
68W15 Distributed algorithms
Full Text: DOI

References:

[1] F. Cristian, “ProbaBilistic Clock Synchronization,” Diz . Comp., 3 (1989), pp. 146-158. · Zbl 0703.68018
[2] D. Dolev, J. Halpern and H. R. Strong, “On the possibility and impossibility of achieving clock synchronization.” Y. Comp. and Sys. Sci., 32:2 (1986) pp. 230-250. 10.1016/0022-0000(86)90028-0 · Zbl 0595.68029
[3] J. Halpern, N. Megiddo and A. A. Munshi, “Optimal precision in the presence of uncertainty.” J. Complexity, I (1985), pp. 170-196. · Zbl 0598.68033
[4] J. Halpern and I. Suzuki, “Clock Synchronization and the Power of Broadcasting.” Proc. Allerton Conference, 1990, pp. 588-597.
[5] R. M. Karp, “A characterization of the minimum cycle mean in a digraph,” Disc. Math., 23 (1978), pp. 309-311. · Zbl 0386.05032
[6] H. Kopetz and W. Ochsenreiter, “Clock Synchronization in Distributed Real-Time Systems,” IEEE Trans. Comp., 36:8 (August 1987), pp. 933-939. 10.1109/TC.1987.5009516 · Zbl 0618.68021
[7] L. Lamport, “Time, clocks and the ordering of events in distributed systems.” CACM, 21:7 (July 1978), pp. 558-565. 10.1145/359545.359563 · Zbl 0378.68027
[8] L. Lamport and P. Melliar-Smith, “Synchronizing clocks in the presence of faults,” JACM, 32:1 (January 1985), pp. 52-78. 10.1145/2455.2457 · Zbl 0629.68025
[9] B. Liskov, “Practical Uses of Synchronized Clocks in Distributed Systems,” invited talk at the 9th A CM Syrnp. on Principles of Distributed Computing, 1990, appeared in Proc. l Oth A C’M \(yrnp. on Principles of Distributed Computing, 1991, pp. 1-9. 10.1145/112600.11260\) · Zbl 1314.68382
[10] J. Lundelius and N. Lynch, “An Upper and Lower Bound for Clock Synchronization,” In/o. and Control, 62:2/3 (August/September 1984), pp. 190-204. · Zbl 0591.68023
[11] K. Marzullo, Loosely-Coupled Distributed Services: A Distributed Time Service, Ph.D. thesis, Stanford University, 1983.
[12] D. Mills, “Network Time Protocol (Version 2) Specification and Implementation,” IEEE Trans. Comm., Vol. 39, No. 10 (October 1991), pp. 1482-1493.
[13] Open Software Foundation, Introduction to OSF DCE, OSF, Cambridge, Massechusetts, December 1991.
[14] K. Sugihara and I. Suzuki, “Nearly Optimal Clock Synchronization Under Unbounded Message Transmission Time,” Proc. 1988 International Conference on Parallel Processing IIi, 1988, pp. 14-17.
[15] B. Simons, J. L. Welch and N. Lynch, “An overview of clock synchronization,” IBM Technical Report RJ 6505, October 1988.
[16] T. Srikanth and S. Toueg, “Optimal Clock Synchronization,” JACM, 34:3 (July 1987), pp. 626-645. 10.1145/28869.28876
[17] J. L. Welch and N. Lynch, “A new fault-tolerant algorithm for clock synchronization,” Info. and Comp., 77:1 (April 1988), pp. 1-36. 10.1016/0890-5401(88)90043-0 · Zbl 0646.68029
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.