Join Decompositions for Efficient Synchronization of CRDTs after a Network Partition: Work in progress report

• Type: Article in International Conference Proceedings Book
• Date: 2016

Authors

Enes, V (Author) Other; Baquero, C (Author) Other; Almeida, PS (Author) Other; Shoker, A (Author) Other

Conference proceedings International

Title: First Workshop on Programming Models and Languages for Distributed Computing, PMLDC@ECOOP 2016, Rome, Italy, July 17, 2016

Final page: 6

1st Workshop on Programming Models and Languages for Distributed Computing, PMLDC 2016

17 July 2016

Indexing

Scopus - 1 Citation

Other information

Authenticus ID: P-00K-NJ3

DOI: 10.1145/2957319.2957374

Abstract (EN): State-based CRDTs allow updates on local replicas without remote synchronization. Once these updates are propagated, possible conflicts are resolved deterministically across all replicas. ¿-CRDTs bring significant advantages in terms of the size of messages exchanged between replicas during normal operation. However, when a replica joins the system after a network partition, it needs to receive the updates it missed and propagate the ones performed locally. Current systems solve this by exchanging the full state bidirectionally or by storing additional metadata along the CRDT. We introduce the concept of join-decomposition for state-based CRDTs, a technique orthogonal and complementary to delta-mutation, and propose two synchronization methods that reduce the amount of information exchanged, with no need to modify current CRDT definitions. © 2016 Copyright held by the owner/author(s).

Language: English

Type (Professor's evaluation): Scientific