Measuring operating systems' task fairness for cpu resource scheduling

Ian K.T. Tan, C. S. Wong, J. W. Lam, Rosalind D. Kumari

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)


With more software architects and developers coding for parallel execution, how fair tasks are scheduled by the operating system becomes an important criteria. Software code may comprise of small sections that are parallelizable and every possible performance gain should be exploited by the software developer. In order to exploit fine grain parallelism, software developers need the confidence that the operating system is able to fairly schedule their parallelized tasks. Most schedulers attempt to allocate resources to tasks fairly based on the task's priority. However, this fairness cannot be achieved in an ideal manner and hence it is only an approximate fairness. Actual experience with various schedulers varies and currently, there is no tool to qualitatively measure and compare them. This paper presents a tool to measure fairness and provides an intuitive representation of the results through the comparison of two different kernel schedulers of the open source Linux operating system.

Original languageEnglish
Title of host publicationProceedings of the 4th IASTED International Conference on Advances in Computer Science and Technology, ACST 2008
Number of pages6
Publication statusPublished - 2008
Externally publishedYes
EventIASTED International Conference on Advances in Computer Science and Technology 2008 - Langkawi, Malaysia
Duration: 2 Apr 20084 Apr 2008 (Proceedings)


ConferenceIASTED International Conference on Advances in Computer Science and Technology 2008
Abbreviated titleACST 2008
Internet address


  • Benchmarking
  • Fairness measurement
  • Operating system scheduler
  • Parallel systems

Cite this