完全公平调度器（国外英文资料）.docVIP

完全公平调度器（国外英文资料） The idea of a completely fair scheduler (CFS) is to model an ideal, precise multitasking CPU on a real hardware. The ideal model of CPU running under 100% load, in precise equal speed run in parallel for each task, each task running under the 1 / n rate, namely the ideal cpus have n task to run, the speed of each task to the CPU load of 1 / n. Because the real hardware, can only run one task at a time, this is introducing virtual operation time (virtual runtime), the concept of virtual operation time as a task in the ideal of execution on the CPU model under a time slice (timeslice). In fact, the virtual run time of a task takes into account the actual running time of the total run task. So, a bunch of them ran for a period of time, and then their vrumtime follows the formula above. Obviously, the maximum priority process, vrumtime, is the least incremental... 2 operation details CFS does task scheduling by tracking this vruntime. It always chooses the vruntime minimum process to run. 3 the red-black tree. The red black tree is a data structure used in the kernel, but I dont understand. Which brother is also using red black tree in the hrtimer. Here, the vruntime of the process is stored using rb-tree. 4 some feature CFS has no time-slice concept.o (1) there is no obvious use of CFS, which is used furtively. Well talk about that a little later. The interface in the document is estimated to be used to adjust the minimal granularity. Two different scheduling for desktop and server. The latter may not want frequent scheduling and waste time. The former wants to cover everything -- not to have a widow and not to have an equal In CFS, the virtual run time is tracked by the p- se. Vruntime value (ns) for each task. On the ideal hardware, at any time, all the tasks will have the same p - se. Vruntime values, the task will be executed at the same time, and no task is from the CPU share the ideal time to load imbalance. The CFS task selection logic is based