arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.04237cs.DCcs.DB
收藏

因果一致性和延迟最优性:是敌是友?

Causal Consistency and Latency Optimality: Friend or Foe?

Diego Didona, Rachid Guerraoui, Jingjing Wang, Willy Zwaenepoel

摘要:

因果一致性是一种有吸引力的复制数据存储的一致性模型。它可以证明是容忍分区的最强模型,它避免了与强一致性相关的长延迟,特别是在使用只读事务时,它防止了弱一致性模型的许多异常。最近的工作表明,因果一致性允许“延迟最优”只读事务,即非阻塞,单版本和单轮通信。从表面上看,这种延迟最优性非常有吸引力,因为绝大多数应用程序都被假定具有以读取为主的工作负载。在本文中,我们表明,这种“延迟最优”的只读事务引起额外的开销写,额外的开销是如此之高,性能实际上是受到危害,即使在读为主的工作负载。我们从实践和理论的角度证明了这一结果。首先,我们提出了一个协议,实现“几乎延迟最优”ROT,但不强加在写任何延迟最优协议的开销。在这个协议中,ROT是非阻塞的,一个版本,可以配置为使用两轮或一轮半的客户端-服务器通信。我们的实验表明,该协议不仅提供了更好的吞吐量,正如预期的那样,但也令人惊讶的是更好的延迟所有,但最低的负载和最读取繁重的工作负载。然后,我们证明了延迟最优只读事务对写入施加的额外开销是固有的,即,它不是我们所考虑的设计的产物,并且不能通过延迟最优只读事务的任何实现来避免。我们特别表明,这种开销与客户端的数量呈线性增长。

英文摘要:

Causal consistency is an attractive consistency model for replicated data stores. It is provably the strongest model that tolerates partitions, it avoids the long latencies associated with strong consistency, and, especially when using read-only transactions, it prevents many of the anomalies of weaker consistency models. Recent work has shown that causal consistency allows "latency-optimal" read-only transactions, that are nonblocking, single-version and single-round in terms of communication. On the surface, this latency optimality is very appealing, as the vast majority of applications are assumed to have read-dominated workloads. In this paper, we show that such "latency-optimal" read-only transactions induce an extra overhead on writes, the extra overhead is so high that performance is actually jeopardized, even in read-dominated workloads. We show this result from a practical and a theoretical angle. First, we present a protocol that implements "almost laten- cy-optimal" ROTs but does not impose on the writes any of the overhead of latency-optimal protocols. In this protocol, ROTs are nonblocking, one version and can be configured to use either two or one and a half rounds of client-server communication. We experimentally show that this protocol not only provides better throughput, as expected, but also surprisingly better latencies for all but the lowest loads and most read-heavy workloads. Then, we prove that the extra overhead imposed on writes by latency-optimal read-only transactions is inherent, i.e., it is not an artifact of the design we consider, and cannot be avoided by any implementation of latency-optimal read-only transactions. We show in particular that this overhead grows linearly with the number of clients.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑