THE CONSENSUS PROBLEM IN FAULT-TOLERANT COMPUTING

被引：197
|
作者：
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
相关论文
共 50 条
  • [41] FAULT-TOLERANT CONSENSUS WITH NOMA IN MOBILE NETWORKS
    Zou, Yifei
    Xu, Minghui
    Yu, Jiguo
    Zhao, Feng
    Cheng, Xiuzhen
    IEEE WIRELESS COMMUNICATIONS, 2022, 29 (03) : 80 - 86
  • [42] Byzantine Fault-Tolerant Consensus Algorithms: A Survey
    Zhong, Weiyu
    Yang, Ce
    Liang, Wei
    Cai, Jiahong
    Chen, Lin
    Liao, Jing
    Xiong, Naixue
    ELECTRONICS, 2023, 12 (18)
  • [43] Exact Fault-Tolerant Consensus with Voting Validity
    Xu, Zhangchen
    Li, Yuetai
    Feng, Chenglin
    Zhang, Lei
    2023 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, IPDPS, 2023, : 842 - 852
  • [44] Improved Communication Complexity of Fault-Tolerant Consensus
    Hajiaghayi, Mohammad T.
    Kowalski, Dariusz R.
    Olkowski, Jan
    PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 488 - 501
  • [45] Improved communication complexity of fault-tolerant consensus
    Hajiaghayi, Mohammad T.
    Kowalski, Dariusz R.
    Olkowski, Jan
    Proceedings of the Annual ACM Symposium on Theory of Computing, 2022, : 488 - 501
  • [46] The fault-tolerant Early Bird Problem
    Fay, B
    Kutrib, M
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2004, E87D (03): : 687 - 693
  • [47] The Fault-Tolerant Facility Allocation Problem
    Xu, Shihong
    Shen, Hong
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 689 - 698
  • [48] Fault-Tolerant Dynamic Deduplication for Utility Computing
    Leesakul, Waraporn
    Townend, Paul
    Garraghan, Peter
    Xu, Jie
    2014 IEEE 17TH INTERNATIONAL SYMPOSIUM ON OBJECT/COMPONENT/SERVICE-ORIENTED REAL-TIME DISTRIBUTED COMPUTING (ISORC), 2014, : 397 - 404
  • [49] A control microarchitecture for fault-tolerant quantum computing
    Fu, X.
    Lao, L.
    Bertels, K.
    Almudever, C. G.
    MICROPROCESSORS AND MICROSYSTEMS, 2019, 70 : 21 - 30
  • [50] SPECIAL ISSUE ON FAULT-TOLERANT COMPUTING - FOREWORD
    MASSON, GM
    IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (04) : 385 - 386
12345