Abstract
In recent years, non-deterministic clock synchronisation algorithms (NDCSA) have appeared as an attractive alternative to deterministic ones. NDCSA offer a precision that can be made as small as desired. The price to pay is a probability of success that is less than one. We propose an uniform analysis of NDCSA. Our approach strives at decomposing and identifying the factors that affect the performance of these algorithms. Our aim is to determine simple local conditions that guarantee that the desired precision will be attained with the desired probability.
The results are then used to estimate the communication burden imposed by the synchronisation algorithm and provide us with some guidelines to compare the different NDCSA.
Pedro Fonseca was partially supported by Portuguese Government grant PRAXIS XXI BD-3729-94
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Arvind. Probabilistic clock synchronization in distributed systems. IEEE Trans. Parallel and Distributed Systems, 5(5):474–487, May 1994.
Hagit Attiya, Amir Herzberg, and Sergio Rajsbaum. Optimal clock synchronization under different delay assumptions. SIAM J. Comput., 25(2):369–389, April 1996.
F. Cristian. Probabilistic clock synchronization. Distributed Computing, 3:146–158, 1989.
Flaviu Cristian and Christof Fetzer. Probabilistic internal clock synchronization. In Proc. 13th Symposium on Reliable Distributed Systems, pages 22–31. IEEE, 1994.
Hermann Kopetz and Wolfgang Schwabl. Global time in distributed real-time systems. Technical Report 15/89, Technische Universitat Wien, October 1989.
G. Le-Lann. Synchronisation statistique d'horloges physiques: étude algorithmique. Document HORA, INRIA, September 1990.
Jennifer Lundelius and Nancy Lynch. An upper and lower bound for clock synchronization. Information and Control, 62:190–204, 1984.
A. Olson and K. G. Shin. Probabilistic clock synchronization in large distributed systems. In Proc. Distributed Computing Systems, pages 290–297, May 1991.
Alan Olson, Kang G. Shin, and Bruno J. Jambor. Fault-tolerant clock synchronization for distributed systems using continuous synchronization messages. In Proc. 25th International Symposium on Fault Tolerant Computing, pages 154–163, Pasadena, California, June 1995. IEEE.
S. Rangarajan and S. K. Tripathi. Efficient synchronization of clocks in a distributed system. In Proceedings of Real-Time Systems Symposium, pages 22–31, 1991.
Fred B. Schneider. Understanding protocols for Byzantine clock synchronization. Technical Report 87-859, Department of Computer Science, Cornell University, Ithaca, New York, August 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fonseca, P., Mammeri, Z. (1996). A framework for the analysis of non-deterministic clock synchronisation algorithms. In: Babaoğlu, Ö., Marzullo, K. (eds) Distributed Algorithms. WDAG 1996. Lecture Notes in Computer Science, vol 1151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61769-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-61769-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61769-3
Online ISBN: 978-3-540-70679-3
eBook Packages: Springer Book Archive