Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Information and Computation
Design and evaluation of a conit-based continuous consistency model for replicated services
ACM Transactions on Computer Systems (TOCS)
Session Guarantees for Weakly Consistent Replicated Data
PDIS '94 Proceedings of the Third International Conference on Parallel and Distributed Information Systems
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Resilient Logical Structures for Efficient Management of Replicated Data
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Trading Replication Consistency for Performance and Availability: an Adaptive Approach
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Communications of the ACM - Rural engineering development
Toward a cloud computing research agenda
ACM SIGACT News
Tolerating latency in replicated state machines through client speculation
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
ZooKeeper: wait-free coordination for internet-scale systems
USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference
Analyzing consistency properties for fun and profit
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Transactional storage for geo-replicated systems
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Don't settle for eventual: scalable causal consistency for wide-area storage with COPS
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
PIQL: success-tolerant query processing in the cloud
Proceedings of the VLDB Endowment
Eventual consistency: How soon is eventual? An evaluation of Amazon S3's consistency behavior
Proceedings of the 6th Workshop on Middleware for Service Oriented Computing
Byzantine and multi-writer k-quorums
DISC'06 Proceedings of the 20th international conference on Distributed Computing
On the availability of non-strict quorum systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
An adaptive quality of service aware middleware for replicated services
IEEE Transactions on Parallel and Distributed Systems
Toward a principled framework for benchmarking consistency
HotDep'12 Proceedings of the Eighth USENIX conference on Hot Topics in System Dependability
Does better throughput require worse latency?
Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability
Eventual consistency today: limitations, extensions, and beyond
Communications of the ACM
Eventual Consistency Today: Limitations, Extensions, and Beyond
Queue - Storage
PBS at work: advancing data management with consistency metrics
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Rethinking eventual consistency
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
DAX: a widely distributed multitenant storage service for DBMS hosting
Proceedings of the VLDB Endowment
Replicated data consistency explained through baseball
Communications of the ACM
Archiving the relaxed consistency web
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Client-centric benchmarking of eventual consistency for cloud storage systems
Proceedings of the 4th annual Symposium on Cloud Computing
Eventually consistent: not what you were expecting?
Communications of the ACM
Eventually Consistent: Not What You Were Expecting?
Queue - Performance
Warranties for faster strong consistency
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
Hi-index | 0.05 |
Data store replication results in a fundamental trade-off between operation latency and data consistency. In this paper, we examine this trade-off in the context of quorum-replicated data stores. Under partial, or non-strict quorum replication, a data store waits for responses from a subset of replicas before answering a query, without guaranteeing that read and write replica sets intersect. As deployed in practice, these configurations provide only basic eventual consistency guarantees, with no limit to the recency of data returned. However, anecdotally, partial quorums are often "good enough" for practitioners given their latency benefits. In this work, we explain why partial quorums are regularly acceptable in practice, analyzing both the staleness of data they return and the latency benefits they offer. We introduce Probabilistically Bounded Staleness (PBS) consistency, which provides expected bounds on staleness with respect to both versions and wall clock time. We derive a closed-form solution for versioned staleness as well as model real-time staleness for representative Dynamo-style systems under internet-scale production workloads. Using PBS, we measure the latency-consistency trade-off for partial quorum systems. We quantitatively demonstrate how eventually consistent systems frequently return consistent data within tens of milliseconds while offering significant latency benefits.