An Introduction to Schedulers
summary
Schedulers are presented as concrete, repeatable systems: a queue a lock and a selection algorithm that implement concrete steps (schedule, allocate, bind). Examples include Linux CPU scheduler evolution to the completely fair scheduler, GOV.UK surviving a 200,000 simultaneous registrations peak, postgress autovacuum workers, container schedulers (kubernetes and Docker swarm) whose Go interfaces implement bin‑packing placement, and network emulation via tc netem 500ms delay. Commands shown: ps, nice, chrt, tc; designs are implemented and debuggable, not just conceptual.
AI-written summary · about
chapters (10)
- 0:00Introduction to schedulers
- 3:50Defining scheduling stages
- 5:28Common scheduling problems
- 10:04Kernel CPU schedulers
- 18:37Networking schedulers
- 21:06Database automation
- 22:27Container scheduling
- 25:51Real-world scheduling
- 28:42Trusting machines versus humans
- 31:23Q&A session
related talks
39mIntro: Scheduling SIG
34mPatterns for building Highly Available Cluster Schedulers
34mKubernetes Scheduling Features or How Can I Make the System Do What I Want?
30mSIG Scheduling Intro & Updates
39mSIG-Scheduling Deep Dive
36mDeep Dive: SIG Scheduling
36mRise of the Machines [B]
25mSIG Scheduling Intro and Deep Dive
