Journal of Computer and Communications

Volume 4, Issue 4 (April 2016)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.24  Citations  

Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling

HTML  XML Download Download as PDF (Size: 922KB)  PP. 146-159  
DOI: 10.4236/jcc.2016.44013    1,800 Downloads   2,600 Views  Citations

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.

Share and Cite:

Pandey, A. , Singh, P. , Gebreegziabher, N. and Kemal, A. (2016) Chronically Evaluated Highest Instantaneous Priority Next: A Novel Algorithm for Processor Scheduling. Journal of Computer and Communications, 4, 146-159. doi: 10.4236/jcc.2016.44013.

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.