Phase 13 — Concurrent & Parallel Computing
Get atomic, lock-free, async, and GPU all right — with a memory model in your head.
Lessons: 22 · Estimated time: ~28 h 0 min
Phase capstone artifact: A work-stealing scheduler plus a lock-free queue.
#
Lesson
Status
Time
01
Concurrency vs Parallelism — Get This Right
✅
~45 min
02
Race Conditions, Atomicity, Visibility
✅
~60 min
03
Memory Models — Sequential Consistency vs Relaxed
✅
~90 min
04
Locks — Mutex, RW Lock, Spinlock, Ticket Lock
✅
~75 min
05
Condition Variables and Monitors
✅
~75 min
06
Semaphores and the Classics (Producer/Consumer, Dining)
✅
~60 min
07
Atomics, CAS, ABA Problem
✅
~75 min
08
Lock-Free Data Structures — Treiber Stack, MS Queue
✅
~90 min
09
Wait-Free Algorithms and Their Limits
✅
~60 min
10
Software Transactional Memory
✅
~60 min
11
Futures, Promises, async/await
✅
~75 min
12
Reactor and Proactor Patterns — epoll, kqueue, io_uring
✅
~90 min
13
Tokio and the Async Runtime in Rust
✅
~75 min
14
CSP and Go Channels
✅
~60 min
15
The Actor Model — Erlang and Akka principles
✅
~60 min
16
Parallel Patterns — Map, Reduce, Pipeline, Scan
✅
~75 min
17
Work-Stealing Schedulers
✅
~90 min
18
SIMD Programming in Practice
✅
~75 min
19
GPU Programming — CUDA Basics
✅
~90 min
20
GPU Programming — WebGPU / Compute Shaders
✅
~75 min
21
MPI and Distributed-Memory Parallelism
✅
~75 min
22
Phase Capstone — A Work-Stealing Scheduler + Lock-Free Queue
✅
~150 min
Legend: ✅ Complete · 🚧 In Progress · ⬚ Planned
See ../../ROADMAP.md for the full curriculum and prerequisites.
See ../../LESSON_TEMPLATE.md for the shape every lesson follows.