2003 · 82 citations · 18 references
ComputingComputer EngineeringComputer SystemsDistributed SystemsFault ToleranceFault-tolerant ComputingConcurrency ControlConsensus AlgorithmsConsensus ProtocolsDistributed ConsensusDistributed SynchronizationReliable Distributed SystemsConsensusConsensus Under FaultsCrash Failure ModelsFailure ModelsFailure-time ModelsFault-tolerant CoordinationFault-tolerant Distributed SystemsOmission Faults
This paper considers consensus protocols for synchronous systems where processes can commit crash failures, omission failures or Byzantine failures. It presents and revisits consensus protocols coping with such failures in an increasing order of difficulty. The paper can be seen as a short tutorial whose aim is to make the reader familiar with synchrony assumptions, different definitions of the consensus problem, and a hierarchy of process failure models. An important concern of the paper lies in simplicity. In addition to the survey flavor of the paper, several results that are presented are new, among which the ones concerning the omission failure model.
18
Unreliable failure detectors for reliable distributed systems
Tushar Chandra, Sam Toueg · Journal of the ACM · 1996 · 2.5K citations · Full text
Reaching Agreement in the Presence of Faults
Marshall C. Pease, Robert E. Shostak, Leslie Lamport · Journal of the ACM · 1980 · 2.4K citations · Full text
Consensus in the presence of partial synchrony
Cynthia Dwork, Nancy Lynch, Larry Stockmeyer · Journal of the ACM · 1988 · 1.9K citations · Full text