Efficient replication of large data objects
From MaRDI portal
Recommendations
- An algorithm for replicated objects with efficient reads (extended abstract)
- Optimistic replication for Internet data services
- An algorithm for dynamic data allocation in distributed systems
- Accessing nearby copies of replicated objects in a distributed environment
- Eventually-serializable data services
Cited in
(11)- Accessing nearby copies of replicated objects in a distributed environment
- Fragmented objects: boosting concurrency of shared large objects
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- Optimistic replication for Internet data services
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- An Algorithm For Concurrency Control In Replicated File Systems
- Efficient synchronization of replicated data in distributed systems
- A coded shared atomic memory algorithm for message passing architectures
- An algorithm for replicated objects with efficient reads (extended abstract)
- Building a large location table to find replicas of physics objects
This page was built for publication: Efficient replication of large data objects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897401)