Consensus in one communication step

DOI10.1007/3-540-44743-1_4MaRDI QIDQ4778617zbMATH OpenFDO

Authors Francisco Brasileiro, Fabíola Greve, Achour Mostefaoui, Michel Raynal

Publication date 18 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2127/21270042

zbMATH Keywords

asynchronous distributed systemconsensuscrash failuremessage passing

Mathematics Subject Classification ID

Distributed systems (68M14) Computing methodologies and applications (68U99)

Recommendations

• Fast and simple distributed consensus
• One-Step Consensus Solvability
• Necessary and sufficient conditions for broadcast consensus protocols.
• Consensus algorithms with one-bit messages
• Impossibility of distributed consensus with one faulty process

Cited in

(15)

• Consensus under unreliable transmission
• Necessary and sufficient conditions for broadcast consensus protocols.
• \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms
• A simple proof of a simple consensus algorithm
• Fast Paxos
• Lower bounds for asynchronous consensus
• Unbeatable consensus
• The Heard-Of model: computing in distributed systems with benign faults
• Agreeing within a few writes
• What you always wanted to know about model checking of fault-tolerant distributed algorithms
• One-Step Consensus Solvability
• Bosco: One-Step Byzantine Asynchronous Consensus
• Cloture votes: n/4-resilient distributed consensus in t+1 rounds
• Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
• Parameterized complexity of safety of threshold automata

This page was built for publication: Consensus in one communication step

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