Reconfigurable distributed storage for dynamic networks
From MaRDI portal
Publication:897399
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?)
- Fast Paxos
- How fast can a distributed atomic read be?
- How to share memory in a distributed system
- Sharing memory robustly in message-passing systems
- Structural Information and Communication Complexity
Cited in
(18)- Dynamic reconfiguration: a tutorial
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- The case for reconfiguration without consensus: comparing algorithms for atomic storage
- A protocol for implementing Byzantine storage in churn-prone distributed systems
- \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems
- Minimal cost reconfiguration of data placement in a storage area network
- Dynamic atomic storage without consensus
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- Reconfiguring replicated atomic storage: a tutorial
- Asynchronous reconfiguration with Byzantine failures
- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- scientific article; zbMATH DE number 2013830 (Why is no real title available?)
- scientific article; zbMATH DE number 7650881 (Why is no real title available?)
- A dynamic majority determination algorithm for reconfiguration of network partitions
- On liveness of dynamic storage
- Asynchronous reconfiguration with Byzantine failures
- The network as a storage device: dynamic routing with bounded buffers
- scientific article; zbMATH DE number 3934807 (Why is no real title available?)
This page was built for publication: Reconfigurable distributed storage for dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897399)