A study of CRDTs that do computations

ABSTRACT

A CRDT is a data type specially designed to allow multiple instances to be replicated and modified without coordination, while providing an automatic mechanism to merge concurrent updates that guarantee eventual consistency. In this paper we present a brief study of computational CRDTs, a class of CRDTs whose state is the result of a computation over the executed updates. We propose three generic designs that reduce the amount of information that each replica maintains and propagates for synchronizations. For each of the designs, we discuss the properties that the function being computed needs to satisfy.

References

1. P. S. Almeida, A. Shoker, and C. Baquero. Efficient state-based crdts by delta-mutation. In Proc. of the Third International Conference on Networked Systems (NETYS) (to appear), May 2015.
2. S. Almeida, J. a. Leitão, and L. Rodrigues. Chainreaction: A causal+ consistent datastore based on chain replication. In Proc. of the 8th ACM European Conference on Computer Systems, EuroSys '13, pages 85--98, 2013. ACM.
3. O. Boykin, S. Ritchie, I. O'Connell, and J. Lin. Summingbird: A framework for integrating batch and online mapreduce computations. Proc. VLDB Endow., 7(13): 1441--1451, Aug. 2014.
4. S. Burckhardt, A. Gotsman, H. Yang, and M. Zawirski. Replicated data types: Specification, verification, optimality. In Proc. of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, pages 271--284, 2014. ACM.
5. J. C. Corbett, J. Dean, M. Epstein, A. Fikes, et. al. Spanner: Google's globally-distributed database. In Proc. of the 10th USENIX Conference on Operating Systems Design and Implementation, OSDI'12, pages 251--264, 2012. USENIX Association.
6. G. DeCandia, D. Hastorun, M. Jampani, G. Kakulapati, A. Lakshman, A. Pilchin, S. Sivasubramanian, P. Vosshall, and W. Vogels. Dynamo: Amazon's highly available key-value store. In Proc. of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles, SOSP '07, pages 205--220, 2007. ACM.
7. W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen. Don't settle for eventual: Scalable causal consistency for wide-area storage with cops. In Proc. of the Twenty-Third ACM Symposium on Operating Systems Principles, SOSP '11, pages 401--416, 2011. ACM.
8. C. Meiklejohn and P. Van Roy. Lasp: A Language for Distributed, Eventually Consistent Computations with CRDTs. In Proc. of the Workshop on Principles and Practice of Consistency for Distributed Data, Apr. 2015.
9. D. Navalho, S. Duarte, N. Preguiça, and M. Shapiro. Incremental stream processing using computational conflict-free replicated data types. In Proc. of the 3rd International Workshop on Cloud Data and Platforms, CloudDP '13, pages 31--36, 2013. ACM.
10. M. Shapiro, N. Preguiça, C. Baquero, and M. Zawirski. Conflict-free replicated data types. In Proc. of the 13th International Conference on Stabilization, Safety, and Security of Distributed Systems, SSS'11, pages 386--400, 2011. Springer-Verlag.
11. J. Yick, B. Mukherjee, and D. Ghosal. Wireless sensor network survey. Comput. Netw., 52(12): 2292--2330, Aug. 2008.

Index Terms

• Software and its engineering

  • Software notations and tools

    • General programming languages

      • Language features

        • Data types and structures

• Theory of computation

  • Models of computation

    • Concurrency

      • Parallel computing models