arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2006.09823cs.DC
收藏

$δ$ -CRDTs中的强最终一致性

Verifying Strong Eventual Consistency in $δ$-CRDTs

Taylor Blau

摘要:

无冗余复制数据类型(CRDT)是一种自然结构,用于在分布式环境中传递关于共享计算的信息,在分布式环境中,协调开销可能是不可容忍的,并且允许个体参与者暂时偏离整体计算。在这种情况下,有两种经典的方法:基于状态和基于操作的CRDT。前者定义了一个交换的、结合的和幂等的连接操作,它们的状态是一个单调的连接半格。基于状态的CRDT可以进一步区分为经典状态CRDT和$δ$状态CRDT。前者在每次更新后传递其完整状态,而后者仅传递更改后的状态。基于操作的CRDT传递操作(而不是状态),因此使它们的更新是非幂等的。而基于操作的CRDT需要很少的信息交换,他们需要相对强大的网络保证(确切的一次消息传递),和基于状态的CRDT遭受相反的问题。它们都满足强最终一致性(SEC)。我们认为,$δ$状态CRDT(1)需要更少的通信开销的有效载荷大小,(2)容忍相对较弱的网络环境,使他们成为一个理想的候选人,为现实世界中使用的CRDT。我们的中心直觉是状态、$δ$状态和基于操作的CRDT之间的一对约简。我们正式这种直觉在伊莎贝尔互动定理证明,并表明,基于状态的CRDTs实现SEC。我们提出了一个轻松的网络模型在伊莎贝尔和基于状态的CRDTs仍然保持SEC。最后,我们扩展我们的工作表明,$δ$状态CRDTs保持SEC时,只有通信$δ$状态片段,即使在相对较弱的网络条件下。

英文摘要:

Conflict-free replicated data types (CRDTs) are a natural structure with which to communicate information about a shared computation in a distributed setting where coordination overhead may not be tolerated, and individual participants are allowed to temporarily diverge from the overall computation. Within this setting, there are two classical approaches: state- and operation-based CRDTs. The former define a commutative, associative, and idempotent join operation, and their states a monotone join semi-lattice. State-based CRDTs may be further distinguished into classical- and $δ$-state CRDTs. The former communicate their full state after each update, whereas the latter communicate only the changed state. Op-based CRDTs communicate operations (not state), thus making their updates non-idempotent. Whereas op-based CRDTs require little information to be exchanged, they demand relatively strong network guarantees (exactly-once message delivery), and state-based CRDTs suffer the opposite problem. Both satisfy strong eventual consistency (SEC). We posit that $δ$-state CRDTs both (1) require less communication overhead from payload size, and (2) tolerate relatively weak network environments, making them an ideal candidate for real-world use of CRDTs. Our central intuition is a pair of reductions between state-, $δ$-state, and op-based CRDTs. We formalize this intuition in the Isabelle interactive theorem prover and show that state-based CRDTs achieve SEC. We present a relaxed network model in Isabelle and show that state-based CRDTs still maintain SEC. Finally, we extend our work to show that $δ$-state CRDTs maintain SEC when only communicating $δ$-state fragments, even under relatively weak network conditions.

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

↑