Systems Foundations · advanced
Concurrency Design
Thread-safety, locks, producer-consumer.
Mental model
Concurrency bugs are usually not "add more locks." They are about having a clear discipline for which locks you take, in what order, and for how long. Often the cheapest fix is a single database transaction or a single-writer design.
How to study Concurrency Design
Begin by restating the mental model in your own words, then connect it to a concrete system you have built or operated. Name the mechanism, the constraint it addresses, and the trade-off it introduces. Use Concurrency (Wikipedia) to check details, but close the source before writing your explanation. Retrieval is the learning step; rereading is only preparation.
Next, compare Concurrency Design with State Machines. Ask what changes in correctness, latency, resource use, operability, and failure recovery. Complete Concurrent bank transfers and preserve the command, input, output, and one failed attempt as evidence. Finish by explaining the idea without jargon to someone who has not studied the track.
Proof of understanding
- Explain the mechanism from first principles and identify the state it reads or changes.
- Give one situation where the concept is the right choice and one where it is not.
- Predict a realistic failure mode before running the drill, then compare the prediction with evidence.
- Connect the result to a roadmap or build artifact instead of treating the concept as isolated trivia.
Learn from primary sources
- Concurrency (Wikipedia) (doc)
Practice and explain it back
Concurrent bank transfers
Design transfer(from, to, amount) that is safe under concurrent calls. Address deadlock from circular locking, isolation, and what happens if one side fails mid-write.
Expected evidence: Locking order rule + pseudocode for the transfer + how you would test for deadlock.
Open the interactive drill →Review prompts
- Two threads deadlock. What is the discipline that prevents it, and why is adding a lock usually the wrong fix?
Build evidence
Synthesize: Systems Foundations
Build a tiny HTTP/1.1 static-file server on raw TCP sockets without a framework or high-level HTTP server library. Parse requests, serve bounded files, handle partial I/O, inject failures, measure the result, and explain how the operating system, network, memory, concurrency, and storage paths interact.
- Accepts TCP connections, parses a bounded HTTP GET request, serves fixture files, and returns explicit errors for malformed requests, missing files, and path traversal attempts
- Names and implements a concurrency model with connection, request-size, timeout, and resource limits, including correct handling of partial reads and writes
- Injects at least a slow client, malformed request, or interrupted transfer and demonstrates bounded failure and recovery
- Reports a reproducible workload with throughput, p50/p95 latency, peak memory, and open-connection observations
- Explains the loader, process, syscall, buffer, filesystem, TCP, and scheduling path in a concise architecture note