Consistency Analysis of Replication-Based Probabilistic Key-Value Stores
Consistency Analysis of Replication-Based Probabilistic Key-Value Stores
Partial quorum systems are widely used in distributed key-value stores due to their latency benefits at the expense of providing weaker consistency guarantees. The probabilistically bounded staleness framework (PBS) studied the latency-consistency trade-off of Dynamo-style partial quorum systems through Monte Carlo event-based simulations. In this paper, we study the latency-consistency …