|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|4951513||1364360||2018||12 صفحه PDF||ندارد||دانلود کنید|
â¢Definition of delta-state CRDTs and their relation to state CRDTs.â¢Proofs of conditions to attain equivalence to state based CRDTs.â¢Anti-entropy algorithm for basic and causally consistent convergence.â¢Portfolio of delta state CRDTs including optimized sets, and recursive map.
Conflict-free Replicated Data Types (CRDTs) are distributed data types that make eventual consistency of a distributed object possible and non ad-hoc. Specifically, state-based CRDTs ensure convergence through disseminating the entire state, that may be large, and merging it to other replicas. We introduce Delta State Conflict-Free Replicated Data Types (Î´-CRDT) that can achieve the best of both operation-based and state-based CRDTs: small messages with an incremental nature, as in operation-based CRDTs, disseminated over unreliable communication channels, as in traditional state-based CRDTs. This is achieved by defining Î´-mutators to return a delta-state, typically with a much smaller size than the full state, that to be joined with both local and remote states. We introduce the Î´-CRDT framework, and we explain it through establishing a correspondence to current state-based CRDTs. In addition, we present an anti-entropy algorithm for eventual convergence, and another one that ensures causal consistency. Finally, we introduce several Î´-CRDT specifications of both well-known replicated datatypes and novel datatypes, including a generic map composition.
Journal: Journal of Parallel and Distributed Computing - Volume 111, January 2018, Pages 162-173