Varying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP)

Andargachew  Mekonnen; Amit  Pandey; Pawan  Singh

doi:10.4236/jcc.2015.34005

Pawan Singh^*, Amit Pandey, Andargachew Mekonnen

Abstract: In present era, one of the most important resources of computer machine is CPU. With the increasing number of application, there exist a large number of processes in the computer system at the same time. Many processes in system simultaneously raise a challenging circumstance of managing the CPU in such a manner that the CPU utilization and processes execution gets optimal performance. The world is still waiting for most efficient algorithm which remains a challenging issue. In this manuscript, we have proposed a new algorithm Progressively Varying Response Ratio Priority a preemptive CPU scheduling algorithm based on the Priority Algorithm and Shortest Remaining Time First. In this scheduling algorithm, the priority is been calculated and the processes with high priority get CPU first or next. For new process, the priority of it becomes equal to inverse of burst time and for the old processes the priority calculation takes place as a ratio of waiting time and remaining burst time. The objective is to get all the processes executed with minimum average waiting time and no starvation. Experiment and comparison show that the VRRP outperforms other CPU scheduling algorithms. It gives better evaluation results in the form of scheduling criteria. We have used the deterministic model to compare the different algorithms.

Keywords: Operating System, CPU Scheduling, Priority Scheduling, Turnaround Time, Waiting Time, Response Time, Context Switching

Cite this paper: 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-51. doi: 10.4236/jcc.2015.34005.

References

[1] Stallings, W. (2006) Operating Systems: Internals and Design Principles. 5th Edition, Prentice-Hall, Upper Saddle River.

[2] Silberschatz, A., Peterson, J.L. and Galvin, B. (2006) Operating System Concepts. 7th Edition, Addison Wesley, Boston.

[3] Oyetunji, E.O. and Oluleye, A.E. (2009) Performance Assessment of Some CPU Scheduling Algorithms. Research Journal of Information Technology, 1, 22-26.
http://maxwellsci.com/jp/abstract.php?jid=RJIT&no=9&abs=5

[4] 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, 8, 319-323.
http://www.csjournals.com/IJCSC/IjcscVol2-2.html

[5] 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.
http://www.ijcsi.org/contents.php?volume=8&&issue=3

[6] Rajput, S.I. 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.
http://ijiet.com/issues/volume-1-issue-3-october-2012/

[7] Singh, A., Goyal, P. and Batra, S. (2010) An Optimized Round Robin Scheduling Algorithm for CPU Scheduling. International Journal on Computer Science and Engineering, 31, 2383-2385.
http://www.enggjournals.com/ijcse/issue.html?issue=20100207

[8] Behera, H.S., Swin, B.K., Prinda, 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.
http://www.ijeat.org/v1i3.php

[9] Tanenbaum, A.S. and Woodfhull, A.S. (2005) Operating Systems Design and Implementation. 2nd Edition, Prentice-Hall, Upper Saddle River.

[10] Shahzad, B. and Afzal, M.T. (2006) Optimized Solution to Shortest Job First by Eliminating the Starvation. Proceedings of the 6th Jordanian International Electrical & Electronic Engineering Conference (JIEEEC 2006), Jordan, 14-16 March 2006.

[11] 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, 24, 1064-1066.
http://www.enggjournals.com/ijcse/issue.html?issue=20100204

[12] Kurzban, S.A., Heines, T.S. and Sayers, A.P. (1986) Operating Systems Principles. 2nd Edition, CBS Publications, New York, 370-371.

[13] Jansen, P.A. (1985) Operating Systems/Structures and Mechanisms. Academic Press, Waltham, 77-80.