Orbe: Scalable Causal Consistency Using Dependency Matrices and Physical Clocks

We propose two protocols that provide scalable causal consistency for both partitioned and replicated data stores using dependency matrices (DM) and physical clocks. The DM protocol supports basic read and update operations and uses two-dimensional dependency matrices to track dependencies in a client session. It utilizes the transitivity of causality and sparse matrix encoding to keep dependency metadata small and bounded. The DM-Clock protocol extends the DM protocol to support read-only transactions using loosely synchronized physical clocks. We implement the two protocols in Orbe, a distributed key-value store, and valuate them experimentally. Orbe scales out well, incurs relatively small verhead over an eventually consistent key-value store, and outperforms an existing system that uses explicit dependency tracking to provide scalable causal consistency.

Presented at:
2013 ACM Symposium on Cloud Computing (SOCC), Santa Clara, California, USA, October 1-3, 2013

 Record created 2013-09-16, last modified 2018-03-17

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)