Revisiting the PAXOS algorithm

DOI10.1016/S0304-3975(00)00042-6zbMath0944.68102OpenAlexW2136259232MaRDI QIDQ1575634

R. D. Prisco, Nancy A. Lynch, B. W. Lampson

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00042-6

zbMATH Keywords

formal verificationfault-tolerancedistributed consensusI/O automata modelspartially synchronous systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

On implementing omega in systems with weak reliability and synchrony assumptions ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ Stability of long-lived consensus. ⋮ \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems ⋮ Active disk Paxos with infinitely many processes ⋮ Fast Paxos ⋮ Lower bounds for asynchronous consensus ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ Distributed consensus, revisited ⋮ Packet efficient implementation of the Omega failure detector ⋮ Revisiting the PAXOS algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Increasing the resilience of distributed and replicated database systems
• Revisiting the PAXOS algorithm
• Action transducers and timed automata
• Forward and backward simulations. II: Timing-based systems
• A theory of clock synchronization (extended abstract)
• Fail-awareness in timed asynchronous systems
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Reaching Agreement in the Presence of Faults
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Specifying and using a partitionable group communication service

This page was built for publication: Revisiting the PAXOS algorithm