On the possibility and impossibility of achieving clock synchronization

作者: Danny Dolev , Joe Halpern , H. Raymond Strong

DOI: 10.1145/800057.808720

关键词:

摘要: It is known that clock synchronization can be achieved in the presence of faulty clocks numbering more than one-third total number participating provided some authentication technique used. Without faults tolerated has been an open question. Here we show if restrict logical to running within linear function real time, then impossible, without authentication, when or processors are faulty. However, there a bound on rate at which processor generate messages, achievable, as long do not disconnect network. Finally, provide lower closeness simultaneity network transmission and processing delay properties

参考文章(7)
William E. Weihl, Danny Dolev, Shlomit S. Pinter, Nancy A. Lynch, Eugene W. Stark, Reaching Approximate Agreement in the Presence of Faults. Symposium on Reliability in Distributed Software and Database Systems. pp. 145- 154 ,(1983)
Jennifer L Welch, J. Lundelius, SYNCHRONIZING CLOCKS IN A DISTRIBUTED SYSTEM Massachusetts Institute of Technology. ,(1984)
Danny Dolev, The Byzantine Generals strike again Journal of Algorithms. ,vol. 3, pp. 14- 30 ,(1981) , 10.1016/0196-6774(82)90004-9
D. Dolev, H. R. Strong, Authenticated Algorithms for Byzantine Agreement SIAM Journal on Computing. ,vol. 12, pp. 656- 666 ,(1983) , 10.1137/0212045
Leslie Lamport, P. M. Melliar-Smith, Synchronizing clocks in the presence of faults Journal of the ACM. ,vol. 32, pp. 52- 78 ,(1985) , 10.1145/2455.2457
M. Pease, R. Shostak, L. Lamport, Reaching Agreement in the Presence of Faults Journal of the ACM. ,vol. 27, pp. 228- 234 ,(1980) , 10.1145/322186.322188
Leslie Lamport, Robert Shostak, Marshall Pease, The Byzantine Generals Problem ACM Transactions on Programming Languages and Systems. ,vol. 4, pp. 382- 401 ,(1982) , 10.1145/357172.357176