Abstract
We consider wait-free clock synchronization protocols on an in-phase shared-memory multi-processor system. A wait-free clock synchronization protocol guarantees that, for a fixed k, local clocks of processors which have been working consecutively for at least k pulses are synchronized. Such k is called synchronization time. The best previous result with regard to the synchronization time is O(n 2), where n is the number of processors. In this paper, we present a wait-free synchronization protocol with synchronization time O(n), and also show that this synchronization time is asymptotically optimal.
Research supported in part by the Scientific Research Grant-in-Aid from Ministry of Education, Science and Culture of Japan, and the Telecommunications Advancement Foundation's Research Grant.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Lamport and P. Melliar-Smith: “Synchronizing clocks in the presence of faults”, Journal of the ACM, 32, 1, pp. 1–36 (1985).
S. Dolev, J. Halpern and H. Strong: “On the possibility and impossibility of achieving clock synchronization”, Journal of Computer Systems Science, 32, 2, pp. 230–250 (1986).
S. Mahaney and F. Schneider: “Inexact agreement: Accuracy, precision and graceful degradation”, Proceedings of the 4th ACM Symposium on Principles of Distributed Computing, pp. 237–249 (1985).
T. Srikanth and S. Toueg: “Optimal clock synchronization”, Journal of the ACM, 34, 3, pp. 626–645 (1987).
J. Welch and N. Lynch: “A new fault-tolerant algorithm for clock synchronization”, Information and Computation, 77, 1, pp. 1–36 (1988).
J. Halpern, B. Simons, R. Strong and D. Dolev: “Fault-tolerant clock synchronization”, Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pp. 89–102 (1984).
S. Dolev and J.L.Welch: “Self-stabilizing clock synchronization in the presence of byzantine faults”, Proceedings of the Second Workshop on Self-Stabilizing Systems, pp. 9.1–9.12 (1995).
M. Gouda and T. Herman: “Stabilizing unison”, Information Processing Letters, 35, pp. 171–175 (1990).
A. Arora, S. Dolev and M. Gouda: “Maintaining digital clocks in step”, Parallel Processing Letters, 1, 1, pp. 11–8 (1991).
A. S. Gopal and K. J. Perry: “Unifying self-stabilization and fault-tolerance”, Proceeding of the 12th ACM Symposium on Principles on Distributed Computing, pp. 195–206 (1993).
S. Dolev: “Possible and impossible self-stabilizing digital clock synchronization in general graphs”, Technical Report TR 96-06, Department of Mathematics and Computer Science. Ben-Gurion University (1996).
S. Dolev and J. Welch: “Wait-free clock synchronization”, Proceedings of the 12th ACM Symposium on Principles of Distributed Computing, pp. 97–108 (1993).
M. Papatriantafilou and P. Tsigas: “On self-stabilizing wait-free clock synchronization”, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (LNCS 824), pp. 267–277 (1994).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inoue, M., Moriya, S., Masuzawa, T., Fujiwara, H. (1997). Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system. In: Mavronicolas, M., Tsigas, P. (eds) Distributed Algorithms. WDAG 1997. Lecture Notes in Computer Science, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030691
Download citation
DOI: https://doi.org/10.1007/BFb0030691
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63575-8
Online ISBN: 978-3-540-69600-1
eBook Packages: Springer Book Archive