Comparative Performance Analysis of Optimized Performance Round Robin Scheduling Algorithm(OPRR) with AN Based Round Robin Scheduling Algorithm using Dynamic Time Quantum in Real Time System with Arrival Time

Authors

  • Banerjee P Department of Computer Science and Engineering, Cambridge Institute of Technology, Ranchi
  • Kumari A Department of Computer Science and Engineering, Cambridge Institute of Technology, Ranchi
  • Jha P Department of Computer Science and Engineering, Cambridge Institute of Technology, Ranchi

Keywords:

Operating System, Round Robin, Best Performance Round Robin, Turnaround time, Waiting time, Context Switch

Abstract

Round Robin is the most oldest and widely used scheduling algorithm but it has certain limitation because of static time quantum. Time quantum must be large so that context switching becomes reduces and it also effect the response time .So, in this paper we proposed a new algorithm called Optimized Performance Round Robin(OPRR) in which we focused on dynamic time quantum which give result as a very less context switching as well as average waiting time and average turnaround time. It also reduces the overhead of the CPU by adjusting the time quantum according to the highest burst time of the processes in the ready queue.

References

“Silberschatz, A., P.B. Galvin and G. Gagne, 2008”Operating Systems Concepts. 7th Edn., John Wiley and Sons, USA, ISBN: 13: 978-0471694663 , pp: 944.

Pallab banerjee, probal banerjee, shweta sonali dhal, “ Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum ”,IJITEE, ISSN: 2278-3075, Volume-1, Issue-3, August 2012.

“Tanebaun, A.S., 2008” Modern Operating Systems. 3rd Edn., Prentice Hall, ISBN: 13:9780136006633, pp: 1104.

Pallab banerjee, probal banerjee, shweta sonali dhal, “Performance Evaluation of a New Proposed Average Mid Max Round Robin (AMMRR) Scheduling Algorithm with Round Robin Scheduling Algorithm”,IJARCSSE,ISSN:2277-128X, Volume-2, Issue-8, August 2012.

Pallab banerjee, probal banerjee, shweta sonali dhal,“Comparative Performance Analysis of Even Odd Round Robin Scheduling Algorithm (EORR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum” IJARCSSE,ISSN: 2277-128X,Volume-2, Issue-9, August 2012.

Pallab banerjee, probal banerjee, shweta sonali dhal,“Improved High Performance Round Robin Scheduling Algorithm(HPRR)using Dynamic Time Quantum” International Journal of Computer Information System,ISSN: 2277-128X,Volume-5, No-3, 2012.

Sarojhiranwal and D.r. K.C.Roy“Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice”.volume 2,No. 2,July-Dec 2011,pp. 319-32.

Pallab banerjee, probal banerjee, shweta sonali dhal, “Comparative Performance Analysis of Mid Average Round Robin Scheduling Algorithm (MARR) using Dynamic TimeQuantum with Round Robin Scheduling Algorithm having static Time Quantum”,IJECSE,ISSN: 2277- 1956, Volume-1,Issue-4, August 2012.

H. S. Behera, R. Mohanty, and D. Nayak, “A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis,” vol. 5,no. 5, pp. 10-15, August 2010.

Sanjay Kumar Panda and Saurav Kumar Bhoi, “An Effective Round Robin Algorithm using Min-Max Dispersion Measure” ISSN : 0975-3397 ,Vol. 4 No. 01, January 2012.

Tarek Helmy, Abdelkader Dekdouk “ Burst Round Robin: As a Proportional-Share Scheduling Algorithm”, IEEE Proceedings of the fourth IEEE-GCC Conference on towards Techno-Industrial Innovations, pp. 424-428, 11-14 November,2007.

Yaashuwanth .C & R. Ramesh “Inteligent time slice for round robin in real time operating system”, IJRRAS 2 (2), February 2010.

R. J. Matarneh, “ Seif-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Proceses ”, American Journal of Applied Sciences 6 (10),pp. 1831-1837, 2009.

H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu and Sourav Kumar Bhoi. “Comparative performance analysis of multi-dynamic time quantum round robin (mdtqrr) algorithm with arrival time”, ISSN : 0976-5166, Vol. 2, No. 2,Apr-May2011,pp.262-271.

Pallab banerjee ,Prof Dr L.N.Padhy. “Comparative analysis of Maximum performance round robin(MPRR) by Dynamic Time Quantum with static time quantum”,ISSN:2277-128X,pg.372-377Vol-4,Issue-11,Nov-2014

Pallab banerjee,Talat Zabin,Shweta Kumari,Pushpa Kumari “Comparative performance analysis of best performance of round robin scheduling algorithm(BPRR) using Dynamic Time quantum with priority based round robin(PBRR) CPU Scheduling algorithm in Real Time System”.ISSN:2277-1956,Vol-4,Number-2, pg. 151-159,May 2015.

R.Nallakumar ,Dr.N.Sengottaiyan ,S.Nithya “A Servey of Task Scheduling Methods in Cloud Computing”IJCSE,ISSN:2347-2693,Volume-2,Issue-10 ,2014

Abbas Noon,Ali Kalakech,Seifedine Kadry“A New Round Robin Scheduling Algorithm for Operating Systms: Dynamic Quantum Using Mean Average”IJCSI,ISSN:1694-0814,Vol-8,Issue-3,No-1,May-2011

Downloads

Published

2015-05-30

How to Cite

[1]
P. Banerjee, A. Kumari, and P. Jha, “Comparative Performance Analysis of Optimized Performance Round Robin Scheduling Algorithm(OPRR) with AN Based Round Robin Scheduling Algorithm using Dynamic Time Quantum in Real Time System with Arrival Time”, Int. J. Comp. Sci. Eng., vol. 3, no. 5, pp. 309–316, May 2015.

Issue

Vol. 3 No. 5 (2015): IJCSE May Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.