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

来源：

COMPUTING SURVEYS | 1993年 / 25卷 / 02期

关键词：

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 条

[1] ADAMS JC, 1989, 9TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, P562, DOI 10.1109/ICDCS.1989.37989
[2] AGRAWAL P, 1985, AUG P INT C PAR PROC, P814
[3] Ammann E., 1981, SELF DIAGNOSIS FAULT, P1
[4] ATTIYA C, 1984, 3RD P ANN ACM S PRIN, P119
[5] ON THE RELIABILITY OF CONSENSUS-BASED FAULT-TOLERANT DISTRIBUTED COMPUTING SYSTEMS
BABAOGLU, O
[J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1987, 5 (04): : 394 - 416
[6] STREETS OF BYZANTIUM - NETWORK ARCHITECTURES FOR FAST RELIABLE BROADCASTS
BABAOGLU, O
DRUMMOND, R
[J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1985, 11 (06) : 546 - 554
[7] STOPPING-TIMES OF DISTRIBUTED CONSENSUS PROTOCOLS - A PROBABILISTIC ANALYSIS
BABAOGLU, O
[J]. INFORMATION PROCESSING LETTERS, 1987, 25 (03) : 163 - 169
[8] BAGCHI A, 1991, 21 INT S FAULT TOL C, P214
[9] BAGCHI AA, 1992, JUL P IEEE WORKSH FA, P106
[10] BARBORAK M, 1993, 26TH P HAW INT C SYS, P438

← 1 2 3 4 5 6 7 8 9 10 →