International Journal of Information Technology and Computer Science (IJITCS)
IJITCS Vol. 5, No. 7, 8 Jun. 2013
Cover page and Table of Contents: PDF (size: 370KB)
A New Method to Improve Round Robin Scheduling Algorithm with Quantum Time Based on Harmonic-Arithmetic Mean (HARM)
Full Text (PDF, 370KB), PP.56-62
Views: 0 Downloads: 0
Author(s)
Index Terms
Round Robin, Quantum Time, Harmonic Mean, Arithmetic Mean, HARM, Average Waiting Time, Average Turnaround Time
Abstract
One of the most important concepts in multi programming Operating Systems is scheduling. It helps in choosing the processes for execution. Round robin method is one of the most important algorithms in scheduling. It is the most popular algorithm due to its fairness and starvation free nature towards the processes, which is achieved by using proper quantum time. The main challenge in this algorithm is selection of quantum time. This parameter affects on average Waiting Time and average Turnaround Time in execution queue. As the quantum time is static, it causes less context switching in case of high quantum time and high context switching in case of less quantum time. Increasing context switch leads to high average waiting time, high average turnaround time which is an overhead and degrades the system performance. With respect to these points, the algorithms should calculate proper value for the quantum time. Two main classes of algorithms that are proposed to calculate the quantum time include static and dynamic methods. In static methods quantum time is fixed during the scheduling. Dynamic algorithms are one of these methods that change the value of quantum time in each cycle. For example in one method the value of quantum time in each cycle is equal to the median of burst times of processes in ready queue and for another method this value is equal to arithmetic mean of burst times of ready processes.
In this paper we proposed a new method to obtaining quantum time in each cycle based on arithmetic-harmonic mean (HARM). Harmonic mean is calculated by dividing the number of observations by the reciprocal of each number in the series. With examples we show that in some cases it can provides better scheduling criteria and improves the average Turnaround Time and average Waiting Time.
Cite This Paper
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)", International Journal of Information Technology and Computer Science(IJITCS), vol.5, no.7, pp.56-62, 2013. DOI:10.5815/ijitcs.2013.07.07
Reference
[1]Rami J. Matarneh. Self-Adjustment Time Quantum in Round Robin Algorithm Depending on Burst Time of Now Running Processes, American J. of Applied Sciences 6(10): 1831-1837, 2009.
[2]H. S. Behera, Rakesh Mohanty, Debashree Nayak. A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis , International Journal of Computer Applications, Vol. 5, No. 5, August 2010.
[3]Abbas Noon Ali Kalakech Seifedine Kadry. A New Round Robin Based Scheduling Algorithm for Operating Systems-Dynamic Quantum Using the Mean Average, IJCSI International Journal of Computer Science Issues, Vol. 8, Issue 3, No. 1, May 2011.
[4]Helmy, T. and A. Dekdouk, 2007. Burst Round Robin as a Proportional-share Scheduling Algorithm, IEEEGCC,http://eprints.kfupm.edu.sa/1462.
[5]Prof. Rakesh Mohanty, Prof. H. S. Behera Khusbu Patwari, Manas Ranjan Das, Monisha Dash, Sudhashree. Design and Performance Evaluation of a New Proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm, Department of Computer Science and Engineering Veer Surendra Sai University of Technology, Burla, Sambalpur, Orissa, India, 2010.
[6]Prof. Rakesh Mohanty, Manas Ranjan Das, M.Lakshimi prasanna, Sudhashree Students. Design and Performance Evaluation of a New Proposed Fittest Job First Dynamic Round Robin (FJFDRR) Scheduling Algorithm, International Journal of Computer Information Systems, vol. 2, No. 2, 2011.
[7]Saroj Hiranwal. Adaptive round robin scheduling using shortest burst approach based on smart time slice, International Journal of Computer Science and Communication, vol2, No.2, July-December 011, pp.319-323.
[8]Mark W. Shirley. Review of Statistical Analysis, Appendix VI, Cost of Capital: Applications and Examples, Third Edition by Shannon Pratt and Roger J. Grabowski, copyright 2008 by John Wiley and Sons, p. 738.
[9]Shannon Pratt. The Market Approach to Valuing Businesses, Second Edition, copyright 2005 by John Wiley & Sons, p. 140.
[10]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.
[11]Operating Systems, 3rd Ed., H.M.Deitel, P.J.Deitel, D.R.Choffnes .ISBN 978-81-317-1289-4.
[12]Operating System Concepts, 8th Ed., Abraham Silberschatz, Peter B. Galvin, Grege Gagne. ISBN 978-81-265-2051-0.
[13]Tanebaun, A.S. 2008. Modern Operating Systems. 3rd Edn., Prentice Hall, ISBN: 13:9780136006633, pp: 1104.
[14]C. L. Liu and James W. Layland. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment, Journal of the ACM (JACM), Vol. 20, Issue 1, January, 1973.
[15]Sharma R (2008). Some more inequalities for arithmetic mean harmonic mean and variance, J Math Inequal 2 (1) 109–114.
[16]B. C. Carlson. Algorithms involving arithmetic and geometric means, Amer. Math. Monthly 78 (1971), 496–505. MR 0283246.
[17]Christopher D. Manning, Prabhakar Raghavan and Hinrich Schütze. Introduction to Information Retrieval, Cambridge University Press, 2008.