Conflict-Free Replicated Data Types CRDTs

Preguiça, Nuno; Baquero, Carlos; Shapiro, Marc

doi:10.1007/978-3-319-63962-8_185-1

Cited by 40 publications

(23 citation statements)

References 67 publications

(134 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…To define the MEG as a CRDT, we adopt the formal definition introduced with the concept of operation-based CRDTs in [4], [19] and use the pseudo code notation by Preguiça [22].…”

Section: A Formalization Of the Megmentioning

confidence: 99%

Analysis of the Matrix Event Graph Replicated Data Type

et al. 2021

View full text Add to dashboard Cite

show abstract

“…To define the MEG as a CRDT, we adopt the formal definition introduced with the concept of operation-based CRDTs in [4], [19] and use the pseudo code notation by Preguiça [22].…”

Section: A Formalization Of the Megmentioning

confidence: 99%

Analysis of the Matrix Event Graph Replicated Data Type

et al. 2021

View full text Add to dashboard Cite

show abstract

“…The CRDT involved in the application scenario is an AW-Set (Add Wins Set), a distributed set to which items can either be added or removed [2]. An AW-Set is a causal CRDT, and its digest can be expressed as a version vector.…”

Section: Mobility and Application Scenariomentioning

confidence: 99%

“…Conflict-free Replicated Data Types (CRDTs) are used in distributed system when eventual consistency of replicated data is sufficient [1], [2], allowing replicas to diverge temporarily while ensuring that they will eventually be reconciled into the same state. Any replica of a CRDT can be updated locally, without any coordination with other replicas.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Delta-State-Based Synchronization of CRDTs in Opportunistic Networks

Guidec

Mahéo

Noûs³

2021

2021 IEEE 46th Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

Conflict-Free Replicated Data Types (CRDTs) are distributed data types that support optimistic replication: replicas can be updated locally, and updates propagate asynchronously among replicas, so consistency is eventually obtained. This ability to tolerate asynchronous communication makes them ideal candidates to serve as software building blocks in opportunistic networks (OppNets), that is, mobile networks in which the dissemination of information can only depend on unpredicted transient radio contacts between pairs of nodes. In this paper we investigate the problem of implementing CRDTs in an Opp-Net, and we propose a delta-state-based algorithm to solve this problem. Experimental results confirm that this algorithm ensures the synchronization of CRDT replicas in an OppNet, and that it outperforms a pure state-based synchronization algorithm when dealing with container CRDTs.

show abstract

“…To ease the development of geo-distributed applications, much research has studied the concept of replicated data types which expose to programmers an interface akin to that of a sequential data type while implementing mechanisms to keep data consistent across replicas [7,12,16]. Conflict-Free Replicated Data Types [14][15][16] (CRDTs) are replicated data structures that can be concurrently updated without requiring synchronization among replicas to deal with conflicts. In particular, CRDTs are said to be strong eventually consistent (SEC), which denotes that if two components of a system have received the same updates, they will be in the same state.…”

Section: Introductionmentioning

confidence: 99%

From causality to stability: understanding and reducing meta-data in CRDTs

Bauwens

Boix

2020

Proceedings of the 17th International Conference on Managed Programming Languages and Runtimes

View full text Add to dashboard Cite

Modern distributed applications increasingly replicate data to guarantee both high availability of systems and optimal user experience. Conflict-Free Replicated Data Types (CRDTs) are a family of data types specially designed for highly available systems that guarantee some form of eventual consistency. To ensure state convergence between replicas, CRDT implementations need to keep track of additional meta-data. This is not a scalable strategy, as a growing amount of meta-data has to be kept.In this paper, we show that existing solutions for this problem miss optimisation opportunities and may lead to less reactive CRDTs. For this, we analyse the relation between meta-data and the causality of operations in operation-based CRDTs. We explore a new optimisation strategy for pure operation-based CRDTs and show how it reduces memory overhead. Our approach takes advantage of the communication layer providing reliable delivery to determine causal stability, and as a result, meta-data can be removed sooner. We furthermore propose a solution for improving the reactivity of CRDTs built on a reliable causal broadcasting layer.We apply our strategy to pure-operation based CRDTs and validate our approach by measuring its impact on several different set-ups. The results show how our approach can lead to significant improvements in meta-data cleanup when compared to state-ofthe-art techniques. CCS CONCEPTS• Software and its engineering → Garbage collection; Synchronization; Consistency; Distributed architectures.

show abstract

Conflict-Free Replicated Data Types CRDTs

Cited by 40 publications

References 67 publications

Analysis of the Matrix Event Graph Replicated Data Type

Analysis of the Matrix Event Graph Replicated Data Type

Delta-State-Based Synchronization of CRDTs in Opportunistic Networks

From causality to stability: understanding and reducing meta-data in CRDTs

Contact Info

Product

Resources

About