Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method
Автор: Shahram Saeidi, Hakimeh Alemi Baktash
Журнал: International Journal of Information Technology and Computer Science(IJITCS) @ijitcs
Статья в выпуске: 10 Vol. 4, 2012 года.
Бесплатный доступ
The process scheduling, is one of the most important tasks of the operating system. One of the most common scheduling algorithms used by the most operating systems is the Round Robin method in which, the ready processes waiting in ready queue, seize the processor for a short period of time known as the quantum (or time slice) circularly. In this paper, a non-linear programming mathematical model is developed to determine the optimum value of the time quantum, in order to minimize the average waiting time of the processes. The model is implemented and solved by Lingo 8.0 software on four selected problems from the literature.
Time Quantum, Round Robin, Process Scheduling
Короткий адрес: https://sciup.org/15011772
IDR: 15011772
Список литературы Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method
- W. Stallings, Operating Systems: Internals and Design Principles. 6th Edition, Prentice Hall, 2008.
- M. Fahimi, Operating Systems, vol. 1, 1st Edition, Tehran: Jelve Publishing, 1992.
- R. Abielmona, "Scheduling Algorithmic Research", Department of Electrical and Computer Engineering, Ottawa-Carleton Institute, 2000.
- T. Helmy, and A. 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, 2007.
- J. Nieh, Ch. Vaill, and H. Zhong, "Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler." Proceeding of the 2001 USENIX Annual Technical Conference, USA, 2001.
- M.H. Zahedi, M. Ghazizadeh¸ and M. Naghibzadeh, "Fuzzy Round Robin CPU Scheduling (FRRCS) Algorithm", Advances in Computer and Information Sciences and Engineering. 348-353, 2008.
- R.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.
- A. Singh, P. Goyal, and S. Batra, "An Optimized Round Robin Scheduling Algorithm for CPU Scheduling", International Journal on Computer Science and Engineering. 2(7), 2382-2385, 2010.
- S.M. Mostafa, , S.Z. Rida, and S.H. Hamad, "Finding time quantum of Round Robin CPU scheduling in general computing systems using integer programming", International Journal of Research and Review in Applied Science. 5(1), 64-71. 2010.
- R. Mohanty, H.S. Behera, K. Patwari, M.R. Das, M. Dash, and Sudhasree, "Design and Performance Analysis of a new proposed Shortest Remaining Burst Round Robin (SRBRR) Scheduling Algorithm", Proceedings of the International Symposium on Computer Engineering and Technology(ISCET), 2010.
- H.S. Behera, , R. Mohanty, and D. Nayak, "A new proposed dynamic quantum with re-adjusted Round Robin scheduling algorithm and its performance", International Journal of Computer Applications, 5(5), 10-15, 2010.
- C. Yaashuwanth, and R. Ramesh, "Intelligent Time Slice for Round Robin in Real Time Operating Systems", IJRRAS, 2(2), 126-131, 2010.
- H.S. Behera, R. Mohanty, S. Sahu, and S.K. Bhoi, "Comparative performance analysis of Multi-Dynamic Time Quantum Round Robin (MDTQRR) algorithm with arrival time", Indian Journal of Science and Engineering, 2(2), 262-271, 2011.
- S. Hiranwal, and K.C. Roy, "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.
- A. Noon, A. Kalakech, and S. Kadry, "A new Round Robin Based scheduling algorithm for Operating Systems: Dynamic Quantum time Mean Average", International Journal of Computer Science Issues. 8(3), 224-229, 2011.
- B. Alam, ” Finding Time Quantum of Round Robin CPU Scheduling Algorithm Using Fuzzy Logic", International conference on Computer and Electrical Engineering, ICCEE 2008.
- B. Suresh, P.V.G.D. Prasad Reddy, and C.K. Chakravarthy, ”Variable Quantum Deficit Round Robin Scheduling for Improved Fairness in MULTIHOP Networks", International Journal of Distributed and Parallel Systems, Vol. 2., No. 1, 2011.
- S. Raheja, R. Dhadich, and S. Rajpal, "An Optimum Time Quantum using Linguistic Synthesis for Round Robin CPU Scheduling Algorithm", International Journal on Soft Computing, Vol. 3. No. 1, 2012.
- D. Nayak, S. K. Malla, and D. Debadarshini, "Improved Round Robin Scheduling using Dynamic Time Quantum", International Journal of Computer Applications, Vol. 38, No. 5, 2012.
- M. U. Siregar, "A New Approach to CPU Scheduling Algorithm: Genetic Round Robin", International Journal of Computer Applications, Vol. 47, No. 19., 2012.
Статья научная
