This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fault-Tolerant Clock Synchronization in Distributed Systems
October 1990 (vol. 23 no. 10)
pp. 33-42

Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as well as probabilistic synchronization; hardware synchronization algorithms; and hybrid synchronization. The worst-case clock skews guaranteed by representative algorithms are compared, along with other important aspects such as time, message, and cost overhead imposed by the algorithms. More recent developments such as hardware-assisted software synchronization and algorithms for synchronizing large, partially connected distributed systems are especially emphasized.

Citation:
Parameswaran Ramanathan, Kang G. Shin, Ricky W. Butler, "Fault-Tolerant Clock Synchronization in Distributed Systems," Computer, vol. 23, no. 10, pp. 33-42, Oct. 1990, doi:10.1109/2.58235
Usage of this product signifies your acceptance of the Terms of Use.