Fast Paxos
From MaRDI portal
Publication:1954195
DOI10.1007/s00446-006-0005-xzbMath1266.68218OpenAlexW3100217861MaRDI QIDQ1954195
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-0005-x
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items (23)
Consensus in Data Management: From Distributed Commit to Blockchain ⋮ The Heard-Of model: computing in distributed systems with benign faults ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ On the bit security of cryptographic primitives ⋮ piChain: When a Blockchain meets Paxos ⋮ Automated test case generation for the paxos single-decree protocol using a coloured Petri net model ⋮ Reconfigurable distributed storage for dynamic networks ⋮ \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems ⋮ Lower bounds for asynchronous consensus ⋮ How to Solve Consensus in the Smallest Window of Synchrony ⋮ Bosco: One-Step Byzantine Asynchronous Consensus ⋮ Using Bounded Model Checking to Verify Consensus Algorithms ⋮ Verification of consensus algorithms using satisfiability solving ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ Random walks and concurrent zero-knowledge ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ On the coordinator's rule for Fast Paxos ⋮ Generating fast indulgent algorithms ⋮ Unnamed Item ⋮ On the correctness of Egalitarian Paxos ⋮ Byzantizing Paxos by Refinement ⋮ Recent Results on Fault-Tolerant Consensus in Message-Passing Networks ⋮ Protocol combinators for modeling, testing, and execution of distributed systems
Uses Software
Cites Work
This page was built for publication: Fast Paxos
