Local Consistency

1997 · Bataller, Bernabéu-Aubán · theoretical, formal · axiomatic formalism

The weakest consistency model: each process's own operations appear in its program order, with no constraint on the order in which writes by other processes become visible, and different processes may see different orders. The bottom of the Steinke–Nutt lattice.

Properties

Property vector author-extrapolated — set only where the model’s definition pins the cell down (unknown cells are omitted); cells citing a specific source are marked.

Reasoning guarantees: no Coherence
Atomicity guarantees: no Multicopy atomic

Ordering relationships

Strictly weaker than: Slow Consistency — Local consistency is the weakest model, strictly weaker than slow consistency (Bataller & Bernabeu-Auban 1997; Steinke & Nutt 2004).

References

Jordi Bataller, José M. Bernabéu-Aubán. Synchronized DSM Models. Proc. Euro-Par, 1997.
Robert C. Steinke, Gary J. Nutt. A Unified Theory of Shared Memory Consistency. Journal of the ACM 51(5), 2004. arxiv.org/abs/cs/0208027

Open Local in the interactive map →