Consistency model
From Wikipedia, the free encyclopedia
In computer science, in a distributed system such as a distributed shared memory system or a distributed data store such as a database, filesystem, or web caching system, there are a number of possible data consistency models. The system supports a given model if operations on memory follow specific rules. The data consistency model specifies a contract between programmer and system, wherein the system guarantees that if the programmer follows the rules, memory will be consistent and the results of memory operations will be predictable.
Examples include:
- strict consistency
- sequential consistency
- causal consistency
- release consistency
- eventual consistency
- delta consistency
- linearizability (also known as atomicity consistency)
- PRAM consistency
- weak consistency
- fork consistency
[edit] Further reading
- Mosberger, David (1993). "Memory Consistency Models". Operating Systems Review 27 (1): 18-26.
- Steinke, Robert C., Gary J. Nutt (2004). "A unified theory of shared memory consistency". Journal of the ACM 51 (5): 800-849.
- Ali Sezgin (2004). "Formalization and verification of shared memory" (PDF). (contains many valuable references)
