PACELC Theorem

PACELC builds on the CAP theorem. It states that 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) page .

The PACELC theorem was first described by Daniel J. Abadi at Yale in a 2010: Problems with CAP, and Yahoo’s little known NoSQL system blogpost

Uploaded image

Welcome Visitors --> Testing Graph Plugin --> About Graph Plugin Testing Graph Plugin <-- SVG in IMG Tag