International Journal of Education and Management Engineering (IJEME)
IJEME Vol. 5, No. 2, 8 Jun. 2015
Cover page and Table of Contents: PDF (size: 353KB)
Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice
Full Text (PDF, 353KB), PP.10-19
Views: 0 Downloads: 0
Author(s)
Lipika Datta
1,*
Index Terms
Operating System, Scheduling, Round Robin Algorithm, Dynamic Time Slice, Context switch, Turnaround time, Average Waiting time
Abstract
Round Robin (RR) scheduling algorithm is the widely used scheduling algorithm in multitasking. It ensures fairness and starvation free execution of processes. Choosing the time quantum in RR algorithm is very crucial as small time slice results in large number of context switches and large time quantum increases the response time. To overcome these problems of RR scheduling, instead of static time slice dynamic time slice can be used to get optimal performance. The objective of this paper is to modify RR algorithm by adjusting time slices of different rounds depending on the remaining CPU bursts of currently running processes and considering their waiting times until that round in respect of the other processes' waiting times. Experimental analysis reveals that the proposed algorithm produces better average turnaround time, average waiting time and fewer number of context switches than existing algorithms.
Cite This Paper
Lipika Datta,"Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice", IJEME, vol.5, no.2, pp.10-19, 2015. DOI: 10.5815/ijeme.2015.02.02
Reference
[1]Principles of Operating System, Naresh Chauhan, Oxford University Press, 2014.
[2]Kevin Jeffay, F. Donelson Smith, Arun Moorthy, James Anderson, "Proportional Share Scheduling of Operating System Services for Real-Time Applications", In Proceedings of the 19th IEEE Real-Time Systems Symposium, Madrid, Spain, December 1998.
[3]Saroj Hiranwal, Dr. K.C. Roy, "Adaptive Round Robin Scheduling using Shortest Burst Approach Based on Smart Time Slice", International Journal of Computer Science and Communication Vol. 2, No. 2, July-December 2011, pp. 319-323.
[4]Ajit Singh, Priyanka Goyal, Sahil Batra, "An Optimized Round Robin Scheduling Algorithm for CPU Scheduling", International Journal on Computer Science and Engineering Vol. 02, No. 07, 2010, 2383-2385.
[5]Chhayanath Padhy, Dillip Ranjan Nayak, "Revamped Round Robin Scheduling Algorithm", Journal of Engineering Computers & Applied Sciences (JECAS) ISSN No: 2319-5606 Volume 3, No.4, April 2014.
[6]Taeck-Geun Kwon, Sook-Hyang Lee, and June-Kyung Rho, "Scheduling Algorithm for Real-Time Burst Traffic using Dynamic Weighted Round Robin", R&D Lab., LG Information & Communications, LTD., 1998 IEEE.
[7]Tarek Helmy, Abdelkader Dekdouk, "Burst Round Robin as a Proportional - Share Scheduling Algorithm", IEEEGCC, http://eprints.kfupm.edu.sa/1462.
[8]Ashkan Emami Ale Agha, Somayyeh Jafarali Jassbi," A New Method to Improve Round Robin Scheduling Algorithm with Quantum Time Based on Harmonic-Arithmetic Mean (HARM)", I.J. Information Technology and Computer Science, 2013, 07, 56-62 Published Online June 2013 in MECS (http://www.mecs-press.org/).
[9]Rami J. Matarneh," Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of the Now Running Processes", American Journal of Applied Sciences 6 (10): 1831-1837, 2009 ISSN 1546-9239 © 2009 Science Publications.
[10]H.S.Behera, R. Mohanty, Debashree Nayak," A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis", International Journal of Computer Applications (0975 – 8887) Volume 5– No.5, August 2010.