Mixed Round Robin Scheduling for Real Time Systems

  IJCTT-book-cover
 
International Journal of Computer Trends and Technology (IJCTT)          
 
© 2017 by IJCTT Journal
Volume-49 Number-3
Year of Publication : 2017
Authors : Pallab Banerjee, Biresh Kumar, Probal Banerjee
  10.14445/22312803/IJCTT-V49P130

MLA

Pallab Banerjee, Biresh Kumar, Probal Banerjee "Mixed Round Robin Scheduling for Real Time Systems". International Journal of Computer Trends and Technology (IJCTT) V49(3):189-195, July 2017. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
Round Robin Scheduling algorithm is designed especially for time sharing Operating system and Real Time System .Jobs get the CPU for a fixed time (quantum time or time slice) in Round Robin Scheduling. It is Similar to FCFS (first come first serve scheduling),but with preemption (that is CPU interrupted at regular intervals). Ready queue is treated as a circular buffer. Process may use less than a full time slice. If process is incomplete at the end of time slice, they join in the end of ready queue. The Round Robin Scheduling algorithm has its disadvantages that is its longer average waiting time, higher context switches, higher turnaround time .In this paper a new algorithm is presented called Mixed Round Robin scheduling algorithm .Mixed Round Robin Scheduling is the mix-up of three Scheduling algorithm i.e (MIN-MAX,AVG-MAX and BPRR) .In this scheduling algorithm the main idea is to adjust the time Quantum dynamically so that this algorithm perform better performance than simple Round Robin scheduling algorithm.

References
[1] “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.
[2] 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.
[3] “Tanebaun, A.S., 2008” Modern Operating Systems. 3rd Edn., Prentice Hall, ISBN: 13:9780136006633, pp: 1104.
[4] 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.
[5] 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.
[6] 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.
[7] 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.
[8] 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.
[9] 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.
[10] Sanjay Kumar Panda and Saurav Kumar Bhoi, “An Effective Round Robin Algorithm using Min-Max DispersionMeasure” ISSN : 0975-3397 ,Vol. 4 No. 01, January 2012.
[11] 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.
[12] Yaashuwanth .C & R. Ramesh “Inteligent time slice forround robin in real time operating system”, IJRRAS 2 (2), February 2010.
[13] 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.
[14] H. S. Behera, Rakesh Mohanty, Sabyasachi Sahu and Sourav Kumar Bhoi. “Comparative performance analysis of multidynamic time quantum round robin (mdtqrr) algorithm with arrival time”, ISSN : 0976-5166, Vol. 2, No. 2,Apr- May2011,pp.262-271.
[15]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.
[16] 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.
[17] Pallab banerjee,Riya Shree,Richa kumara Verma”Generic Round Robin Scheduling for real time systems(GRR)” ISSN:2277- 128X,pg.148 -155 Vol-7,Issue-5,May-2017.

Keywords
Operating System, Round Robin, Turnaround time, Waiting time, Context Switch.