Implementation and Evaluation of Proportional Share Scheduler on Linux Kernel 2.6
Pradeep Kumar Srinivasan · OhioLink ETD Center (Ohio Library and Information Network) · 2008
There is a steady proliferation of Time Sensitive applications, adding more diversity to the regular workload on General Purpose Operating Systems (GPOS).Priority based Scheduling in GPOS are not designed to handle a mix of regular workload and Time Sensitive applications.An Alternative approach to handle this mixed workload is to use Proportional Share Scheduling (PSS).In PSS model, each task receives a share of the resource in proportion to the weight assigned to it.Most of the PSS schemes proposed in the literature assume the existence of an interface, that can translate application requirements in to weights.And some leave the onus of specifying weights to the application on the User/Application Developer.In this thesis, we describe our implementation of Earliest Eligible Virtual Deadline First (EEVDF) based PSS on Linux Kernel.We have designed and developed an Abstract Scheduling Interface (ASI) to our Proportional Share Scheduler.ASI provides an interface to translate resource requirements of tasks in the form of shares to weights for PSS Tasks.