CRDTs: The Hard Parts

栏目: IT技术 · 发布时间: 5年前

内容简介：A talk atConflict-free Replicated Data Types (CRDTs) are an increasingly popular family of algorithms for optimistic replication. They allow data to be concurrently updated on several replicas, even while those replicas are offline, and provide a robust wa

A talk at Hydra , online (originally planned to be in Moscow, Russia), 06 Jul 2020

Slides
Video

Abstract

Conflict-free Replicated Data Types (CRDTs) are an increasingly popular family of algorithms for optimistic replication. They allow data to be concurrently updated on several replicas, even while those replicas are offline, and provide a robust way of merging those updates back into a consistent state. CRDTs are used in geo-replicated databases, multi-user collaboration software, distributed processing frameworks, and various other systems.

However, while the basic principles of CRDTs are now quite well known, many challenging problems are lurking below the surface. It turns out that CRDTs are easy to implement badly. Many published algorithms have anomalies that cause them to behave strangely in some situations. Simple implementations often have terrible performance, and making the performance good is challenging.

In this talk Martin goes beyond the introductory material on CRDTs, and discusses some of the hard-won lessons from years of research on making CRDTs work in practice.

References

Logoot: Stéphane Weiss, Pascal Urso, and Pascal Molli: “ Logoot: A Scalable Optimistic Replication Algorithm for Collaborative Editing on P2P Networks ,” ICDCS 2009.
LSEQ: Brice Nédelec, Pascal Molli, Achour Mostefaoui, and Emmanuel Desmontils: “ LSEQ: an Adaptive Structure for Sequences in Distributed Collaborative Editing ,” DocEng 2013.
RGA: Hyun-Gul Roh, Myeongjae Jeon, Jin-Soo Kim, and Joonwon Lee: “ Replicated abstract data types: Building blocks for collaborative applications ,” Journal of Parallel and Distributed Computing, 71(3):354–368, 2011.
Treedoc: Nuno Preguiça, Joan Manuel Marques, Marc Shapiro, and Mihai Letia: “ A Commutative Replicated Data Type for Cooperative Editing ,” ICDCS 2009.
WOOT: Gérald Oster, Pascal Urso, Pascal Molli, and Abdessamad Imine: “ Data consistency for P2P collaborative editing ,” CSCW 2006.
A _strong : Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, and Marek Zawirski: “ Specification and Complexity of Collaborative Text Editing ,” PODC 2016.
Interleaving anomaly: Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, and Alastair R. Beresford: “ Interleaving anomalies in collaborative text editors ”. PaPoC 2019.
Proof of no interleaving in RGA: Martin Kleppmann, Victor B F Gomes, Dominic P Mulligan, and Alastair R Beresford: “ OpSets: Sequential Specifications for Replicated Datatypes ,” May 2018.
Moving list items: Martin Kleppmann: “ Moving Elements in List CRDTs ”. PaPoC 2020.
Move operation in CRDT trees: Martin Kleppmann, Dominic P. Mulligan, Victor B. F. Gomes, and Alastair R. Beresford: “ A highly-available move operation for replicated trees and distributed filesystems ”. Preprint, 2020.
Reducing metadata overhead: Martin Kleppmann: “ Experiment: columnar data encoding for Automerge ”, 2019. Also: “ Preview: Automerge binary data format (Automerge PR #253) ”, 2020.
Local-first software: Martin Kleppmann, Adam Wiggins, Peter van Hardenberg, and Mark McGranaghan: “ Local-first software: You own your data, in spite of the cloud ”. Onward! 2019.