Linux Implementation of a New Model for Handling Task Dynamics in Proportional Share Based Scheduling Systems
Rami Al‐Ouran · OhioLink ETD Center (Ohio Library and Information Network) · 2010
Proportional Share Scheduling (PSS) algorithms have two characteristics that make them attractive to be used in a scheduling design: flexibility and fairness.To support time sensitive tasks a new feature should be added to the PSS design which is reservation guarantee.A number of PSS algorithms have been introduced to add that feature.Earliest Eligible Virtual Deadline First (EEVDF) is a PSS based algorithm that succeeded in integrating flexibility and fairness along with reservation guarantee.The main feature of EEVDF is ensuring that the difference between the service time the task should receive in an ideal system and the service time it actually receives is bounded at all times which makes reservation guarantee possible.In this thesis a new model based on the EEVDF algorithm was implemented to dynamically support a mix of applications with different requirements in a seamless manner.These applications include time-sensitive applications, time sensitive applications with added benefit and regular applications.The new model also adds more flexibility to the original EEVDF model especially for handling system dynamics.This new model was implemented as a loadable kernel module which makes debugging and improving the model easier and more efficient.