PaRiS:具有非阻塞读取和部分复制的因果一致事务
PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
摘要:
地理复制数据平台是若干大规模在线服务的骨干。事务因果一致性(transmittance Causal Consistency,TCC)是构建此类平台的一个有吸引力的一致性级别。TCC避免了最终一致性的许多异常,避免了强一致性的同步成本,并支持交互式读写事务。部分复制是构建地理复制平台的另一个有吸引力的设计选择,因为它增加了存储容量并降低了更新传播成本。本文介绍了PaRiS,第一TCC系统,支持部分复制,实现非阻塞并行读操作,其延迟是至关重要的性能读取密集型应用程序。PaRiS依赖于一种新的协议来跟踪依赖关系,称为通用稳定时间(UST)。通过一个轻量级的后台gossip进程,UST识别系统中每个DC安装的数据快照。因此,事务可以一致地从任何复制站点中的任何服务器上的这样的快照读取,而不必阻塞。此外,PaRiS只需要一个时间戳来跟踪依赖关系和定义事务快照,从而实现资源效率和可扩展性。我们在由多达10个复制站点组成的大规模AWS部署上评估PaRiS。我们表明,PaRiS的规模以及DC和分区的数量,同时能够处理更大的数据集比现有的解决方案,假设完全复制。我们还展示了非阻塞读取与阻塞替代方案相比的性能提升(对于以读取为主的工作负载,吞吐量提高高达1.47倍,延迟降低5.91倍;对于写入繁重的工作负载,吞吐量提高高达1.46倍,延迟降低20.56倍)。
英文摘要:
Geo-replicated data platforms are at the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the synchronization costs of strong consistency, and supports interactive read-write transactions. Partial replication is another attractive design choice for building geo-replicated platforms, as it increases the storage capacity and reduces update propagation costs. This paper presents PaRiS, the first TCC system that supports partial replication and implements non-blocking parallel read operations, whose latency is paramount for the performance of read-intensive applications. PaRiS relies on a novel protocol to track dependencies, called Universal Stable Time (UST). By means of a lightweight background gossip process, UST identifies a snapshot of the data that has been installed by every DC in the system. Hence, transactions can consistently read from such a snapshot on any server in any replication site without having to block. Moreover, PaRiS requires only one timestamp to track dependencies and define transactional snapshots, thereby achieving resource efficiency and scalability. We evaluate PaRiS on a large-scale AWS deployment composed of up to 10 replication sites. We show that PaRiS scales well with the number of DCs and partitions, while being able to handle larger data-sets than existing solutions that assume full replication. We also demonstrate a performance gain of non-blocking reads vs. a blocking alternative (up to 1.47x higher throughput with 5.91x lower latency for read-dominated workloads and up to 1.46x higher throughput with 20.56x lower latency for write-heavy workloads).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。