完全公平调度器（Completely Fair Scheduler）.doc

完全公平调度器（Completely Fair Scheduler） Completely fair scheduler (CFS) design idea is: an ideal and accurate multi task CPU model in a real hardware. The ideal CPU model runs at 100% load, running in parallel for each task in the exact equal speed, each task runs at the speed of 1/n, that is the ideal CPU n tasks, each task speed is CPU the entire load 1/n. Because of the real hardware, can only run a task, it must introduce virtual running time (virtual runtime) the concept of virtual running time for the next time a task execution in the ideal model of CPU (timeslice). In fact, the virtual running time of a task is taking into account the actual running time of the total number of running tasks. So, a bunch of running for a period of time delta, then their vrumtime will follow the above formula. Obviously, the largest priority increment process vrumtime... 2 details of the operation CFS is through tracking the vruntime for task scheduling. It always choose the minimum vruntime process to run. 3 red black tree. The data structure used in tree kernel is a lot, but I dont understand. Which brother Saul to literacy hrtimer also used the red-black-tree. The process of using vruntime rb-tree to store. Some 4 feature CFS has no time-slice concept.o CFS (1), no obvious to use it in a sneaky way to use. I translated a few paragraphs I say this. The document interface estimation is used to adjust the minimum size. For the desktop and server two different scheduling. The latter may not want frequent scheduling, a waste of time. The former is hope to -- from the widow and uneven also In CFS, the running time of each task by virtual p-se.vruntime (NS units) tracking. In an ideal hardware, at any time, all the tasks will have the same p-se.vruntime value, the task will be executed at the same time, and no task will be the ideal time to share from CPU into a load imbalance. The task of the CFS selection logic based on the p-se.vruntime value, and it will always try to run with the m