Strong consistency makes every read return the most recent write or an equivalent current value, so the system behaves like one up-to-date copy regardless of the node accessed. section 6.2
Interview scenario
When asked to compare strong and eventual consistency, explain that strong consistency protects correctness for banking and financial ledgers, while eventual consistency accepts temporary staleness for higher availability and resilience. section 6.2
Evaluate the trade-off through these points:
- Prefer strong consistency when stale or conflicting data could cause serious errors. section 6.2
- Recognize that partition tolerance makes the practical CAP trade-off primarily consistency versus availability. section 6.2
- Contrast it with eventual consistency, which allows temporary staleness while replicas converge. section 6.2
Table 6.3 Distributed computing fundamentals
|
Topic
|
Fundamentals
|
Applied skills
|
Advanced
|
|
CAP theorem
|
Understand that a distributed system can only guarantee two of: consistency, availability, and partition tolerance.
|
Classify real systems as CP, AP, or CA. e.g., DynamoDB is AP; HBase is CP. Explain trade-offs during network failures.
See appendix A.13 for details.
|
Evaluate architectural decisions under partition scenarios. Justify consistency/availability choices in critical systems.
|
|
Consistency models
|
Know the difference between strong consistency and eventual consistency. Recognize intermediate models like causal and read-your-writes.
|
Select appropriate models based on system requirements—Use strong consistency (e.g., PostgreSQL for financial applications, and eventual consistency (e.g., Cassandra or DynamoDB) for social media feeds. Implement tunable consistency settings when supported to balance performance and correctness.
|
Analyze and optimize consistency guarantees in distributed storage or multi-region deployments. Design around consistency anomalies.
|
|
Consensus
|
Understand the purpose of consensus in distributed systems (e.g., agreement despite failures). Know examples like Paxos and Raft.
|
Use consensus algorithms for leader election, quorum writes, or log replication (e.g., etcd —
https://etcd.io, ZooKeeper—
https://zookeeper.apache.org). Handle node failures and retries.
|
Evaluate and tune consensus performance under network partitions. Compare protocols (Raft vs. Paxos) in terms of safety, liveness, and complexity.
|
|
Constraints
|
Understand that distributed systems face inherent challenges such as partial failures (some nodes fail while others function), network latency, and messages arriving out of order or being lost.
|
Design applications to handle retries, timeouts, and idempotency. Implement patterns like heartbeats, acknowledgments, and sequence numbers to detect and mitigate message reordering or loss.
|
Architect fault-tolerant systems that maintain correctness under adverse conditions. Simulate failures (e.g., chaos engineering) to validate resilience. Optimize protocols for latency-sensitive workloads while tolerating network-level issues.
|
Compare consistency models, system classifications, and appropriate application choices in a compact reference table. section 6.2



