Causal Consistency: Beyond Memory - Archive ouverte HAL Access content directly
Conference Papers Year :

Causal Consistency: Beyond Memory


In distributed systems where strong consistency is costly when not impossible, causal consistency provides a valuable abstraction to represent program executions as partial orders. In addition to the sequential program order of each computing entity, causal order also contains the semantic links between the events that affect the shared objects – messages emission and reception in a communication channel , reads and writes on a shared register. Usual approaches based on semantic links are very difficult to adapt to other data types such as queues or counters because they require a specific analysis of causal dependencies for each data type. This paper presents a new approach to define causal consistency for any abstract data type based on sequential specifications. It explores, formalizes and studies the differences between three variations of causal consistency and highlights them in the light of PRAM, eventual consistency and sequential consistency: weak causal consistency, that captures the notion of causality preservation when focusing on convergence ; causal convergence that mixes weak causal consistency and convergence; and causal consistency, that coincides with causal memory when applied to shared memory.
Fichier principal
Vignette du fichier
ppopp.pdf (236.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01286755 , version 1 (11-03-2016)



Matthieu Perrin, Achour Mostefaoui, Claude Jard. Causal Consistency: Beyond Memory. 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2016, Barcelone, Spain. ⟨10.1145/2851141.2851170⟩. ⟨hal-01286755⟩
202 View
635 Download



Gmail Facebook Twitter LinkedIn More