摘要
Linux调度系统的调度算法几经改进,表现出优异的性能,特别是Linux最新的CFS调度算法。它的设计目的是使进程更加公平地共享处理器资源。在分析Linux 2.6.28内核代码的基础上详细阐述了CFS调度算法的工作流程和主要特性,并从算法分析和Hackbench测试两个方面对O(1)和CFS调度算法的性能进行了对比。
With the improvement of scheduling algorithm, Linux scheduler shows excellent performance, especially the latest CFS scheduling algorithm. The aim of CFS scheduling algorithm is to share the processor more fairly. This pa- per illustrates the workflow and main characteristics of CFS based on the Linux 2.6.28 kernel source code. Finally, the performance comparison of O（1） and CFS are carried on from both the algorithm and the Hackbech test.
出处
《成都信息工程学院学报》
2010年第1期18-21,共4页
Journal of Chengdu University of Information Technology
