linux kernel scheduler CFS
How does linux kernel's CFS scheduler schedule all the process within sched_latency_ns time. Is it by traversing though the red black tree or re balancing after every process switch.
Start with the Wikipedia article...
In contrast to the previous O(1) scheduler used in older Linux 2.6 kernels, the CFS scheduler implementation is not based on run queues. Instead, a red-black tree implements a "timeline" of future task execution. Additionally, the scheduler uses nanosecond granularity accounting, the atomic units by which an individual process' share of the CPU was allocated (thus making redundant the previous notion of timeslices). This precise knowledge also means that no specific heuristics are required to determine the interactivity of a process, for example.[2]
这里详细描述CFS和片段源代码。
链接地址: http://www.djcxy.com/p/84814.html上一篇: 内核调度程序有什么好的解释吗？
下一篇: Linux内核调度程序CFS