Strong consistency

This article does not cite any sources. Please help by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:  –  ·  ·  · scholar · JSTOR (December 2011) (Learn how and when to remove this template message)

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

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.

See also[]

• CAP theorem

This technology-related article is a stub. You can help Wikipedia by .

• v
• t