PACELC theorem
The PACELC theorem describes distributed-system tradeoffs: consistency versus availability during a network partition, and consistency versus latency when no partition occurs.
The Coder Cafe
The PACELC theorem extends CAP by stating that a distributed system chooses between consistency and availability during a partition, and between latency and consistency when no partition occurs.
- How it is used
- Frames distributed database choices around partition-time guarantees and normal-operation response speed.
- How deep it goes
- Defines both decisions and four combinations, but does not detail the mechanisms that implement them.
- Examples
- Contrasts DynamoDB's PA/EL classification with CockroachDB's PC/EC classification and uses a thirty-minute response to expose CAP's latency blind spot.
- What you can do after
- Evaluate/understand distributed database claims by checking both partition-time and normal-operation trade-offs.
PostgreSQL Mistakes and How to Avoid Them
The PACELC theorem describes the tradeoff between consistency and availability during partition and between latency and consistency when the system is operating normally.
- How it is used
- Frames multi-master PostgreSQL replication as a design constrained by availability, consistency, partition tolerance, and normal-operation latency.
- How deep it goes
- Defines PACELC guarantees and relates them to replication, while deferring a complete production multi-master design.
- Examples
- Uses a bidirectionally replicated ticket table with duplicate identity keys and a missing replicated column.
- What you can do after
- Evaluate/understand why multi-master PostgreSQL designs require explicit compromises and established solutions for production use.
Read how PostgreSQL Mistakes and How to Avoid Them explains PACELC theorem →
Grokking Software Architecture
PACELC is a model of distributed-system tradeoffs that considers latency and consistency during normal operation as well as availability and consistency during a partition.
- How it is used
- Frames distributed-system design choices around network partitions and normal operation.
- How deep it goes
- Explains both tradeoffs with a checkout scenario and mentions partition mode and compensation.
- Examples
- Uses an order-payment timeout and an offline ATM with a withdrawal limit to illustrate partition choices.
- What you can do after
- Evaluate availability, consistency, and latency tradeoffs when choosing how a distributed system responds.
Read how Grokking Software Architecture explains PACELC theorem →
What to know first
- CAP theoremThe CAP theorem is a distributed-systems impossibility result stating that consistency, availability, and partition tolerance cannot all be guaranteed during a network partition.
- consistencyConsistency is the degree to which related data, behavior, or results agree with one another and conform to applicable rules or expectations.
- distributed systemA distributed system is a computing system whose components run across multiple networked processes or machines and coordinate through communication.
- availabilityAvailability is the degree or proportion of time that a system or service is operational and accessible when required.
Related concepts
- CAP theoremcontrasts with · The CAP theorem is a distributed-systems impossibility result stating that consistency, availability, and partition tolerance cannot all be guaranteed during a network partition.
- availabilitycontrasts with · Availability is the degree or proportion of time that a system or service is operational and accessible when required.
- meancontrasts with · The mean is a measure of central location equal to the arithmetic average of numerical observations, or the probability-weighted average of a random variable’s possible values.
- consistency modelcontrasts with · A consistency model is a formal specification of how operations on state may be ordered and what values those operations can observe.
- consistencycontrasts with · Consistency is the degree to which related data, behavior, or results agree with one another and conform to applicable rules or expectations.
- distributed systemuses · A distributed system is a computing system whose components run across multiple networked processes or machines and coordinate through communication.
Questions about PACELC theorem
What is PACELC theorem?
The PACELC theorem describes distributed-system tradeoffs: consistency versus availability during a network partition, and consistency versus latency when no partition occurs.
Which Manning books explain PACELC theorem?
The Coder Cafe, PostgreSQL Mistakes and How to Avoid Them and Grokking Software Architecture.
What should I know before learning PACELC theorem?
Manning books that teach PACELC theorem usually introduce CAP theorem, consistency, distributed system and availability first.
What is the difference between PACELC theorem and CAP theorem?
The PACELC theorem describes distributed-system tradeoffs: consistency versus availability during a network partition, and consistency versus latency when no partition occurs. The CAP theorem is a distributed-systems impossibility result stating that consistency, availability, and partition tolerance cannot all be guaranteed during a network partition.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.


