THE CONSENSUS PROBLEM IN FAULT-TOLERANT COMPUTING

被引:196
作者
BARBORAK, M [1 ]
MALEK, M [1 ]
DAHBURA, A [1 ]
机构
[1] MOTOROLA INC, CAMBRIDGE RES CTR, CAMBRIDGE, MA 02139 USA
关键词
ALGORITHMS; DESIGN; RELIABILITY; BYZANTINE AGREEMENT; CONSENSUS PROBLEM; DECISION THEORY; PROCESSOR MEMBERSHIP; SYSTEM DIAGNOSIS;
D O I
10.1145/152610.152612
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The consensus problem is concerned with the agreement on a system status by the fault-free segment of a processor population in spite of the possible inadvertent or even malicious spread of disinformation by the faulty segment of that population. The resulting protocols are useful throughout fault-tolerant parallel and distributed systems and will impact the design of decision systems to come. This paper surveys research on the consensus problem, compares approaches, outlines applications, and suggests directions for future work.
引用
收藏
页码:171 / 220
页数:50
相关论文
共 182 条
  • [21] BIANCHINI R, 1991, 21 ANN INT S 25 27 J, P222
  • [22] RELIABLE COMMUNICATION IN THE PRESENCE OF FAILURES
    BIRMAN, KP
    JOSEPH, TA
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1987, 5 (01): : 47 - 76
  • [23] BIRMAN KP, 1985, 10TH P S OP SYST PRI, P79
  • [24] ON A LOGICAL PROBLEM
    BLECHER, PM
    [J]. DISCRETE MATHEMATICS, 1983, 43 (01) : 107 - 110
  • [25] BLOUGH D, 1992, IN PRESS IEEE T COMP
  • [26] BLOUGH D, 1989, 19TH INT IEEE S FAUL, P62
  • [27] Blough D. M., 1988, Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers. FTCS-18 (Cat. No.88CH2543-7), P260, DOI 10.1109/FTCS.1988.5329
  • [28] COMPLEXITY OF FAULT-DIAGNOSIS IN COMPARISON MODELS
    BLOUGH, DM
    PELC, A
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1992, 41 (03) : 318 - 324
  • [29] BLOUGH DM, 1990, 20TH P IEEE COMP SOC, P316
  • [30] BLOUNT M, 1978, 8TH INT IEEE S FAULT, P53