A SCHEDULING ALGORITHM FOR MINIMIZING THE PENALTY RATIO VARIANCE
A SCHEDULING ALGORITHM FOR MINIMIZING THE PENALTY RATIO VARIANCE
No Thumbnail Available
Date
2015-05
Authors
Vivian, OKPOKO,
Onyinye.
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Scheduling is the technique of deciding which process is given control of a computer resource at
a particular time. Processes are numerous while resources- such as the central processing unit
(CPU), bandwidth and memory among others - are scarce. It therefore becomes necessary for
scheduling to be done. Since there is no optimal scheduling algorithm, an algorithm becomes
suitable based on the scheduling criteria that the operating system is designed to uphold. This
thesis focuses on the development and evaluation of the performance of a CPU scheduling
algorithm that achieves service timeliness by minimizing the penalty ratio variance. The
algorithm inherits properties from the round robin scheduling algorithm. The model was tested
and evaluated for performance alongside the Round Robin algorithm and some modifications of
it, and was found to perform better than these other algorithms on penalty ratio variance
minimization. This therefore implies that the turnaround time of a process can be determined
before time; and can be evaluated to be a multiple of its penalty ratio.
Description
A Thesis submitted to the School of Postgraduate Studies, Ahmadu Bello University, Zaria
In partial fulfilment of the requirements for the Award of
Masters Degree in Computer Science
Keywords
A SCHEDULING,, ALGORITHM,, MINIMIZING,, PENALTY,, RATIO,, VARIANCE.