Distributed Systems And Algorithms·
Chapter 13 of 51
Linearizability and Sequential Consistency
Akhil Sharma
25 min
← → to navigate
Linearizability and Sequential Consistency
The two strongest consistency models in distributed systems — and the real-world cost of guaranteeing that every read returns the most recent write.
Key Takeaways
Linearizability means operations appear to take effect at a single instant — every read returns the most recent write, as if there's one copy of the data
Sequential consistency means all nodes see operations in the same order — but that order may not match real-time wall-clock ordering
Linearizability is stronger and more expensive than sequential consistency — it requires coordination across nodes on every operation
Use linearizability for correctness-critical operations — leader election, lock acquisition, unique constraint checks
Most distributed databases offer configurable consistency levels — letting you choose the trade-off per operation