Abstract
We design a stabilizing system of simultaneously triggered clocks: if the clock values ever differ, then the system is guaranteed to converge to a state where all clock values are identical, and are subsequently maintained to be identical. Our design of an N-clock system uses N registers of 2 log N bits each and is guaranteed to converge to identical values within N2 “triggers”.
Preview
Unable to display preview. Download preview PDF.
References
J.B. Peatman, Digital Hardware Design, Addison-Wesley (1980).
C. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley (1980).
S. Even and S. Rajsbaum, “Lack of a global clock does not slow down the computation in distributed networks”, TR522, Computer Science Department, Technion (1988); the first part of this paper, “Unison in distributed networks”, appeared in Sequences, Combinatorica, Compression, Security, and Transmission, E.M. Capocelli (ed.), Springer-Verlag.
M.G. Gouda and T. Herman, “Stabilizing unison”, Information Processing Letters, Vol. 35, No. 4, pp. 171–175 (1990).
F. Cristian, “Probabilistic clock synchronization”, Distributed Computing, Vol. 3, pp. 146–158 (1989).
F.B. Schneider, “Understanding protocols for byzantine clock synchronization”, Technical Report TR-87-859, Cornell University, Department of Computer Science, Ithaca, NY 14853 (1987).
A. Arora and M.G. Gouda, “Closure and convergence: A formal basis for fault-tolerance”, Manuscript (1991).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arora, A., Dolev, S., Gouda, M. (1992). Maintaining digital clocks in step. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022438
Download citation
DOI: https://doi.org/10.1007/BFb0022438
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55236-9
Online ISBN: 978-3-540-46789-2
eBook Packages: Springer Book Archive