48 citations · 102 across the 19 of their papers we have counts for
3 papers · 2 filters
Space Bounds for Reliable Multi-Writer Data Store: Inherent Cost of Read/Write Primitives
Gregory Chockler, Dan Dobre, Alexander Shraer +1
Reliable storage emulations from fault-prone components have established themselves as an algorithmic foundation of modern storage services and applications. Most existing reliable…
On Liveness of Dynamic Storage
Alexander Spiegelman, Idit Keidar
Dynamic distributed storage algorithms such as DynaStore, Reconfigurable Paxos, RAMBO, and RDS, do not ensure liveness (wait-freedom) in asynchronous runs with infinitely many reco…
Space Bounds for Reliable Storage: Fundamental Limits of Coding
Alexander Spiegelman, Yuval Cassuto, Gregory Chockler +1
We study the inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-k…