short-paper

The problem with embedded CRDT counters and a solution

Authors:

Carlos Baquero,

Paulo Sérgio Almeida, and

Carl LercheAuthors Info & Claims

PaPoC '16: Proceedings of the 2nd Workshop on the Principles and Practice of Consistency for Distributed Data

April 2016

Article No.: 10, Pages 1 - 3

https://doi.org/10.1145/2911151.2911159

Published: 18 April 2016 Publication History

Get Access

Abstract

Conflict-free Replicated Data Types (CRDTs) can simplify the design of deterministic eventual consistency. Considering the several CRDTs that have been deployed in production systems, counters are among the first. Counters are apparently simple, with a straightforward inc/dec/read API, but can require complex implementations and several variants have been specified and coded. Unlike sets and registers, that can be adapted to operate inside maps, current counter approaches exhibit anomalies when embedded in maps. Here, we illustrate the anomaly and propose a solution, based on a new counter model and implementation.

References

[1]

P. Bailis and A. Ghodsi. Eventual consistency today: Limitations, extensions, and beyond. Queue, 11(3):20:20--20:32, Mar. 2013.

Digital Library

Google Scholar

[2]

C. Baquero. Delta-enabled-crdts. URL http://github.com/CBaquero/delta-enabled-crdts, Retrieved 22-dec-2015.

Google Scholar

[3]

Basho. Riak datatypes. URL http://github.com/basho, Retrieved 22-dec-2015.

Google Scholar

[4]

R. Brown. Personal Communication, Jan 2016.

Google Scholar

[5]

R. Brown, S. Cribbs, C. Meiklejohn, and S. Elliott. Riak dt map: A composable, convergent replicated dictionary. In Proceedings of the First Workshop on Principles and Practice of Eventual Consistency, PaPEC '14, pages 1:1--1:1, New York, NY, USA, 2014. ACM.

Digital Library

Google Scholar

[6]

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. A comprehensive study of Convergent and Commutative Replicated Data Types. Rapp. Rech. 7506, INRIA, Rocquencourt, France, Jan. 2011.

Google Scholar

[7]

M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. Conflict-free replicated data types. In X. Défago, F. Petit, and V. Villain, editors, Int. Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), volume 6976 of Lecture Notes in Comp. Sc., pages 386--400, Grenoble, France, Oct. 2011. Springer-Verlag.

Digital Library

Google Scholar

[8]

W. Vogels. Eventually consistent. ACM Queue, 6(6):14--19, Oct. 2008.

Digital Library

Google Scholar

Cited By

View all

Weidner MAlmeida PSzekeres ASivaramakrishnan K(2022)An oblivious observed-reset embeddable replicated counterProceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3517209.3524084(47-52)Online publication date: 5-Apr-2022
https://dl.acm.org/doi/10.1145/3517209.3524084
Weidner MMiller HMeiklejohn C(2020)Composing and decomposing op-based CRDTs with semidirect productsProceedings of the ACM on Programming Languages10.1145/34089764:ICFP(1-27)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408976
Bauwens JBoix EFekete AKleppmann M(2020)FlecProceedings of the 7th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3380787.3393685(1-4)Online publication date: 27-Apr-2020
https://dl.acm.org/doi/10.1145/3380787.3393685
Show More Cited By

Index Terms

The problem with embedded CRDT counters and a solution
1. Theory of computation
  1. Design and analysis of algorithms
    1. Distributed algorithms

Recommendations

Making CRDTs Byzantine fault tolerant
PaPoC '22: Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data

It is often claimed that Conflict-free Replicated Data Types (CRDTs) ensure consistency of replicated data in peer-to-peer systems. However, peer-to-peer systems usually consist of untrusted nodes that may deviate from the specified protocol (i.e. ...
Read More
Compact Resettable Counters through Causal Stability
PaPoC '17: Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data

Conflict-free Data Types (CRDTs) were designed to automatically resolve conflicts in eventually consistent systems. Different CRDTs were designed in both operation-based and state-based flavors such as Counters, Sets, Registers, Maps, etc. In a previous ...
Read More
Constraining the eventual in eventual consistency
PaPoC '18: Proceedings of the 5th Workshop on the Principles and Practice of Consistency for Distributed Data

CRDTs are highly available replicated data structures which offer strong eventual consistency in the face of concurrent operations [3]. By their definition, CRDTs eventually converge to a consistent state given enough time. However, this is not strict ...
Read More

Comments

Information & Contributors

Information

Published In

PaPoC '16: Proceedings of the 2nd Workshop on the Principles and Practice of Consistency for Distributed Data

April 2016

54 pages

ISBN:9781450342964

DOI:10.1145/2911151

Program Chairs:
Peter Alvaro
UC Santa Cruz
,
Alysson Bessani
Faculdade de Ciências, Universidade de Lisboa, Portugal

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 April 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Short-paper

Funding Sources

North Portugal Regional Operational Programme (Norte 2020)
European Regional Development Fund (ERDF)
European Union Seventh Framework Program

Conference

EuroSys '16

EuroSys '16: Eleventh EuroSys Conference 2016

April 18 - 21, 2016

London, United Kingdom

Acceptance Rates

Overall Acceptance Rate 34 of 47 submissions, 72%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
253
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)1

Other Metrics

View Author Metrics

Citations

Cited By

View all

Weidner MAlmeida PSzekeres ASivaramakrishnan K(2022)An oblivious observed-reset embeddable replicated counterProceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3517209.3524084(47-52)Online publication date: 5-Apr-2022
https://dl.acm.org/doi/10.1145/3517209.3524084
Weidner MMiller HMeiklejohn C(2020)Composing and decomposing op-based CRDTs with semidirect productsProceedings of the ACM on Programming Languages10.1145/34089764:ICFP(1-27)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3408976
Bauwens JBoix EFekete AKleppmann M(2020)FlecProceedings of the 7th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3380787.3393685(1-4)Online publication date: 27-Apr-2020
https://dl.acm.org/doi/10.1145/3380787.3393685
Braun SDesloch S(2020)A Classification of Replicated Data for the Design of Eventually Consistent Domain Models2020 IEEE International Conference on Software Architecture Companion (ICSA-C)10.1109/ICSA-C50368.2020.00014(33-40)Online publication date: Mar-2020
https://doi.org/10.1109/ICSA-C50368.2020.00014
Zhao XHaller P(2020)Replicated data types that unify eventual consistency and observable atomic consistencyJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2020.100561(100561)Online publication date: May-2020
https://doi.org/10.1016/j.jlamp.2020.100561
Bauwens JGonzalez Boix EBonetta DLiu Y(2019)Memory efficient CRDTs in dynamic environmentsProceedings of the 11th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages10.1145/3358504.3361231(48-57)Online publication date: 22-Oct-2019
https://dl.acm.org/doi/10.1145/3358504.3361231
Zhao XHaller PDe Koster JBergenti FFranco J(2018)Observable atomic consistency for CvRDTsProceedings of the 8th ACM SIGPLAN International Workshop on Programming Based on Actors, Agents, and Decentralized Control10.1145/3281366.3281372(23-32)Online publication date: 5-Nov-2018
https://dl.acm.org/doi/10.1145/3281366.3281372
Gomes VKleppmann MMulligan DBeresford A(2017)Verifying strong eventual consistency in distributed systemsProceedings of the ACM on Programming Languages10.1145/31339331:OOPSLA(1-28)Online publication date: 12-Oct-2017
https://dl.acm.org/doi/10.1145/3133933
Younes GAlmeida PBaquero C(2017)Compact Resettable Counters through Causal StabilityProceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3064889.3064892(1-3)Online publication date: 23-Apr-2017
https://dl.acm.org/doi/10.1145/3064889.3064892
Kleppmann MBeresford A(2017)A Conflict-Free Replicated JSON DatatypeIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2017.269738228:10(2733-2746)Online publication date: 1-Oct-2017
https://doi.org/10.1109/TPDS.2017.2697382
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Making CRDTs Byzantine fault tolerant

Compact Resettable Counters through Causal Stability

Constraining the eventual in eventual consistency