05Design patternsManaging long-running tasks
05 · Reusable pattern
Managing long-running tasks
Expose progress, cancellation, checkpointing, leases, retries, and result retention.Lesson spine
What you need to understand.
Long work should outlive the initiating request and expose durable state, progress, cancellation, and recovery.
Async task contract
Create a job, return its ID immediately, and expose status or event endpoints instead of holding a request for minutes.
Leased ownership
A worker claims the job for a bounded time and heartbeats; expiry allows another attempt after a crash.
Checkpointing
Persist resumable stage state often enough to bound wasted work without turning every inner step into storage traffic.
Progress
Report durable milestones or processed units, not invented percentages, and include current stage and last update time.
Cancellation
Record intent, fence later commits, release capacity, and define which external effects cannot be undone.
Retry and dead letters
Classify transient failures, back off with jitter, cap attempts, and surface terminal jobs for operator repair.
Before the boxes
Frame the decision.
What must work
Expose progress, cancellation, checkpointing, leases, retries, and result retention.
What changes the design
Runtime · checkpoint cost · retry probability · progress rate · retention
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.
Creates job
Owns state
Buffers stages
Claims lease
Persists progress
Updates client
Expires results
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
Client — Creates job Define the output contract before moving to the next owner.
- 02
Job store — Owns state Define the output contract before moving to the next owner.
- 03
Queue — Buffers stages Define the output contract before moving to the next owner.
- 04
Worker — Claims lease Define the output contract before moving to the next owner.
- 05
Checkpoint store — Persists progress Define the output contract before moving to the next owner.
- 06
Progress stream — Updates client Define the output contract before moving to the next owner.
- 07
Cleanup — Expires results 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 | Fine checkpoints reduce retry waste but add writes and resume complexity. | 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
Duplicate ownership and cancellation during commit create contradictory outcomes.
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 Managing long-running tasks, the decision I want to make explicit is this: Fine checkpoints reduce retry waste but add writes and resume complexity. 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 Managing long-running tasks, 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?