Distributed Computing

, Volume 3, Issue 3, pp 146–158 | Cite as

Probabilistic clock synchronization

  • Flaviu Cristian


A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays. The method can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms. Its use is illustrated by presenting a time service which maintains externally (and hence, internally) synchronized clocks in the presence of process, communication and clock failures.

Key words

Communication Distributed system Fault-tolerance Time service Clock synchronization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Cristian F (1988) Reaching agreement on processor group membership in synchronous distributed systems. 18th Int Conf on Fault-Tolerant Computing, Tokyo, Japan, (June 1988)Google Scholar
  2. Cristian F, Aghili H, Strong R (1986) Approximate clock synchronization despite omission and performance failures and processor joins. 16th Int Symp on Fault Tolerant Computing, Vienna, Austria (June 1986)Google Scholar
  3. Cristian F, Aghili H, Strong R, Dolev D (1985) Atomic braodcast: from simple message diffusion to Byzantine agreement. 15th. Int Symp on Fault-Tolerant Computing, Ann Arbor, Michigan (June 1985)Google Scholar
  4. Dolev D, Halpern J, Simons B, Strong R (1984) Fault-tolerant clock synchronization. Proc 3rd ACM Symp on Principles of Distributed ComputingGoogle Scholar
  5. Gusella R, Zatti S (1987) The accuracy of the clock synchronization achieved by tempo in Berkeley Unix 4.3BSD. Rep UCB/CSD 87/337Google Scholar
  6. Kinemetrics/Truetime (1986) Time and Frequency Receivers, Santa Rosa, CaliforniaGoogle Scholar
  7. Kopetz H, Ochsenreiter W (1987) Clock synchronization in distributed real-time systems. IEEE Trans Comput 36:933–940Google Scholar
  8. Lamport L, (1987) Synchronizing time servers, TR 18. DEC Systems Research Center, Palo Alto, California (June 1987)Google Scholar
  9. Lundelius J, Lynch N (1984) An upper and lower bound for clock synchronization. Inf Control 62:190–204Google Scholar
  10. Lamport L, Melliar-Smith M (1985) Synchronizing clocks in the presence of faults. J Assoc Comput Mach 32:52–78Google Scholar
  11. Lundelius-Welch J, Lynch N (1988) A new fault-tolerant algorithm for clock synchronization. Inf Comput 77:1–36Google Scholar
  12. Marzullo K (1984) Maintaining the time in a distributed system. Xerox Rep OSD-T 8401 (March 1984)Google Scholar
  13. Schneider F (1987) Understanding protocols for Byzantine clock synchronization. TR 87-859, Cornell University (August 1987)Google Scholar
  14. Srikanth TK, Toueg S (1987) Optimal clock synchronization. JACM 34:626–645Google Scholar

Copyright information

© Springer-Verlag 1989

Authors and Affiliations

  • Flaviu Cristian
    • 1
  1. 1.IBM Almaden Research CenterSan JoseUSA

Personalised recommendations