Impossibility of distributed consensus with one faulty process-Reference-Cited by-同舟云学术

Impossibility of distributed consensus with one faulty process

Published:1985-04 Issue:2 Volume:32 Page:374-382
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Fischer Michael J.¹,Lynch Nancy A.²,Paterson Michael S.³

Affiliation:

1. Department of Computer Science, Yale University, P.O. Box 2158, Yale Station, New Haven, CT

2. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA

3. Department of Computer Science, University of Warwick, Coventry CV4 7AL, England

Abstract

The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the “Byzantine Generals” problem.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3149.214121

Reference24 articles.

Cited by 2454 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. MBFT: A Modular Byzantine Fault Tolerance Protocol for high adaptability;Expert Systems with Applications;2024-12

2. Detecting causality in the presence of Byzantine processes: The case of synchronous systems;Information and Computation;2024-12

3. TADA: A Toolkit for Approximate Distributed Agreement;Science of Computer Programming;2024-12

4. BRAPTOR: An efficient method for instant asset-transfer and generic application in blockchain;Computers and Electrical Engineering;2024-12

5. Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs;Theoretical Computer Science;2024-11