TITLE:
Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling
AUTHORS:
Amit Pandey, Pawan Singh, Nirayo H. Gebreegziabher, Abdella Kemal
KEYWORDS:
Chronically Evaluated Highest Instantaneous Priority Next, CEHIPN, Priority Scheduling, Preemptive Scheduling, Processor Scheduling, Starvation
JOURNAL NAME:
Journal of Computer and Communications,
Vol.4 No.4,
April
27,
2016
ABSTRACT: This paper proposes a novel chronically evaluated highest
instantaneous priority next processor scheduling algorithm. The currently
existing algorithms like first come first serve, shortest job first,
round-robin, shortest remaining time first, highest response ratio next and
varying response ratio priority algorithm have some problems associated with
them. Some of them can lead to endless waiting or starvation and some of them
like round-robin has problem of too many context switches and high waiting time
associated with them. In the proposed algorithm, we have taken care of all such
problems. As the novel algorithm is capable of achieving as good results as
shortest remaining time first algorithm and also it will never lead to
starvation.