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 trade-off for such systems analytically and derive a closed-form expression for the inconsistency probability. Our approach allows fine-tuning of latency and consistency guarantees in key-value stores, which is intractable using Monte Carlo event-based simulations.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Non-linear Multi-objective Optimization with Probabilistic Branch and Bound
A multiple objective simulation optimization algorithm named Multiple Objective Probabilistic Branch and Bound with Single Observation (MOPBnB(so)) is presented for approximating the Pareto optimal set and the associated…
Estimating Reproducibility in Genome-Wide Association Studies
Genome-wide association studies (GWAS) are widely used to discover genetic variants associated with diseases. To control false positives, all findings from GWAS need to be verified with additional evidences, even for ass…
Using statistical techniques and replication samples for imputation of metabolite missing values
Background: Data preparation, such as missing values imputation and transformation, is the first step in any data analysis and requires crucial attention. Particularly, analysis of metabolites demands more preparation si…
ImputationMissing ValuesSuper-replication in Fully Incomplete Markets
In this work we introduce the notion of fully incomplete markets. We prove that for these markets the super-replication price coincide with the model free super-replication price. Namely, the knowledge of the model does …
DisCEdge: Distributed Context Management for Large Language Models at the Edge
Deploying Large Language Model (LLM) services at the edge benefits latency-sensitive and privacy-aware applications. However, the stateless nature of LLMs makes managing user context (e.g., sessions, preferences) across …