Brief announcement: atomic consistency and partition tolerance in scalable key-value stores

Authors:
Cosmin Arad;Tallat M. Shafaat;Seif Haridi
Affiliations:
KTH Royal Institute of Technology, Sweden;KTH Royal Institute of Technology, Sweden;KTH Royal Institute of Technology, Sweden
Venue:
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Year:
2012

Sharing memory robustly in message-passing systems

Journal of the ACM (JACM)
Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
Reconfigurable distributed storage for dynamic networks

Journal of Parallel and Distributed Computing
Dynamic atomic storage without consensus

Proceedings of the 28th ACM symposium on Principles of distributed computing
Dealing with Bootstrapping, Maintenance, and Network Partitions and Mergers in Structured Overlay Networks

SASO '12 Proceedings of the 2012 IEEE Sixth International Conference on Self-Adaptive and Self-Organizing Systems

Hi-index	0.00

We propose consistent quorums to achieve linearizability in scalable and self-organizing key-value stores based on consistent hashing.