An empirical perspective on causal consistency

ABSTRACT

Causal consistency is the strongest consistency model under which low-latency and high-availability can be achieved. In the past few years, many causally consistent storage systems have been developed. The long-term goal of this initial work is to perform a deep study and comparison of the different implementations of causal consistency. We identify that protocols that provide causal consistency share the well-known DUR (deferred update replication) algorithmic structure and observe that existing implementations of causal consistency fall into a sub-category of DUR that we name A-DUR (Asynchronous-DUR). In this work, we present the A-DUR algorithmic structure, the pseudocode for the instantiation of two causally consistent protocols under the G-DUR framework, and describe the empirical study we intend to perform on causal consistency.

References

1. S. Almeida, J. Leitão, and L. Rodrigues. ChainReaction: a causal+ consistent datastore based on Chain Replication. Apr. 2013.
2. M. S. Ardekani, P. Sutra, and M. Shapiro. G-dur: A middleware for assembling, analyzing, and improving transactional protocols. In Proceedings of the 15th International Middleware Conference, Middleware '14, pages 13--24, New York, NY, USA, 2014. ACM. ISBN 978-1-4503-2785-5. URL http://doi.acm.org/10.1145/2663165.2663336.
3. P. Bailis, A. Fekete, A. Ghodsi, J. M. Hellerstein, and I. Stoica. The potential dangers of causal consistency and an explicit solution. 2012.
4. P. Bailis, A. Ghodsi, J. M. Hellerstein, and I. Stoica. Bolt-on causal consistency. In Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD '13, pages 761--772, New York, NY, USA, 2013. ACM. ISBN 978-1-4503-2037-5. URL http://doi.acm.org/10. 1145/2463676.2465279.
5. J. Du, S. Elnikety, A. Roy, andW. Zwaenepoel. Orbe: Scalable causal consistency using dependency matrices and physical clocks. pages 11:1--11:14, Santa Clara, CA, USA, Oct. 2013. URL http://doi.acm.org/10.1145/2523616.2523628.
6. J. Du, C. Iorgulescu, A. Roy, andW. Zwaenepoel. Gentlerain: Cheap and scalable causal consistency with physical clocks. In Proceedings of the ACM Symposium on Cloud Computing, SOCC '14, pages 4:1--4:13, New York, NY, USA, 2014. ACM. ISBN 978-1-4503-3252-1. URL http://doi.acm.org/10.1145/2670979.2670983.
7. S. Gilbert and N. Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2): 51--59, 2002. ISSN 0163-5700.
8. Grid'5000. Grid'5000, a scientific instrument {...}. https://www.grid5000.fr/, retrieved April 2013.
9. R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat. Providing high availability using lazy replication. ACM Trans. Comput. Syst., 10(4): 360--391, Nov. 1992. URL http://dx.doi. org/10.1145/138873.138877.
10. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Commun. ACM, 21(7): 558--565, July 1978. URL http://doi.acm.org/10.1145/359545.359563.
11. 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. pages 401--416, Cascais, Portugal, Oct. 2011.
12. W. Lloyd, M. J. Freedman, M. Kaminsky, and D. G. Andersen. Stronger semantics for low-latency geo-replicated storage. pages 313--328, Lombard, IL, USA, Apr. 2013. URL https://www.usenix.org/system/files/conference/nsdi13/nsdi13-final149.pdf.
13. P. Mahajan, L. Alvisi, and M. Dahlin. Consistency, availability, and convergence. Technical Report UTCS TR-11-22, Dept. of Comp. Sc., The U. of Texas at Austin, Austin, TX, USA, 2011.

Index Terms

• Software and its engineering

  • Software notations and tools

    • General programming languages

      • Language features

        • Concurrent programming structures

• Theory of computation

  • Models of computation

    • Concurrency

      • Parallel computing models