All Title Author
Keywords Abstract

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

DOI: 10.4236/jcc.2016.44013, PP. 146-159

Keywords: Chronically Evaluated Highest Instantaneous Priority Next, CEHIPN, Priority Scheduling, Preemptive Scheduling, Processor Scheduling, Starvation

Full-Text   Cite this paper   Add to My Lib


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.


[1]  Stallings, W. (2009) Operating Systems (Vol. 6). Pearson Education, New York, 72-73.
[2]  Nutt, G. (2003) Operating Systems (Vol. 3). Pearson, New York, 204-212.
[3]  Silberschatz, A., Galvin, P.B. and Gagne, G. (2001) Operating System Concepts (Vol. 6). Wiley, Hoboken, 151-184.
[4]  Deitel, H.M. (1984) An Introduction to Operating Systems (Vol. 1). Addison-Wesley, Reading, MA, 248-259.
[5]  Oyetunji, E.O. and Oluleye, A.E. (2009) Performance Assessment of Some CPU Scheduling Algorithms. Research Journal of Information and Technology, 1, 22-26.
[6]  Banerjee, P., Banerjee, P. and Dhal, S.S. (2012) Comparative Performance Analysis of Mid Average Round Robin Scheduling (MARR) Using Dynamic Time Quantum with Round Robin Scheduling Algorithm Having Static Time Quatum. International Journal of Electronics and Computer Science Engineering, 1, 2026-2034.
[7]  Hiranwal, S. and Roy, K.C. (2011) Adaptive Round Robin Scheduling Using Shortest Burst Approach, Based on Smart Time Slice. International Journal of Computer Science and Communication, 2, 319-323.
[8]  Negi, S. (2013) An Improved Round Robin Approach Using Dynamic Time Quantum for Improving Average Waiting Time. International Journal of Computer Applications, 69, 12-16.
[9]  Singh, P., Pandey, A. and Mekonnen, A. (2015) Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP). Journal of Computer and Communications, 3, 40.
[10]  Rajput, I.S. and Gupta, D. (2012) A Priority Based Round Robin CPU Scheduling Algorithm for Real Time Systems. International Journal of Innovations in Engineering and Technology, 1, 1-11.
[11]  Tanenbaum, A.S. and Woodhull, A.S. (1996) Operating Systems Design and Implementation (Vol. 2). Pearson, New York, 82-88.
[12]  Shahzad, B. and Afzal, M.T. (2006) Optimized Solution to Shortest Job First by Eliminating the Starvation. In Proceedings of the 6th Jordanian Inr. Electrical and Electronics Eng. Conference (JIEEEC 2006), Jordan.
[13]  Yadav, R.K., Mishra, A.K., Prakash, N. and Sharma, H. (2010) An Improved Round Robin Scheduling Algorithm for CPU Scheduling. International Journal on Computer Science and Engineering, 2, 1064-1066.
[14]  Singh, A., Goyal, P. and Batra, S. (2010) An Optimized Round Robin Scheduling Algorithm for CPU Scheduling. International Journal on Computer Science and Engineering, 2, 2383-2385.
[15]  Noon, A., Kalakech, A. and Kadry, S. (2011) A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average. International Journal of Computer Science Issues, 8, 224-229.
[16]  Behera, H.S., Swain, B.K., Parida, A.K. and Sahu, G. (2012) A New Proposed Round Robin with Highest Response Ratio Next (RRHRRN) Scheduling Algorithm for Soft Real Time Systems. International Journal of Engineering and Advanced Technology, 37, 200-206.
[17]  Helmy, T. and Dekdouk, A. (2007) Burst Round Robin as a Proportional-Share Scheduling Algorithm. Proceedings of the 4th IEEE-GCC Conference on Towards Techno-Industrial Innovations, Bahrain, November 2007, 424-428.
[18]  Mohanty, R., Behera, H.S., Patwari, K. and Dash, M. (2010) Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm. Proceedings of International Symposium on Computer Engineering & Technology (ISCET), 17, 126-137.
[19]  Mohanty, R., Behera, H.S., Patwari, K., Dash, M. and Prasanna, M.L. (2011) Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems. International Journal of Advanced Computer Science and Applications, 2, 46-50.
[20]  Negi, S. and Kalra, P. (2014) A Comparative Performance Analysis of Various Variants of Round Robin Scheduling Algorithm. International Journal of Information & Computation Technology, 4, 765-772.


comments powered by Disqus

Contact Us


微信:OALib Journal