ON THE POSSIBILITY AND IMPOSSIBILITY OF ACHIEVING CLOCK SYNCHRONIZATION

被引:58
作者
DOLEV, D [1 ]
HALPERN, JY [1 ]
STRONG, HR [1 ]
机构
[1] IBM CORP,RES LAB,SAN JOSE,CA 95193
关键词
D O I
10.1016/0022-0000(86)90028-0
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:230 / 250
页数:21
相关论文
共 14 条
[1]  
BENOR M, 1983, 2ND P ANN ACM S PRIN, P27
[2]   THE BYZANTINE GENERALS STRIKE AGAIN [J].
DOLEV, D .
JOURNAL OF ALGORITHMS, 1982, 3 (01) :14-30
[3]   AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT [J].
DOLEV, D ;
STRONG, HR .
SIAM JOURNAL ON COMPUTING, 1983, 12 (04) :656-666
[4]  
FISCHER MJ, 1985, 4TH ACM S PRINC DIST, P59
[5]  
HALPERN JY, 1985, 17TH P ANN ACM S THE, P346
[6]  
HALPERN JY, 1984, 3RD P ACM S PRINC DI, P89
[7]   SYNCHRONIZING CLOCKS IN THE PRESENCE OF FAULTS [J].
LAMPORT, L ;
MELLIARSMITH, PM .
JOURNAL OF THE ACM, 1985, 32 (01) :52-78
[8]   THE BYZANTINE GENERALS PROBLEM [J].
LAMPORT, L ;
SHOSTAK, R ;
PEASE, M .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :382-401
[9]  
LAMPORT L, 1984, 3RD P ACM S PRINC DI, P1
[10]   AN UPPER AND LOWER BOUND FOR CLOCK SYNCHRONIZATION [J].
LUNDELIUS, J ;
LYNCH, N .
INFORMATION AND CONTROL, 1984, 62 (2-3) :190-204