Linux内核完全公平调度器改进的研究  

Research on improving Linux completely fair scheduler

作　　者：朱永华[1] 沈熠[2] 刘玲[1] 

机构地区：[1]上海大学计算中心,上海200444 [2]上海大学计算机工程与科学学院,上海200444

出　　处：《计算机工程与应用》2014年第21期59-62,共4页Computer Engineering and Applications

基　　金：国家高技术研究发展计划(863)重点项目(No.2009AA012201)

摘　　要：针对现有Linux内核使用的完全公平调度器无法有效解决贪婪线程问题,提出一种改进的调度算法和该算法的高效实现,该算法通过惩罚贪婪线程的方法提升调度器的公平性。实验结果证实,贪婪线程问题存在;改进后的调度算法有效减少了存在贪婪线程问题的程序对降低系统整体性能的影响。Fairness issue of the Completely Fair Scheduler（CFS）used in Linux kernel comes up due to the fact that pro-grams 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.

关 键 词：LINUX内核 任务调度 完全公平调度 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]