|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| A. Olson, K.G. Shin, "Probabilistic Clock Synchronization in Large Distributed Systems," IEEE Transactions on Computers, vol. 43, no. 9, pp. 1106-1112, September, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/12.312120, author = {A. Olson and K.G. Shin}, title = {Probabilistic Clock Synchronization in Large Distributed Systems}, journal ={IEEE Transactions on Computers}, volume = {43}, number = {9}, issn = {0018-9340}, year = {1994}, pages = {1106-1112}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.312120}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Probabilistic Clock Synchronization in Large Distributed Systems IS - 9 SN - 0018-9340 SP1106 EP1112 EPD - 1106-1112 A1 - A. Olson, A1 - K.G. Shin, PY - 1994 KW - synchronisation; fault tolerant computing; reliability; distributed processing; probabilistic clock synchronization; large distributed systems; tightness; master/slave organization; interactive convergence algorithm. VL - 43 JA - IEEE Transactions on Computers ER - | |||
Clock synchronization within a distributed system is a problem that has been studied extensively in recent years. Of the many solutions proposed thus far, probabilistic synchronization algorithms provide arguably the best compromise between tightness of synchronization and overhead imposed on the system. The main drawbacks of probabilistic algorithms are the requirement of a master/slave organization of clocks, and the relatively high number of synchronization messages that must be sent. These two drawbacks can make them unsuitable for use in large distributed systems. In this paper, we propose a synchronization algorithm that does not use master/slave clocks and reduces the number of synchronization messages needed. The nodes of the system are divided into a number of overlapping groups. Within a group, each node uses one of two probabilistic techniques to estimate the values of other clocks in the group, and uses an interactive convergence algorithm on the resulting estimates to adjust its local clock. Groups are selected so that the maximum skew between any two group members is bounded.
[1] C.M. Krishna, K.G. Shin, and R.W. Butler, "Ensuring Fault Tolerance of Phase-Locked Clocks,"IEEE Trans. Computers, Vol. C- 34, No. 8, Aug. 1985, pp. 752-756.
[2] K.G. Shin and P. Ramanathan, "Clock Synchronization of a Large Multiprocessor System in the Presence of Malicious Faults,"IEEE Trans. Computers, Vol. C-36, No. 1, Jan. 1987, pp. 2-12.
[3] N. Vasanthavada and P. N. Marinos, "Synchronization of fault-tolerant clocks in the presence of malicious failures,"IEEE Trans. Comput., vol. 37, no. 4, pp. 440-448, Apr. 1988.
[4] L. Lamport and P.M. Melliar-Smith, "Synchronizing Clocks in the Presence of Faults,"J. ACM, Vol. 32, No. 1, Jan. 1985, pp. 52-78.
[5] J. Lundelius-Welch and N. Lynch, "A New Fault-Tolerant Algorithm for Clock Synchronization,"Information and Computation, Vol. 77, No. 1, 1988, pp. 1-36.
[6] T.K. Srikanth and S. Toueg, "Optimal Clock Synchronization,"J. ACM, Vol. 34, No. 3, July 1987, pp. 626-645.
[7] K. Arvind, "A new probabilistic algorithm for clock synchronization," inProc. Real-Time Syst. Symp., Santa Monica, CA, 1989, pp. 330-339.
[8] F. Cristian, "Probabilistic clock synchronization,"Dist. Comput., vol. 3, pp. 146-158, 1989.