Distributed Systems

Eventual Consistency

CAP Theorem

CAP Theorem

PACELC Theorem

Wikipedia PACELC:

In case of network partitioning (P) in a distributed computer system, one has to choose between availability (A) and consistency (C) (as per the CAP theorem), but else (E), even when the system is running normally in the absence of partitions, one has to choose between latency (L) and consistency (C).

Fallacies of Distributed Computing

From Wikipedia

The fallacies of distributed computing are a set of assertions made by L Peter Deutsch and others at Sun Microsystems describing false assumptions that programmers new to distributed applications invariably make.

The fallacies are:

  1. The network is reliable;
  2. Latency is zero;
  3. Bandwidth is infinite;
  4. The network is secure;
  5. Topology doesn’t change;
  6. There is one administrator;
  7. Transport cost is zero;
  8. The network is homogeneous.

Eventual Consistency

How eventual is eventual consistency?

How to program under eventual consistency?

Can stronger guarantees be provided without losing benefits?


Edit this page.