Abstract: Fairness issue of the Completely Fair Scheduler （CFS） used in Linux kernel comes up due to the fact that programs with higher number of threads are favored by the scheduler, which are based on the number of thread in the system. A novel algorithm as well as its implementation through optimized procedure is proposed as a solution to achieve better fairness by punishing greedy-threaded programs. Several tests are conducted to illustrate fairness issue and to examine the effect of the proposed algorithm.

Key words: Linux kernel, process scheduling, complete fair scheduler

摘要： 针对现有Linux内核使用的完全公平调度器无法有效解决贪婪线程问题，提出一种改进的调度算法和该算法的高效实现，该算法通过惩罚贪婪线程的方法提升调度器的公平性。实验结果证实，贪婪线程问题存在；改进后的调度算法有效减少了存在贪婪线程问题的程序对降低系统整体性能的影响。

关键词: Linux内核, 任务调度, 完全公平调度