Joseph Y. Halpern
ABSTRACT
This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. The algorithms tolerate both link and node failures of any type. The algorithm for maintaining synchronization will work for arbitrary networks (rather than just completely connected networks) and tolerates any number of processor or communication link faults as long as the correct processors remain connected by fault-free paths. It thus represents an improvement over other clock synchronization algorithms such as [LM1,LM2,LL1]. Our algorithm for allowing new processors to join requires that more than half the processors be correct, a requirement which is provably necessary.
- 1.D. Dolev, J. Y. Halpern, B. B. Simons, and H. R. Strong, A new look at fault tolerant network routing, Proceedings of the Sixteenth Annual ACM STOC, 1984, pp. 526-535; also IBM RJ4239, 1984. Google Scholar
Digital Library
- 2.D. Dolev, J. Y. Halpern, and H. R. Strong, On the possibility and impossibility of achieving clock synchronization, Proceedings of the Sixteenth Annual ACM STOC, 1984, pp. 504-511; also IBM RJ4218, 1984. Google ScholarDigital Library
- 3.D.Dolev and H. R. Strong, Authenticated algorithms for Byzantine agreement, SIAM J. of Computing, 12:4, 1983, pp. 656-666.Google ScholarDigital Library
- 4.J.Y. Halpern, B. B. Simons, and H. R. Strong, An efficient fault-tolerant algorithm for clock synchronization, IBM RJ4094, 1983.Google Scholar
- 5.L. Lamport and P. M. Melliar-Smith, Synchronizing clocks in the presence of faults, SRI International Report, 1982.Google Scholar
- 6.L. Lamport and P. M. Melliar-Smith, Byzantine clock synchronization, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, 1983. Google ScholarDigital Library
- 7.J. Lundelius and N. Lynch, A new fault-tolerant algorithm for clock synchronization, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, 1983. Google ScholarDigital Library
- 8.J. Lundelius and N. Lynch, An upper lower bound for clock synchronization, unpublished manuscript, 1984.Google Scholar
- 9.K. Marzullo, Loosely-coupled distributed services: a distributed time system, Ph.D. dissertation, Stanford University, 1983.Google Scholar
- 10.R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 21:2, 1978, pp. 120-126. Google ScholarDigital Library
Index Terms
- Fault-tolerant clock synchronization
Recommendations
A new fault-tolerant algorithm for clock synchronization
PODC '84: Proceedings of the third annual ACM symposium on Principles of distributed computingWe describe a new fault-tolerant algorithm for solving a variant of Lamport's clock synchronization problem. The algorithm is designed for a system of distributed processes that communicate by sending messages. Each process has its own read-only ...
Dynamic fault-tolerant clock synchronization
This paper gives two simple efficient distributed algorithms: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized. Assuming a fault-tolerant authentication protocol, the ...
Fault-tolerant external clock synchronization
ICDCS '95: Proceedings of the 15th International Conference on Distributed Computing SystemsAbstract: We address the problem of how to integrate fault-tolerant internal and external clock synchronization. We propose a new algorithm which provides both external and internal clock synchronization for as long as no more than F reference time ...
Comments