Fast and simple distributed consensus

DOI10.1007/BF02280828MaRDI QIDQ5136978zbMATH OpenOpenAlexFDO

Authors James E. Burns, Gil Neiger

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02280828

zbMATH Keywords

Byzantine agreementdistributed consensusdistributed systemsearly stoppingfault-tolerance

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Fast Distributed Agreement
• Impossibility of distributed consensus with one faulty process
• scientific article; zbMATH DE number 6297761
• scientific article; zbMATH DE number 2080904
• A simple and fast asynchronous consensus protocol based on a weak failure detector

Cites work

• A lower bound for the time to assure interactive consistency
• Bounds on information exchange for Byzantine agreement
• Consensus algorithms with one-bit messages
• Early stopping in Byzantine agreement
• Efficient agreement using fault diagnosis.
• The Byzantine Generals Problem

Cited in

(32)

• Easy impossibility proofs for distributed consensus problems
• Stopping times of distributed consensus protocols: a probabilistic analysis
• Consensus under unreliable transmission
• Distributed consensus revisited
• Crash-tolerant consensus in directed graph revisited (extended abstract)
• Distributed probabilistic polling and applications to proportionate agreement
• A distributed critical section protocol for general topology
• Fast Paxos
• A simple Byzantine generals protocol
• Recent results on fault-tolerant consensus in message-passing networks
• Efficient player-optimal protocols for strong and differential consensus
• Asynchronous Fault-Tolerant Total Ordering Algorithms
• Optimal agreement in a scale-free network environment
• Fast randomized consensus using shared memory
• Distributed agreement in the presence of processor and communication faults
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• scientific article; zbMATH DE number 4058843 (Why is no real title available?)
• Fast Distributed Agreement
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• scientific article; zbMATH DE number 1950669 (Why is no real title available?)
• scientific article; zbMATH DE number 1950670 (Why is no real title available?)
• scientific article; zbMATH DE number 1830912 (Why is no real title available?)
• Fault-tolerant consensus with an abstract MAC layer
• A self-stabilizing quorum-based protocol for maxima computing
• The Impact of RDMA on Agreement
• Fast scalable deterministic consensus for crash failures
• Brief announcement: Hierarchical consensus
• Fast plurality consensus in regular expanders
• Brief announcement: Reaching approximate consensus when everyone may crash
• An efficient fault-tolerant decentralized commit protocol for single site failure
• On the coordinator's rule for Fast Paxos

This page was built for publication: Fast and simple distributed consensus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136978)