The weakest failure detector for eventual consistency
From MaRDI portal
Publication:2010607
Recommendations
Cites work
- Atomic broadcast: From simple message diffusion to Byzantine agreement
- Calculs approchés de la borne inférieure de valeurs réparties
- Coordinated consensus in dynamic networks
- Eventually linearizable shared objects
- Eventually-serializable data services
- Every problem has a weakest failure detector
- From binary consensus to multivalued consensus in asynchronous message-passing systems
- Impossibility of distributed consensus with one faulty process
- Lower bounds for asynchronous consensus
- Proving the Correctness of Multiprocess Programs
- The failure detector abstraction
- The weakest failure detector for eventual consistency
- The weakest failure detector for solving consensus
- The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
- Tight failure detection bounds on atomic object implementations
- Unreliable failure detectors for reliable distributed systems
- When consensus meets self-stabilization
Cited in
(8)- Eventually consistent transactions
- X-ability, a theory of replication
- Tolerating permanent and transient value faults
- The weakest failure detector for eventual consistency
- Automatic Classification of Eventual Failure Detectors
- The weakest failure detector for solving consensus
- Eventually linearizable shared objects
- Perfect failure detection with very few bits
This page was built for publication: The weakest failure detector for eventual consistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010607)