Distributed consensus revisited

DOI10.1016/0020-0190(94)90011-6MaRDI QIDQ1318741zbMATH OpenOpenAlexFDO

Authors Gil Neiger

Publication date 5 April 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(94)90011-6

zbMATH Keywords

distributed computingsynchronous systemsdistributed consensusbyzantine agreementarbitrary failures

Mathematics Subject Classification ID

Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Fast and simple distributed consensus
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Distributed consensus, revisited
• Fast Distributed Agreement

Cites work

• scientific article; zbMATH DE number 3819094 (Why is no real title available?)
• An efficient algorithm for byzantine agreement without authentication
• Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• The Byzantine Generals Problem

Cited in

(12)

• Protocols forcing consensus
• Distributed Computing - IWDC 2004
• Hundreds of impossibility results for distributed computing
• Optimistically tuning synchronous Byzantine consensus: another win for null messages
• Recent results on fault-tolerant consensus in message-passing networks
• Consensus-Halving: Does It Ever Get Easier?
• Paxos consensus, deconstructed and abstracted
• The deformed consensus protocol
• scientific article; zbMATH DE number 1756101 (Why is no real title available?)
• Consensus Propagation
• scientific article; zbMATH DE number 2112158 (Why is no real title available?)
• Robust Distributed Consensus Using Total Variation

This page was built for publication: Distributed consensus revisited

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