A High Throughput Atomic Storage Algorithm


This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations, and even if there is contention, our algorithm has a high write throughput and a read throughput that grows linearly with the number of available servers. The algorithm is… (More)
DOI: 10.1109/ICDCS.2007.80


4 Figures and Tables

Cite this paper

@article{Guerraoui2007AHT, title={A High Throughput Atomic Storage Algorithm}, author={Rachid Guerraoui and Dejan Kostic and Ron R. Levy and Vivien Qu{\'e}ma}, journal={27th International Conference on Distributed Computing Systems (ICDCS '07)}, year={2007}, pages={19-19} }