05Design patternsDealing with Contention
05 · Reusable pattern
Dealing with Contention
Choose optimistic control, locks, queues, reservations, or single-writer ownership for shared state.Lesson spine
What you need to understand.
Contention control chooses who may advance shared state and what losing requests do.
Optimistic concurrency
Read a version, compute a change, and conditionally commit if the version is unchanged; retry after rare conflicts.
Pessimistic locks
Block contenders while a short critical section runs; fit high conflict or expensive retries but add wait and deadlock risk.
Atomic operations and CAS
Use store-native increments, conditional writes, or compare-and-swap for small invariants without a general lock service.
Distributed locks
Use leases with unique tokens and time bounds only when the protected resource cannot enforce ownership itself.
Fencing tokens
Give every new lease a larger epoch and make the downstream resource reject stale owners after pauses or partitions.
Serialization alternatives
Single-writer actors, partitioned queues, and reservations can turn conflict into ordered work with clearer recovery.
Before the boxes
Frame the decision.
What must work
Choose optimistic control, locks, queues, reservations, or single-writer ownership for shared state.
What changes the design
Conflict rate · critical duration · retry cost · hot-key share · fairness
What owns the truth
Identify the component that commits authoritative state, then separate synchronous confirmation from derived work.
What stays simple
Do not add global coordination, multi-region writes, or a specialized store until a requirement earns the complexity.
Architecture map
Trace ownership, not just traffic.
Follow the decision from left to right. Every arrow should have a reason.
Propose changes
Guards state
Serializes conflicts
Commits a winner
Re-evaluates losers
Show wait and conflict
Walk one representative request across every arrow. Say whether the handoff is synchronous or asynchronous, what identity makes a retry safe, and which step changes authoritative state.
- 01
Contenders — Propose changes Define the output contract before moving to the next owner.
- 02
Version or lock — Guards state Define the output contract before moving to the next owner.
- 03
Coordinator — Serializes conflicts Define the output contract before moving to the next owner.
- 04
State store — Commits a winner Define the output contract before moving to the next owner.
- 05
Retry path — Re-evaluates losers Define the output contract before moving to the next owner.
- 06
Metrics — Show wait and conflict Confirm the result and emit the evidence needed to reconcile it.
Decision table
Make the trade-offs explicit.
| Decision | Defensible position | Cost to acknowledge |
|---|---|---|
| Primary mechanism | Optimistic control fits rare conflicts; locks fit expensive retries or frequent contention. | The stronger guarantee usually adds coordination, latency, state, or operational work. |
| Sync vs. async | Keep only correctness-critical confirmation synchronous. Move derived views, notifications, analytics, and cleanup behind a durable boundary. | Async work needs idempotency, lag monitoring, replay, and a product definition for partial completion. |
| Simple vs. scaled | Begin with one logical owner and a clear API. Partition or replicate only the resource proven to be the first bottleneck. | Migration requires stable identities, versioned contracts, backfill, and a rollback path. |
Failure review
Design the recovery path.
Topic-specific risk
Deadlocks, expiry, starvation, and retry storms turn protection into outage.
ResponsePersist enough identity and state to distinguish retry, resume, compensation, and operator repair.
Dependency timeout
A timeout is ambiguous: the remote side may have failed, succeeded, or still be running.
ResponseUse deadlines, bounded backoff with jitter, idempotency keys, and a status or reconciliation path.
Overload or skew
Average capacity can look healthy while a tenant, key, partition, region, or expensive request saturates one owner.
ResponseExpose queue depth and hot-key share, apply backpressure, isolate tenants, and degrade optional work before correctness.
Evidence + level bar
Prove the design can be operated.
Health of the promise
Measure user-visible latency or freshness, correctness drift, saturation, retry volume, and time to recover. Alert on the failed promise—not only CPU.
Complete and clear
Finish the happy path, identify the state owner, choose reasonable building blocks, and explain one scale mechanism.
Trade-offs and failure
Separate read and write paths, define consistency, explain partitioning, and make duplicate or partial failure safe.
Evolution and operations
Discuss multi-region boundaries, migration, tenant isolation, capacity, observability, and how the architecture changes over time.
Interview language
Open the deep dive with a claim.
“For Dealing with Contention, the decision I want to make explicit is this: Optimistic control fits rare conflicts; locks fit expensive retries or frequent contention. I’ll trace the state-changing path first, show where the result becomes durable, then test the design against the highest-risk failure and our target scale.”
08 · Retrieval check
Can you defend it without the page?
- For Dealing with Contention, where is the correctness boundary and which failure would you test first?
- Which component owns committed truth, and what event or response proves the commit?
- Where is the first scaling or coordination bottleneck under the stated envelope?
- What happens after an ambiguous timeout or duplicate operation?
- Which complexity would you remove at one hundredth of the scale?