Strong consistency

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:

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.

References

Tanenbaum, Andrew S. (2002). Distributed systems : principles and paradigms. Maarten van Steen. Upper Saddle River, New Jersey. p. 274. ISBN 0-13-088893-1. OCLC 46944964.{{cite book}}: CS1 maint: location missing publisher (link)

[1] Tanenbaum, Andrew S. (2002). Distributed systems : principles and paradigms. Maarten van Steen. Upper Saddle River, New Jersey. p. 274. ISBN 0-13-088893-1. OCLC 46944964.{{cite book}}: CS1 maint: location missing publisher (link)

1

See also

References