
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
A. Olson, K.G. Shin, "FaultTolerant Clock Synchronization in Large Multicomputer Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 9, pp. 912923, September, 1994.  
BibTex  x  
@article{ 10.1109/71.308530, author = {A. Olson and K.G. Shin}, title = {FaultTolerant Clock Synchronization in Large Multicomputer Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {9}, issn = {10459219}, year = {1994}, pages = {912923}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.308530}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  FaultTolerant Clock Synchronization in Large Multicomputer Systems IS  9 SN  10459219 SP912 EP923 EPD  912923 A1  A. Olson, A1  K.G. Shin, PY  1994 KW  Index Termsmultiprocessing systems; synchronisation; clocks; fault tolerant computing; reliability; faulttolerant clock synchronization; large multicomputer systems; clock value; maximum skew; maximum time; fault tolerance; synchronization algorithm; clock drift; clock skew VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The cost of synchronizing a multicomputer increases with system size. For largemulticomputers, the time and resources spent to enable each node to estimate the clockvalue of every other node in the system can be prohibitive. We show how to reduce thecost of synchronization by assigning each node to one or more groups, then having eachnode estimate the clock values of only those nodes with which it shares a group. Sinceeach node estimates the clock value of only a subset of the nodes, the cost ofsynchronization can be significantly reduced. We also provide a method for computing the maximum skew between any two nodes in the multicomputer, and a method for computing the maximum time between synchronizations. We also show how the fault tolerance of the synchronization algorithm may be determined.
[1] K. Arvind, "A new probabilistic algorithm for clock synchronization," inProc. RealTime Syst. Symp., Santa Monica, CA, 1989, pp. 330339.
[2] R. E. Beehler and D. W. Allan, "Recent trends in NBS time and frequency distribution services,"Proc. IEEE, vol. 74, no. 1, pp. 155157, Jan. 1986.
[3] F. Cristian, "Probabilistic clock synchronization,"Distrib. Computing, vol. 3, pp. 146158, 1989.
[4] A. Goldberg and R. Tarjan, "A new approach to the maximum flow problem," inProc. 18th ACM Symp. Theory Comput., 1986, pp. 136146.
[5] J.Y. Halpern et al., "FaultTolerant Clock Synchronization,"Proc. Third Ann. ACM Symp. Principles of Distributed Computing, ACM, New York, 1984, pp. 89102.
[6] J. L. W. Kessels, "Two designs of a faulttolerant clocking system,"IEEE Trans. Comput.vol. C33, no. 10, pp. 912919, Oct. 1984.
[7] C.M. Krishna, K.G. Shin, and R.W. Butler, "Ensuring Fault Tolerance of PhaseLocked Clocks,"IEEE Trans. Computers, Vol. C 34, No. 8, Aug. 1985, pp. 752756.
[8] L. Lamport and P.M. MelliarSmith, "Synchronizing Clocks in the Presence of Faults,"J. ACM, Vol. 32, No. 1, Jan. 1985, pp. 5278.
[9] J. LundeliusWelch and N. Lynch, "A New FaultTolerant Algorithm for Clock Synchronization,"Information and Computation, Vol. 77, No. 1, 1988, pp. 136.
[10] A. Olson and K. G. Shin, "Probabilistic clock synchronization in large distributed systems," inProc. 11th Int. Conf. Distrib. Computing Syst., 1991, pp. 290297.
[11] P. Ramanathan, D. D. Kandlur, and K. G. Shin, "Hardwareassisted software clock synchronization for homogeneous distributed systems,"IEEE Trans. Comput., vol. 39, pp. 514524, Apr. 1990.
[12] S. Rangarajan and S. K. Tripathi, "Efficient synchronization of clocks in a distributed system," inProc. RealTime Syst. Symp., 1991, pp. 2231.
[13] K.G. Shin and P. Ramanathan, "Clock Synchronization of a Large Multiprocessor System in the Presence of Malicious Faults,"IEEE Trans. Computers, Vol. C36, No. 1, Jan. 1987, pp. 212.
[14] T.K. Srikanth and S. Toueg, "Optimal Clock Synchronization,"J. ACM, Vol. 34, No. 3, July 1987, pp. 626645.
[15] N. Vasanthavada and P. N. Marinos, "Synchronization of faulttolerant clocks in the presence of malicious failures,"IEEE Trans. Comput., vol. 37, pp. 440448, Apr. 1988.
[16] G. M. R. Winkler, "Changes at USNO in global timekeeping,"Proc. IEEE, vol. 74, no. 1, pp. 151155, Jan. 1986.