An Implementation of Causal Memories Using the Writing Semantic

Causal consistency has been introduced to increase wait-free concurrent accesses to a shared memory. Contrary to sequential consistency, causal consistency allows independent write operations, with respect to the causality relation, to be executed in different orders at each distinct process. This paper introduces a protocol for fully replicated settings which exploits the writing semantic and piggybacks on each update message related to a write operation an amount of control information which is O(n) where n is the number of processes. The protocol tracks causality relation by taking transitive dependencies on write operations into account.