Active disk Paxos with infinitely many processes

DOI10.1007/s00446-005-0123-xzbMath1264.68074OpenAlexW2673139396MaRDI QIDQ1953639

Gregory Chockler, Dahlia Malkhi

Publication date: 7 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-005-0123-x

zbMATH Keywords

shared memoryconsensusinfinitely many processesPaxosnon-responsive object faults

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Wait-free regular storage from Byzantine components
• Bounds on shared memory for mutual exclusion
• Revisiting the PAXOS algorithm
• The concurrency hierarchy, and algorithms for unbounded concurrency
• Fault-tolerant wait-free shared objects
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• The Byzantine Generals Problem
• Time, clocks, and the ordering of events in a distributed system
• Computing with faulty shared objects
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Active disk paxos with infinitely many processes
• Randomized wait-free concurrent objects (extended abstract)

This page was built for publication: Active disk Paxos with infinitely many processes