2 docs tagged with "distributedmodels"

The CAP theorem explains a choice forced by a network partition: a distributed system may preserve one consistent answer by rejecting some requests, or remain available by allowing temporarily different answers.

Linearizability makes operations across several replicas appear to take effect once in a single real-time order. After a write finishes, any later read must not return the older value.