\textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
DOI10.1007/S00446-010-0117-1zbMATH Open1231.68077OpenAlexW2170034951MaRDI QIDQ660994FDOQ660994
Authors: Nancy Lynch, Alexander A. Schwarzmann, Seth Gilbert 
Publication date: 6 February 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-010-0117-1
Recommendations
fault-tolerancereconfigurableatomic registerdynamic distributed systemsdistributed shared memoryeventual synchrony
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Unreliable failure detectors for reliable distributed systems
- Title not available (Why is that?)
- The availability of quorum systems
- How to assign votes in a distributed system
- Time, clocks, and the ordering of events in a distributed system
- Impossibility of distributed consensus with one faulty process
- The Load, Capacity, and Availability of Quorum Systems
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Sharing memory robustly in message-passing systems
- Dynamic atomic storage without consensus
- Reconfigurable distributed storage for dynamic networks
- Revisiting the PAXOS algorithm
- Probabilistic quorums for dynamic systems
- Fast Paxos
- How to share memory in a distributed system
- Title not available (Why is that?)
- Scalable and dynamic quorum systems
- Long-lived RAMBO: trading knowledge for communication
- The theory of timed I/O automata
- How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
- Dynamic voting for consistent primary components
Cited In (12)
- Dynamic regular registers in systems with churn
- Asynchronous reconfiguration with Byzantine failures
- Title not available (Why is that?)
- Long-lived RAMBO: trading knowledge for communication
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Practically-self-stabilizing virtual synchrony
- 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
- Title not available (Why is that?)
- 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)
