Strong_consistency

Strong consistency

Strong consistency

Add article description

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

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

References

  1. [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)


Stub icon

This technology-related article is a stub. You can help Wikipedia by expanding it.
Share this article:

This article uses material from the Wikipedia article Strong_consistency, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.