Part 1 of 7 · 1 min read
Why this page comes sixth
In this module you will
- Compare one shared ready queue with one queue per processor.
- Explain load balancing, migration and soft affinity, with measured evidence.
- Say what a real-time system promises, and the difference between hard and soft deadlines.
- Check whether a set of periodic tasks can meet its deadlines under rate-monotonic scheduling.
- Trace earliest deadline first and compare it with rate-monotonic scheduling.
Pages 1 to 5 assumed one processor. Level 2, page 6 showed that machines have several, and that threads on different processors can run at the same moment. This page adds the two extensions that real systems need: scheduling on several processors, and scheduling for tasks that must finish by a time limit. The sources are "Operating Systems: Three Easy Pieces" (OSTEP), chapter 10, "Operating System Concepts" (OSC), chapter 5, and "Modern Operating Systems" (MOS), chapters 2 and 8. The measurements come from a two-processor Linux machine.
About this example About this example
Real: The facts, definitions and algorithms on this page come from the books named in the text. No program on this page was timed.
Scripted: Numbers marked "made up to show the idea" were chosen for the examples.
Not real: The page simplifies real systems. Actual kernels add more cases, limits and tuning than a short page can show.