Fairness and interactive performance of O(1) and CFS Linux kernel schedulers
Fairness and interactive performance of O(1) and CFS Linux kernel schedulers
复制标题
O(1) 和 CFS Linux 内核调度程序的公平性和交互性能
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
W. Fun
中科院分区：
文献类型：
--
作者：
C. S. Wong;I. Tan;R. D. Kumari;J. W. Lam;W. Fun
操作系统（OS）调度程序的设计旨在将其资源适当地分配给所有应用程序。在本文中，我们介绍了两个Linux的调度技术：O（1）和完全公平的调度（CFS）。CFS是Linux内核调度程序，它取代了2.6.23内核中的O（1）调度程序。CFS的设计目标是在不牺牲交互性能的情况下，在执行任务之间提供公平的CPU资源分配。在任务之间分配CPU资源时实现良好公平性的能力对于防止饥饿是重要的。然而，这些设计目标从来没有被科学地评估，尽管事实上，有许多传统的操作系统基准测试，是面向测量系统的吞吐量方面的性能。因此，我们科学地评估CFS的设计目标，通过实证评估。我们通过使用公平性和交互性基准来衡量公平性和交互性性能。为了提供一个有意义的结果表示，O（1）和CFS内核编译器的开源Linux操作系统的比较。我们的经验表明，CFS确实实现了其设计目标。
The design of an Operating System (OS) scheduler is meant to allocate its resources appropriately to all applications. In this paper, we present the scheduling techniques used by two Linux schedulers: O(1) and Completely Fair Scheduler (CFS). CFS is the Linux kernel scheduler that replaces the O(1) scheduler in the 2.6.23 kernel. The design goals of CFS are to provide fair CPU resource allocation among executing tasks without sacrificing interactive performance. The ability to achieve good fairness in distributing CPU resource among tasks is important to prevent starvation. However, these design goals have never been scientifically evaluated despite the fact that there are many conventional operating system benchmarks that are geared towards measuring systems performance in terms of throughput. We therefore scientifically evaluate the design goals of CFS by empirical evaluation. We measure the fairness and interactivity performance by using fairness and interactivity benchmarks. To provide a meaningful representation of results, comparisons of O(1) and CFS kernel schedulers of the open source Linux OS are used. Our experience indicates the CFS does achieve its design goals.