返回
Limitations of Highly-Available Eventually-Consistent Data Stores
DOI:10.1109/TPDS.2016.2556669.png)
摘要
En 中文
Modern replicated data stores aim to provide high availability, by immediately responding to client requests, often by implementing objects that expose concurrency. Such objects, for example, multi-valued registers (MVRs), do not have sequential specifications. This paper explores a recent model for replicated data stores that can be used to precisely specify causal consistency for such objects, and liveness properties like eventual consistency, without revealing details of the underlying implementation. The model is used to prove the following results: 1) An eventually consistent data store implementing MVRs cannot satisfy a consistency model strictly stronger than observable causal consistency (OCC). OCC is a model somewhat stronger than causal consistency, which captures executions in which client observations can use causality to infer concurrency of operations. This result holds under certain assumptions about the data store. 2) Under the same assumptions, an eventually consistent and causally consistent replicated data store must send messages of size linear in the size of the system: If s objects, each Omega(lg k)-bit in size, are supported by n replicas, then there is an execution in which an Omega(min{n, s}lg k)-bit message is sent.
Keyword:
Replicated data store
causal consistency
eventual consistency
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
New techniques for imaging, digitization and analysis of three-dimensional neural morphology on multiple scales
Neuroscience
IF0
RRmix: A method for simultaneous batch effect correction and analysis of metabolomics data in the absence of internal standards
PLOS ONE
IF0

