CONSENSUS IN THE PRESENCE OF PARTIAL SYNCHRONY

被引:950
作者
DWORK, C [1 ]
LYNCH, N [1 ]
STOCKMEYER, L [1 ]
机构
[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
关键词
COMPUTER SYSTEMS; DIGITAL; -; Distributed; COMPUTERS; DIGITAL - Data Communication Systems - DATABASE SYSTEMS - Distributed;
D O I
10.1145/42282.42283
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound DELTA on the time required for a message to be sent from one processor to another and a known fixed upper bound PHI on the relative speeds of different processors. In an asynchronous system no fixed upper bounds DELTA and PHI exist. In one version of partial synchrony, fixed bounds DELTA and PHI exist, but they are not known a priori. The problem is to design protocols that work correctly in the partially synchronous system regardless of the actual values of the bounds DELTA and PHI . In another version of partial synchrony, the bounds are known, but are only guaranteed to hold starting at some unknown time T, and protocols must be designed to work correctly regardless of when time T occurs. Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models.
引用
收藏
页码:288 / 323
页数:36
相关论文
共 20 条
  • [1] ATTIYA A, 1984, 3RD P ACM S PRINC DI, P119
  • [2] ASYNCHRONOUS CONSENSUS AND BROADCAST PROTOCOLS
    BRACHA, G
    TOUEG, S
    [J]. JOURNAL OF THE ACM, 1985, 32 (04) : 824 - 840
  • [3] REACHING APPROXIMATE AGREEMENT IN THE PRESENCE OF FAULTS
    DOLEV, D
    LYNCH, NA
    PINTER, SS
    STARK, EW
    WEIHL, WE
    [J]. JOURNAL OF THE ACM, 1986, 33 (03) : 499 - 516
  • [4] ON THE MINIMAL SYNCHRONISM NEEDED FOR DISTRIBUTED CONSENSUS
    DOLEV, D
    DWORK, C
    STOCKMEYER, L
    [J]. JOURNAL OF THE ACM, 1987, 34 (01) : 77 - 97
  • [5] AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT
    DOLEV, D
    STRONG, HR
    [J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (04) : 656 - 666
  • [6] AN EFFICIENT ALGORITHM FOR BYZANTINE AGREEMENT WITHOUT AUTHENTICATION
    DOLEV, D
    FISCHER, MJ
    FOWLER, R
    LYNCH, NA
    STRONG, HR
    [J]. INFORMATION AND CONTROL, 1982, 52 (03): : 257 - 274
  • [7] DWORK C, 1986, 1986 P C THEOR ASP R, P149
  • [8] IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS
    FISCHER, MJ
    LYNCH, NA
    PATERSON, MS
    [J]. JOURNAL OF THE ACM, 1985, 32 (02) : 374 - 382
  • [9] FISCHER MJ, 1983, YALEUDSCRR273 YAL U
  • [10] FISCHER MJ, 1982, 62 SRI INT TECH REP