PACELC theorem
In theoretical computer science, the PACELC theorem is an extension to 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).
Wikipage redirect
primaryTopic
PACELC theorem
In theoretical computer science, the PACELC theorem is an extension to 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).
has abstract
In theoretical computer scienc ...... tency (L) and consistency (C).
@en
Link from a Wikipage to an external page
Wikipage page ID
51,386,205
Wikipage revision ID
738,996,439
comment
In theoretical computer scienc ...... tency (L) and consistency (C).
@en
label
PACELC theorem
@en