Tasks, Threads, and Processes for the rest of us
summary
Explains concrete differences: a process owns separate memory spaces while tasks/threads share address space so communication is cheaper but races require synchronization; the OS scheduler uses a round-robin scheduler with context switches around 5 ms quantum, causing measurable overhead when many threads are runnable; Chrome’s multi-process tab model is presented as an example that trades IPC cost for isolation to avoid whole‑browser crashes; compares FCFS, shortest‑job‑first and preemptive scheduling with observable latency impacts.
AI-written summary · about
chapters (7)
- 0:00Introduction and welcome
- 1:32Programs processes and threads
- 4:32Process memory space
- 8:21CPU cores and parallelism
- 10:49Task scheduling basics
- 13:18Process communication overhead
- 14:23Browser process isolation
related talks
29mConcurrency and Parallelism From The Ground Up
37mEverything you wanted to know about threads but were afraid to ask
39mLet's talk concurrency
51mFrom Linux Threads To ForkJoinPool
01h 41mThreads Considered Harmful
01h 04mAtomics, Locks, and Tasks (part 2 of 2)
58mMultithreading with Qt
39mCoroutines vs. Threads: The True Cost of a Context Switch
