Cap Theorem easy
The PACELC theorem extends CAP by stating: Even when there is NO partition (E), the system must choose between:
- A Latency and Consistency (the trade-off between how fast a system responds and how accurately the replicas are synchronized).
- B Total Memory Consumption and CPU Utilization (the physical hardware resources consumed during the normal message replication process).
- C Network Security and Transactional Speed (the time spent performing cryptographic verification vs. the actual data transfer speed).
- D Implementation Cost and Operational Quality (the engineering budget required to maintain high-degree data integrity guarantees).
Answer: A. Latency and Consistency (the trade-off between how fast a system responds and how accurately the replicas are synchronized).
CAP only describes system behavior during a network failure (Partition). PACELC extends this to 'Else' (E)—the state of normal operation. It states that even when there is no partition, you must still choose between Latency (L) and Consistency (C). This is because replicating data to all nodes takes time; forcing a sync before responding increases latency, while responding immediately allows for local data divergence.
One system design question a day, with spaced repetition so the ones you miss come back.
Get the appRelated questions
- What is a 'Split Brain' scenario?
- Why is a CA (Consistent + Available) system generally considered impossible for distributed web applications?
- In CAP, 'Consistency' is equivalent to:
- In the CAP Theorem, what does the 'P' stand for?
- What causes a Network Partition?
- Which system would likely prioritize Consistency over Availability (CP)?