Abstract
In round robin scheduling algorithm, the scheduler preempts a process when time slice (δ) expires and picks up the next processes in the ready queue for execution. A potential problem that we observed with the traditional round robin scheduling algorithm is: when the time slice increases, both the average waiting time and the turnaround time are also increasing instead of decreasing. This paper proposes a remedy for the observed problem which works as follows calculate the mean burst time (m) of all the processes in the ready queue. Then insert m at its appropriate position in the sorted ready queue. With this the ready queue is divided into two parts: the first part contains the burst times, b1, b2,...bi − 1, which are smaller than m and the second part contains burst times bi + 1,bi + 2....bn + 1, which are greater than or equal to m. now pickup the process p1 with burst time b1 from the sorted ready queue, assign it to CPU and execute it for one time slice (δ). Next pickup the process pi + 1 with burst time bi + 1 from the sorted ready queue and execute it for another δ. This process is repeated until all the jobs in the ready queue complete their execution. Then average waiting time and average turnaround time of all the processes in the ready queue are computed. When the proposed method is applied, it observed that even if the time slice increases, both the average waiting time and the turnaround time are found to be also decreasing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Silberschatz, A., Galvin, P.B., Gagne, G.: Operating system principles, 7th edn.
Dhamdhere, D.M.: Operating Systems A concept-based approach. Tata McGraw Hill
Sinth, A., Goyal, P., Batra, S.: An optimized Round Robin Scheduling Algorithm for CPU Scheduling. IJCSE 02(07), 2383–2385 (2010)
Kiran, R.N.D.S.S., Babu, P.V., Krishna, B.B.M.: Optimizing CPU scheduling for real time applications using mean-difference round robin (MDRR) algorithm. In: Satapathy, S.C., Avadahani, P.S., Udgata, S.K., Lakshminarayana, S., et al. (eds.) ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of CSI - Volume I. Advances in Intelligent Systems and Computing, vol. 248, pp. 713–721. Springer, Heidelberg (2014)
Matarneh, R.J.: 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
Hiranwal, S., Roy, K.C.: Adaptive Round Robin scheduling using shortest burst approach, based on smart time slice. International Journal of computer Science and Communication 2(2), 219–326 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kiran, R.N.D.S.S., Rao, C.S., Rao, M.S. (2015). Mean Interleaved Round Robin Algorithm: A Novel CPU Scheduling Algorithm for Time Sharing Systems. In: Satapathy, S., Biswal, B., Udgata, S., Mandal, J. (eds) Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014. Advances in Intelligent Systems and Computing, vol 327. Springer, Cham. https://doi.org/10.1007/978-3-319-11933-5_51
Download citation
DOI: https://doi.org/10.1007/978-3-319-11933-5_51
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11932-8
Online ISBN: 978-3-319-11933-5
eBook Packages: EngineeringEngineering (R0)