Scalable consistency in scatter

109Citations
Citations of this article
158Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Distributed storage systems often trade off strong semantics for improved scalability. This paper describes the design, implementation, and evaluation of Scatter, a scalable and consistent distributed key-value storage system. Scatter adopts the highly decentralized and self-organizing structure of scalable peer-to-peer systems, while preserving linearizable consistency even under adverse circumstances. Our prototype implementation demonstrates that even with very short node lifetimes, it is possible to build a scalable and consistent system with practical performance. © 2011 ACM.

Cite

CITATION STYLE

APA

Glendenning, L., Beschastnikh, I., Krishnamurthy, A., & Anderson, T. (2011). Scalable consistency in scatter. In SOSP’11 - Proceedings of the 23rd ACM Symposium on Operating Systems Principles (pp. 15–28). https://doi.org/10.1145/2043556.2043559

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free