Strong consistency

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Strong consistency is one of the consistency models used in the domain of the concurrent programming (e.g. in distributed shared memory, distributed transactions etc.).

The protocol is said to support strong consistency if:

  1. All accesses are seen by all parallel processes (or nodes, processors etc.) in the same order (sequentially)

Therefore only one consistent state can be observed, as opposed to weak consistency, where different parallel processes (or nodes etc.) can perceive variables in different states.