Active disk Paxos with infinitely many processes
From MaRDI portal
Recommendations
- Active disk Paxos with infinitely many processes
- scientific article; zbMATH DE number 1696684
- Disk paxos
- scientific article; zbMATH DE number 1696673
- Byzantine disk paxos: optimal resilience with Byzantine shared memory
- Byzantine disk paxos
- Computing with infinitely many processes
- Processes with infinite liveness requirements
- Resilient consensus for infinitely many processes. (Extended abstract)
Cites work
- scientific article; zbMATH DE number 1696673 (Why is no real title available?)
- scientific article; zbMATH DE number 1696684 (Why is no real title available?)
- Active disk Paxos with infinitely many processes
- Bounds on shared memory for mutual exclusion
- Computing with faulty shared objects
- Fault-tolerant wait-free shared objects
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Randomized wait-free concurrent objects (extended abstract)
- Revisiting the PAXOS algorithm
- The Byzantine Generals Problem
- The concurrency hierarchy, and algorithms for unbounded concurrency
- The weakest failure detector for solving consensus
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for reliable distributed systems
- Wait-free regular storage from Byzantine components
Cited in
(3)
This page was built for publication: Active disk Paxos with infinitely many processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1953639)
