Lower bounds for asynchronous consensus

DOI10.1007/s00446-006-0155-xzbMath1266.68119OpenAlexW2002195182MaRDI QIDQ1954196

Leslie Lamport

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0155-x

zbMATH Keywords

fault tolerancedistributed algorithmsconsensuspaxos

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Related Items (5)

Consensus on demand ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ Randomization can be a healer: consensus with dynamic omission failures ⋮ On the coordinator's rule for Fast Paxos ⋮ The weakest failure detector for eventual consistency

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Revisiting the PAXOS algorithm
• Fast Paxos
• Impossibility of distributed consensus with one faulty process
• Time, clocks, and the ordering of events in a distributed system
• Uniform consensus is harder than consensus
• How to Write a Proof

This page was built for publication: Lower bounds for asynchronous consensus