Fairness and interactive performance of O(1) and CFS Linux kernel schedulers

C. S. Wong, I. K. T. Tan, R. D. Kumari, J. W. Lam, W. Fun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

38 Citations (Scopus)


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.

Original languageEnglish
Title of host publication2008 International Symposium on Information Technology
ISBN (Print)9781424423279
Publication statusPublished - 26 Sept 2008
EventInternational Symposium on Information Technology 2008 - Kuala Lumpur, Malaysia
Duration: 26 Aug 200829 Aug 2008


ConferenceInternational Symposium on Information Technology 2008
Abbreviated titleITSim 2008
CityKuala Lumpur

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering


Dive into the research topics of 'Fairness and interactive performance of O(1) and CFS Linux kernel schedulers'. Together they form a unique fingerprint.

Cite this