Summary
Explore proportional-share CPU scheduling methods including lottery, stride, and the Completely Fair Scheduler. Understand their advantages, limitations, and applications in virtualization and real-world systems.
We'll cover the following...
We'll cover the following...
We have introduced the concept of proportional-share scheduling and briefly discussed three approaches: lottery scheduling, stride scheduling, and the Completely Fair Scheduler (CFS) of Linux. Lottery uses randomness in a clever way to achieve proportional share; stride does so deterministically. CFS, the only “real” scheduler discussed in this chapter, is a bit like weighted round-robin with dynamic time slices, but built to scale and perform well under load; to our knowledge, it is ...