Task Management System — System Design Academy

Complete System Design Tutorial

The design separates the latency-sensitive online path, the correctness-critical durable transition, and asynchronous projection or repair work. Each chapter below explains one decision shown in the diagrams.

1. Requirements and scope

Functional requirements

Execute the primary task management system workflow and return an observable result.
Expose the concrete operations shown below with stable retry identities.
Allow operators to inspect, disable, repair, or replay ambiguous state.
Keep derived analytics and notifications off the correctness-critical path.

Non-functional requirements

Design for Millions tasks · collaborative updates · flexible workflows.
Protect the named business invariant under concurrency and partial failure.
Scale by an explicit aggregate/partition key without one global mutex.
Degrade intentionally when cache, queue, store, or regional ownership is unavailable.

Primary invariant: every object transition is legal and atomic at one aggregate boundary.

↑ top

2. Capacity assumptions

State assumptions before choosing technology. The supplied workload is Millions tasks · collaborative updates · flexible workflows. Convert it into peak throughput, retained records, bandwidth, and failure budget; then connect each number to a component.

Dimension	Working estimate	Design implication
Traffic	Millions tasks · collaborative updates · flexible workflows	Separate online compute, durable state, and asynchronous consumers.
Peak factor	5–10× average	Admission control, autoscaling headroom, and hot-key protection.
Stored state	write rate × retention × record bytes	Partition count, indexes, compaction, backup, and archival tier.
Network	peak operations × payload size	Batching, compression, edge placement, and egress budget.
Availability	99.9–99.99%	Multi-zone replicas, tested failover, and dependency error budgets.
Recovery	RPO/RTO by invariant	Ack boundary, replay retention, reconciliation, and operator runbooks.

Do not cargo-cult the numbers: show the arithmetic, name the uncertain variable, and say which production metric will replace the interview estimate.

↑ top

3. API and data model

POST /v1/taskscreate in workspace

PATCH /v1/tasks/{id} If-Match: version

POST /v1/tasks/{id}/transitionspolicy command

POST /v1/tasks/{id}/dependenciescycle-checked edge

Authoritative records and indexes

task(task_id PK, workspace_id, status, assignee, version, due_at)

workflow(workspace_id, version, states, transitions)

dependency(predecessor_id, successor_id UNIQUE)

activity(task_id, sequence, actor, type, payload)

Command and event envelopes

# Command envelope
operation: POST /v1/tasks
request_id: req_01J...
idempotency_key: idem_7f2...
aggregate_key: task-management_123
expected_version: 17
payload: {...}

# Durable event
event_id: evt_01J...
aggregate_key: task-management_123
event_type: task_management_committed
schema_version: 3
trace_id: tr_8ac...

The authoritative aggregate and idempotency record share a transactional or conditional-write boundary. Event streams, search indexes, caches, analytics, and dashboards are rebuildable projections.

↑ top

4. Why this architecture and what it costs

The boxes are not a shopping list. Each boundary exists because it owns a different invariant, scaling dimension, data lifecycle, security policy, or failure domain. The table makes those choices explicit and shows when the design should remain simpler.

Component	Owned responsibility	Why separate it	Rejected alternative	Cost and evolution trigger
Web / Mobile	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Authenticate workspace actor and load task plus pinned workflow version.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents the external caller from also owning the contract and failure behavior of Task API.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Two users edit same task version” to the external caller.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Web / Mobile boundary before extracting or scaling it.
Task API	Owns authentication, validation, quotas, deadlines, and routing. In this design it participates in: Validate requested fields/transition against role, current state, and expected version.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Web / Mobile from also owning the contract and failure behavior of Auth / Workspace.	Put protocol, authentication, quotas, and business transitions in one process. Acceptable at low scale, but it couples external traffic risk to domain releases. Here that simpler choice would couple “Dependency edge creates long cycle” to Web / Mobile.	Costs another hop, policy distribution, and a high-blast-radius fleet. Introduce it when many clients or services need one protocol and protection boundary. Measure the latency, saturation, lag, or mismatch at the Task API boundary before extracting or scaling it.
Auth / Workspace	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: For dependency edge, traverse bounded ancestors or use maintained topological metadata to reject cycle.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Task API from also owning the contract and failure behavior of Task Aggregate.	Embed policy in every caller. Rules then drift by deployment version and emergency changes require fleet-wide redeployment. Here that simpler choice would couple “Workflow changes while tasks active” to Task API.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Auth / Workspace boundary before extracting or scaling it.
Task Aggregate	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Conditionally update task and append immutable activity/outbox in one transaction.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Auth / Workspace from also owning the contract and failure behavior of Workflow Engine.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Recurring worker retries occurrence” to Auth / Workspace.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Task Aggregate boundary before extracting or scaling it.
Workflow Engine	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Index/search/notify asynchronously; recurring worker creates deduped occurrence IDs.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Task Aggregate from also owning the contract and failure behavior of Transition Policy.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Notification fan-out spams watchers” to Task Aggregate.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Workflow Engine boundary before extracting or scaling it.
Transition Policy	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Authenticate workspace actor and load task plus pinned workflow version.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Workflow Engine from also owning the contract and failure behavior of Dependency Graph.	Embed policy in every caller. Rules then drift by deployment version and emergency changes require fleet-wide redeployment. Here that simpler choice would couple “Two users edit same task version” to Workflow Engine.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Transition Policy boundary before extracting or scaling it.
Dependency Graph	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Validate requested fields/transition against role, current state, and expected version.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Transition Policy from also owning the contract and failure behavior of Cycle Detector.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Dependency edge creates long cycle” to Transition Policy.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Dependency Graph boundary before extracting or scaling it.
Cycle Detector	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: For dependency edge, traverse bounded ancestors or use maintained topological metadata to reject cycle.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Dependency Graph from also owning the contract and failure behavior of Task DB.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Workflow changes while tasks active” to Dependency Graph.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Cycle Detector boundary before extracting or scaling it.
Task DB	Owns authoritative versioned state or immutable evidence. In this design it participates in: Conditionally update task and append immutable activity/outbox in one transaction.	Defines the source of truth and commit boundary. It prevents Cycle Detector from also owning the contract and failure behavior of Activity Log.	Let each service persist its own interpretation. That removes one clear commit boundary and makes retries, support, and reconciliation ambiguous. Here that simpler choice would couple “Recurring worker retries occurrence” to Cycle Detector.	Costs schema migration, replication, backup, and shard ownership. Split storage only when access patterns, retention, or compliance boundaries materially differ. Measure the latency, saturation, lag, or mismatch at the Task DB boundary before extracting or scaling it.
Activity Log	Preserves durable ordering, replay, and consumer checkpoints. In this design it participates in: Index/search/notify asynchronously; recurring worker creates deduped occurrence IDs.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Task DB from also owning the contract and failure behavior of Comment Service.	Call every downstream consumer synchronously. That couples user latency and availability to analytics, notification, indexing, and audit dependencies. Here that simpler choice would couple “Notification fan-out spams watchers” to Task DB.	Costs eventual consistency, schema evolution, replay tooling, idempotent consumers, and lag operations. Earn it when bursts or downstream failure must not block acknowledgment. Measure the latency, saturation, lag, or mismatch at the Activity Log boundary before extracting or scaling it.
Comment Service	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Authenticate workspace actor and load task plus pinned workflow version.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Activity Log from also owning the contract and failure behavior of Search Index.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Two users edit same task version” to Activity Log.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Comment Service boundary before extracting or scaling it.
Search Index	Serves a low-latency, disposable projection with authoritative fallback. In this design it participates in: Validate requested fields/transition against role, current state, and expected version.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Comment Service from also owning the contract and failure behavior of Notification Router.	Read authoritative storage for every request. Simpler initially, but latency and source-of-truth load scale together and a hot key becomes a database incident. Here that simpler choice would couple “Dependency edge creates long cycle” to Comment Service.	Costs invalidation, staleness, stampede protection, and memory. Add or split it only after the workload (Millions tasks · collaborative updates · flexible workflows) proves repeated reads dominate. Measure the latency, saturation, lag, or mismatch at the Search Index boundary before extracting or scaling it.
Notification Router	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: For dependency edge, traverse bounded ancestors or use maintained topological metadata to reject cycle.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Search Index from also owning the contract and failure behavior of Recurring Task Worker.	Keep this behavior inside an adjacent service. Prefer that simpler option until independent scale, ownership, policy, or failure isolation is measurable. Here that simpler choice would couple “Workflow changes while tasks active” to Search Index.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Notification Router boundary before extracting or scaling it.
Recurring Task Worker	Executes idempotent asynchronous work under lease and retry policy. In this design it participates in: Conditionally update task and append immutable activity/outbox in one transaction.	Separates a distinct scale, ownership, policy, or failure boundary. It prevents Notification Router from also owning the contract and failure behavior of Audit / Export.	Perform the work before acknowledging the caller. This gives simpler consistency but unbounded tail latency and fragile retries. Here that simpler choice would couple “Recurring worker retries occurrence” to Notification Router.	Costs leases, checkpoints, retries, DLQs, and lag operations. Separate once execution time or burstiness no longer fits the request deadline. Measure the latency, saturation, lag, or mismatch at the Recurring Task Worker boundary before extracting or scaling it.
Audit / Export	Owns one bounded domain decision, transition, or operational capability. In this design it participates in: Index/search/notify asynchronously; recurring worker creates deduped occurrence IDs.	Proves correctness and supports controlled recovery. It prevents Recurring Task Worker from also owning the contract and failure behavior of operators and repair tooling.	Infer correctness from request logs. Logs do not prove durable business state, detect silent drift, or safely repair ambiguous outcomes. Here that simpler choice would couple “Notification fan-out spams watchers” to Recurring Task Worker.	Costs an interface, deployment, telemetry, ownership, and failure mode. Keep it in-process first; extract when independent scale or reliability pays for the boundary. Measure the latency, saturation, lag, or mismatch at the Audit / Export boundary before extracting or scaling it.

Decision 01

Chosen boundary vs simpler monolith

Represent workflow transitions as policy, not scattered conditionals; validate actor and current version.

A single deployable with one transactional store is the right starting point for a small task management system workload. The proposed boundary becomes justified when represent workflow transitions as policy, not scattered conditionals; validate actor and current version. Separating it contains the named failure “Two users edit same task version” without placing unrelated work on the critical path.

Decision 02

Correctness vs availability

Model dependencies as a DAG and reject cycles before commit.

The design coordinates only where every object transition is legal and atomic at one aggregate boundary. Everywhere else it accepts bounded staleness or asynchronous propagation. The alternative—strong coordination for every projection—simplifies the mental model but increases tail latency and turns partitions into broad write unavailability.

Decision 03

Operational cost and evolution

Append activity events for comments and changes while storing current task state for fast reads.

This choice adds dashboards, ownership, schema compatibility, capacity planning, and recovery runbooks. Start with the minimum topology that supports “For dependency edge, traverse bounded ancestors or use maintained topological metadata to reject cycle.” and extract another service only when measured throughput, blast radius, data lifecycle, or team ownership changes independently.

Why this design: the synchronous path contains only the decisions required to protect every object transition is legal and atomic at one aggregate boundary. Durable projections, notifications, indexing, analytics, and repair are isolated so their load or failure cannot corrupt the acknowledged operation.

Correctness boundary

Represent workflow transitions as policy, not scattered conditionals; validate actor and current version.

Scale boundary

Model dependencies as a DAG and reject cycles before commit.

Operational boundary

Append activity events for comments and changes while storing current task state for fast reads.

↑ top

5. Critical flow and algorithm

Authenticate workspace actor and load task plus pinned workflow version.

Validate requested fields/transition against role, current state, and expected version.

For dependency edge, traverse bounded ancestors or use maintained topological metadata to reject cycle.

Conditionally update task and append immutable activity/outbox in one transaction.

Index/search/notify asynchronously; recurring worker creates deduped occurrence IDs.

Retry-safe mutation skeleton

identity = authenticate(request)
prior = idempotency.get(identity, request.key)
if prior: return prior.result

current = authoritative_store.read(partition_key)
next_state, events = domain.transition(current, request)
authoritative_store.compare_and_set(current.version, next_state)
idempotency.commit(request.key, next_state.result)
outbox.append(events)
return next_state.result

Exactly-once business effect: the network can duplicate requests. Stable identities, conditional state transitions, immutable event IDs, and reconciliation make the user-visible effect happen once.

↑ top

6. Caching, hot keys, and backpressure

Cache policy

Cache immutable or slowly changing reads with versioned keys, TTL jitter, short negative entries, and request coalescing.

Hot partition or tenant

Measure per-key and per-tenant skew. Replicate safe reads, isolate the offender, salt only when ordering permits, and enforce budgets.

Backpressure

Bound queues, buffers, connection pools, and concurrency. Shed low-priority work and scale from lag/oldest-item age rather than CPU alone.

Stampede and retry storms

Use single-flight/coalescing, jittered expiry, bounded retries, exponential backoff, and circuit breakers so one dependency failure does not multiply traffic.

Cache outage rule: never allow every miss to fall through simultaneously. Use local protection, request coalescing, circuit breakers, bounded pools, and controlled fallback.

↑ top

7. Partitioning and consistency

partition = stable_hash(primary_or_aggregate_key) → shard owner
write = conditional_update(expected_version)
read_projection = versioned and rebuildable

Strong boundary

every object transition is legal and atomic at one aggregate boundary. Use a uniqueness constraint, serializable/conditional write, expected version, or fencing token at this boundary.

Eventual boundary

Analytics, notifications, search, read models, and operational dashboards may lag when freshness is observable and replay exists.

Operation	Consistency	Reason
Authoritative mutation	Conditional / serializable	Protect uniqueness, ownership, money, inventory, order, or legal state transition.
Read after own write	Primary, session token, or cache warm	The caller must observe the result it just committed.
Ordinary read projection	Bounded stale where safe	Replicas and caches improve latency when version/freshness is visible.
Analytics and operations	Eventual + replay	Freshness is less important than isolating the online path.

Route every mutation for one aggregate to one owner/partition epoch.
Use cursors rather than offsets for changing ordered collections.
Retain tombstones until replication and repair windows close.
Move shard ownership through versioned maps and dual-read verification.

↑ top

8. Failure drills and recovery

Failure	Runtime behavior	Recovery proof
Two users edit same task version	Resolve at source of truth with uniqueness, expected version, lease generation, or monotonic cursor.	Reconciliation returns zero invariant gaps; lag/replica health and user-visible SLO return to baseline.
Dependency edge creates long cycle	Stop unsafe progress, serve only explicitly safe degraded behavior, and recover from durable state.	Reconciliation returns zero invariant gaps; lag/replica health and user-visible SLO return to baseline.
Workflow changes while tasks active	Stop unsafe progress, serve only explicitly safe degraded behavior, and recover from durable state.	Reconciliation returns zero invariant gaps; lag/replica health and user-visible SLO return to baseline.
Recurring worker retries occurrence	Stop unsafe progress, serve only explicitly safe degraded behavior, and recover from durable state.	Reconciliation returns zero invariant gaps; lag/replica health and user-visible SLO return to baseline.
Notification fan-out spams watchers	Stop unsafe progress, serve only explicitly safe degraded behavior, and recover from durable state.	Reconciliation returns zero invariant gaps; lag/replica health and user-visible SLO return to baseline.

Recovery checkpoint

# Recovery checkpoint
scenario: Two users edit same task version
operation_id: op_01J...
aggregate_key: task-management_123
last_durable_version: 18
projection_checkpoint: partition-07@offset-482901
retry_policy: same_identity / bounded_backoff
reconciliation_status: pending
owner: Audit / Export

Every dependency needs a timeout, retry budget, circuit policy, and explicit fail-open, fail-closed, stale, or read-only mode. “Highly available” is incomplete until degraded behavior is named.

↑ top

9. Security, regions, and observability

Security and abuse

Authenticate at ingress and authorize the exact resource/tenant on every operation.
Encrypt transport and durable data; tokenize or isolate sensitive material.
Rate-limit by tenant, actor, resource, and network; detect enumeration and anomalous fan-out.
Redact secrets and personal data before logs or analytical storage.
Audit privileged mutations, support access, policy changes, and forced recovery.

Signals that prove correctness

User-visible success rate and p50/p95/p99 latency.
Timeouts, circuit state, saturation, and replica health by dependency.
Queue lag, oldest-item age, retries, and dead-letter growth.
Conflict, duplicate-suppression, and reconciliation mismatch counts.
Business drill: Two users edit same task version — alert before the user-visible invariant is violated.

Regional evolution

Begin multi-zone with tested failover, backups, and reconciliation.
Add global stateless ingress and regional read projections.
Keep one write owner per aggregate or partition where coordination is expensive.
Move ownership with epochs/fencing; avoid silent simultaneous writers.
Use expand/contract schemas, canaries, shadow reads, and reversible cutovers.

↑ top

10. Interviewer follow-ups

How do custom workflows work?

Represent workflow transitions as policy, not scattered conditionals; validate actor and current version. Walk the concrete lifecycle step “Authenticate workspace actor and load task plus pinned workflow version.” Then test it against “Two users edit same task version”. State the retry identity, durable checkpoint, recovery signal, and cost of the alternative.

How do recurring tasks work?

Model dependencies as a DAG and reject cycles before commit. Walk the concrete lifecycle step “Validate requested fields/transition against role, current state, and expected version.” Then test it against “Dependency edge creates long cycle”. State the retry identity, durable checkpoint, recovery signal, and cost of the alternative.

How do you detect dependency cycles?

Append activity events for comments and changes while storing current task state for fast reads. Walk the concrete lifecycle step “For dependency edge, traverse bounded ancestors or use maintained topological metadata to reject cycle.” Then test it against “Workflow changes while tasks active”. State the retry identity, durable checkpoint, recovery signal, and cost of the alternative.

How are concurrent edits merged?

Represent workflow transitions as policy, not scattered conditionals; validate actor and current version. Walk the concrete lifecycle step “Conditionally update task and append immutable activity/outbox in one transaction.” Then test it against “Recurring worker retries occurrence”. State the retry identity, durable checkpoint, recovery signal, and cost of the alternative.

How do notifications avoid spam?

Model dependencies as a DAG and reject cycles before commit. Walk the concrete lifecycle step “Index/search/notify asynchronously; recurring worker creates deduped occurrence IDs.” Then test it against “Notification fan-out spams watchers”. State the retry identity, durable checkpoint, recovery signal, and cost of the alternative.

Answer pattern: state the invariant, choose a mechanism, walk one failure, name the recovery signal, and explain the cost of the alternative.

↑ top

11. How to present this in 45 minutes

Time	What to cover
0–5 min	Clarify scope, workload, SLOs, and the correctness invariant.
5–10 min	Estimate throughput/storage and define concrete APIs and records.
10–20 min	Draw online, durable-write, and asynchronous/repair paths.
20–30 min	Explain the exact lifecycle, partition key, and concurrency control.
30–38 min	Discuss caching, hot keys, replication, and backpressure.
38–43 min	Run failure drills, security, observability, and regional evolution.
43–45 min	Summarize the five most important choices and trade-offs.

Final decision summary

Invariant	every object transition is legal and atomic at one aggregate boundary.
Partitioning	Stable aggregate/key hash with versioned ownership and measured hot-key isolation.
Commit	Expected version or uniqueness at the authoritative state boundary.
Async work	Durable outbox/log, idempotent consumers, checkpoints, and replay.
Recovery	Same operation identity, durable truth lookup, and business reconciliation.

Closing summary

CLOSING “The design protects every object transition is legal and atomic at one aggregate boundary. The online path stays bounded, authoritative state is versioned and partitioned, and asynchronous work is replayable and observable.”

↑ top

Web / Mobile

Task API

Auth / Workspace

Task Aggregate

Complete System Design Tutorial

1. Requirements and scope

Functional requirements

Non-functional requirements

2. Capacity assumptions

3. API and data model

Authoritative records and indexes

Command and event envelopes

4. Why this architecture and what it costs

Chosen boundary vs simpler monolith

Correctness vs availability

Operational cost and evolution

5. Critical flow and algorithm

Retry-safe mutation skeleton

6. Caching, hot keys, and backpressure

7. Partitioning and consistency

Strong boundary

Eventual boundary

8. Failure drills and recovery

Recovery checkpoint

9. Security, regions, and observability

Security and abuse

Signals that prove correctness

Regional evolution

10. Interviewer follow-ups

11. How to present this in 45 minutes

Final decision summary

Closing summary