Completely Fair Scheduler (CFS)

Giriş
Açıklaması şöyle

the Completely Fair Scheduler (CFS). Integrated into Linux 2.6.23., CFS performs the following duties:

- CFS ensures that the CPU is allocated equitably.
- If the CPU access time provided to different tasks isn’t balanced, CFS gives the shortchanged tasks the time they need to execute.
- CFS keeps track of the balance between tasks by maintaining CPU access times in the virtual runtime. The smaller a task’s virtual runtime, the greater its recognized CPU need.
- CFS uses “sleeper fairness” to make sure even tasks that aren’t currently running will still receive their fair share of CPU when required.
-CFS doesn’t directly use priorities.

CFS bu  işleri gerçekleştirmek için arka tarafta bir tane "Red Black Tree" kullanır. Açıklaması şöyle

CFS uses nanosecond granularity accounting and does not rely on any jiffies or other HZ detail. Thus the CFS scheduler has no notion of “timeslices” in the way the previous scheduler had, and has no heuristics whatsoever.