DOI: https://doi.org/10.15368/theses.2012.89
Available at: https://digitalcommons.calpoly.edu/theses/772
Date of Award
6-2012
Degree Name
MS in Computer Science
Department/Program
Computer Science
Advisor
Michael L. Haungs
Abstract
This paper presents an implementation of a lottery scheduler, presented from design through debugging to performance testing. Desirable characteristics of a general purpose scheduler include low overhead, good overall system performance for a variety of process types, and fair scheduling behavior. Testing is performed, along with an analysis of the results measuring the lottery scheduler against these characteristics. Lottery scheduling is found to provide better than average control over the relative execution rates of processes. The results show that lottery scheduling functions as a good mechanism for sharing the CPU fairly between users that are competing for the resource. While the lottery scheduler proves to have several interesting properties, overall system performance suffers and does not compare favorably with the balanced performance afforded by the standard Linux kernel’s scheduler.