\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
From MaRDI portal
Publication:660994
Recommendations
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 2013830 (Why is no real title available?)
- scientific article; zbMATH DE number 1559572 (Why is no real title available?)
- Dynamic atomic storage without consensus
- Dynamic voting for consistent primary components
- Fast Paxos
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
- How to assign votes in a distributed system
- How to share memory in a distributed system
- Impossibility of distributed consensus with one faulty process
- Long-lived RAMBO: trading knowledge for communication
- Probabilistic quorums for dynamic systems
- Reconfigurable distributed storage for dynamic networks
- Revisiting the PAXOS algorithm
- Scalable and dynamic quorum systems
- Sharing memory robustly in message-passing systems
- The Load, Capacity, and Availability of Quorum Systems
- The availability of quorum systems
- The theory of timed I/O automata
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for reliable distributed systems
Cited in
(14)- Dynamic regular registers in systems with churn
- Asynchronous reconfiguration with Byzantine failures
- Reconfigurable distributed storage for dynamic networks
- scientific article; zbMATH DE number 2013830 (Why is no real title available?)
- Long-lived RAMBO: trading knowledge for communication
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- Practically-self-stabilizing virtual synchrony
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- On the Validity of Consensus
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Asynchronous reconfiguration with Byzantine failures
- A coded shared atomic memory algorithm for message passing architectures
This page was built for publication: \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q660994)