Fast access to distributed atomic memory
From MaRDI portal
Recommendations
Cited in
(18)- GeoQuorums: implementing atomic memory in mobile ad hoc networks
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Fast non-blocking atomic commit: an inherent trade-off
- Tractable low-delay atomic memory
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks
- The complexity of robust atomic storage
- Dynamic atomic storage without consensus
- Computationally light ``multi-speed atomic memory
- Efficient and modular consensus-free reconfiguration for fault-tolerant storage
- On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
- Computing k-atomicity in polynomial time
- scientific article; zbMATH DE number 1931815 (Why is no real title available?)
- Dynamic atomic storage without consensus
- A coded shared atomic memory algorithm for message passing architectures
- Brief announcement: Oh-RAM! One and a half round read/write atomic memory
- Making ``fast atomic operations computationally tractable
- A practical distributed universal construction with unknown participants
- How fast can a distributed atomic read be?
This page was built for publication: Fast access to distributed atomic memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390614)