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
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.
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. http://dx.doi.org/10.5120/11909-8007
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. http://dx.doi.org/10.4236/jcc.2015.34005
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.
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.
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.
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.
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.
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. http://dx.doi.org/10.14569/IJACSA.2011.020209