Strong consistency is one of the

consistency model In computer science, a consistency model specifies a contract between the programmer and a system, wherein the system guarantees that if the programmer follows the rules for operations on memory, memory will be consistent and the results of readi ...

s used in the domain of

concurrent programming Concurrent means happening at the same time. Concurrency, concurrent, or concurrence may refer to: Law * Concurrence, in jurisprudence, the need to prove both ''actus reus'' and ''mens rea'' * Concurring opinion (also called a "concurrence"), a ...

(e.g., in

distributed shared memory In computer science, distributed shared memory (DSM) is a form of memory architecture where physically separated memories can be addressed as a single shared address space. The term "shared" does not mean that there is a single centralized memor ...

distributed transactions A distributed transaction is a database transaction in which two or more network hosts are involved. Usually, hosts provide transactional resources, while the transaction manager is responsible for creating and managing a global transaction that enc ...

). 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 The name weak consistency can be used in two senses. In the first sense, strict and more popular, weak consistency is one of the consistency models used in the domain of concurrent programming (e.g. in distributed shared memory, distributed transac ...

, where different parallel processes (or nodes, etc.) can perceive variables in different states.

References

Consistency models {{Tech-stub

See also

References