Efficient State-Based CRDTs by Delta-Mutation

Almeida, Paulo Sérgio; Shoker, Ali; Baquero, Carlos

doi:10.1007/978-3-319-26850-7_5

Cited by 38 publications

(41 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There is room to optimize SwiftCloud for more e cient processing of batched updates. Also, semantic compression of batched updates, as suggested by in [1], would also improve the system.…”

Section: Discussionmentioning

confidence: 98%

Dynamic adaptation of geo-replicated CRDTs

Bartolomeu

Bravo

Rodrigues

2016

Proceedings of the 31st Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Conflict-free Replicated Data Types (CRDTs) are high-level data types that can be replicated with minimal coordination among replicas due to its confluent semantics. This property makes CRDTs specially appealing for geo-replicated settings. Di↵erent approaches, such as state transfer and operation forwarding, have been proposed to propagate updates among replicas, with di↵erent tradeo↵s among the amount of network tra c generated and the staleness of local information. This paper proposes and evaluates techniques to automatically adapt a CRDT implementation, such that the best approach is used, based on the application needs (captured by a SLA) and the observed system configuration. Our techniques have been integrated in SwiftCloud, a state of the art geo-replicated store based on CRDTs.

show abstract

“…There is room to optimize SwiftCloud for more e cient processing of batched updates. Also, semantic compression of batched updates, as suggested by in [1], would also improve the system.…”

Section: Discussionmentioning

confidence: 98%

Dynamic adaptation of geo-replicated CRDTs

Bartolomeu

Bravo

Rodrigues

2016

Proceedings of the 31st Annual ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…2 {ok, S1} = lasp:declare(riak_dt_orset), 3 4 %% Add elements to initial set S1 and update. 5 {ok, _} = lasp:update(S1, {add_all, [1,2,3]}, a), 6 7 %% Create second set S2. 8 {ok, S2} = lasp:declare(riak_dt_orset), 9 10 %% Apply map operation between S1 and S2.…”

Section: Variablesmentioning

confidence: 99%

“…A replicated triple (S, M, Q) where S is a bounded join-semilattice representing the state of each replica, M is a set of functions for mutating the state, and Q is a set of functions for querying the state, is one type of state-based CRDT. [5] Functions for querying and mutating the CRDT can always be performed as they are executed on the replica's local state and the entire state is propagated to other replicas in the replica set. When a replica receives a state from another replica, the received state is merged into the local state using the join operation.…”

Section: Observed-remove Set Crdtmentioning

confidence: 99%

See 1 more Smart Citation

Lasp

Meiklejohn¹,

Roy

2015

Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We propose Lasp, a new programming model designed to simplify large-scale distributed programming. Lasp combines ideas from deterministic dataflow programming together with conflictfree replicated data types (CRDTs). This provides support for computations where not all participants are online together at a given moment. The initial design presented here provides powerful primitives for composing CRDTs, which lets us write long-lived faulttolerant distributed applications with nonmonotonic behavior in a monotonic framework. Given reasonable models of node-to-node communications and node failures, we prove formally that a Lasp program can be considered as a functional program that supports functional reasoning and programming techniques. We have implemented Lasp as an Erlang library built on top of the Riak Core distributed systems framework. We have developed one nontrivial large-scale application, the advertisement counter scenario from the SyncFree research project. We plan to extend our current prototype into a general-purpose language in which synchronization is used as little as possible.

show abstract

“…CRDTs [13], [14] address this issue by defining delta-mutators that return a delta (δ), typically much smaller than the full state of the replica, to be merged with the local state. The same δ is also added to an outbound δ-buffer, to be periodically propagated to remote replicas.…”

Section: Introductionmentioning

confidence: 99%

Efficient Synchronization of State-Based CRDTs

Enes

Almeida

Baquero

et al. 2019

2019 IEEE 35th International Conference on Data Engineering (ICDE)

Self Cite

View full text Add to dashboard Cite

To ensure high availability in large scale distributed systems, Conflict-free Replicated Data Types (CRDTs) relax consistency by allowing immediate query and update operations at the local replica, with no need for remote synchronization. State-based CRDTs synchronize replicas by periodically sending their full state to other replicas, which can become extremely costly as the CRDT state grows. Delta-based CRDTs address this problem by producing small incremental states (deltas) to be used in synchronization instead of the full state. However, current synchronization algorithms for delta-based CRDTs induce redundant wasteful delta propagation, performing worse than expected, and surprisingly, no better than state-based. In this paper we: 1) identify two sources of inefficiency in current synchronization algorithms for delta-based CRDTs; 2) bring the concept of join decomposition to state-based CRDTs; 3) exploit join decompositions to obtain optimal deltas and 4) improve the efficiency of synchronization algorithms; and finally, 5) experimentally evaluate the improved algorithms.

show abstract

Efficient State-Based CRDTs by Delta-Mutation

Cited by 38 publications

References 21 publications

Dynamic adaptation of geo-replicated CRDTs

Dynamic adaptation of geo-replicated CRDTs

Lasp

Efficient Synchronization of State-Based CRDTs

Contact Info

Product

Resources

About