A Framework for the Analysis of Non-Deterministic Clock Synchronisation Algorithms

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.

[1]  Hagit Attiya,et al.  Optimal Clock Synchronization under Different Delay Assumptions , 1996, SIAM J. Comput..

[2]  Fred B. Schneider,et al.  Understanding Protocols for Byzantine Clock Synchronization , 1987 .

[3]  Kang G. Shin,et al.  Fault-tolerant clock synchronization for distributed systems using continuous synchronization messages , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[4]  Kang G. Shin,et al.  Probabilistic clock synchronization in large distributed systems , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.

[5]  K. Arvind,et al.  Probabilistic Clock Synchronization in Distributed Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[6]  Nancy A. Lynch,et al.  An Upper and Lower Bound for Clock Synchronization , 1984, Inf. Control..

[7]  Hagit Attiya,et al.  Optimal clock synchronization under different delay assumptions , 1993, PODC '93.

[8]  Flaviu Cristian,et al.  Probabilistic internal clock synchronization , 1994, Proceedings of IEEE 13th Symposium on Reliable Distributed Systems.

[9]  Satish K. Tripathi,et al.  Efficient synchronization of clocks in a distributed system , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.