An Adjustable Round Robin Scheduling Algorithm in Interactive Systems
Abstract
CPU scheduling is considered as the basic job within the operating system. Scheduling criteria including waiting time, context switches and others have been suggested for comparing CPU scheduling algorithms. In this paper, a modified version of Round Robin algorithm is introduced as an attempt to combine the advantageous of low scheduling overhead of Round Robin and favor short process to minimize the average waiting time and number of context switches of running processes in interactive (time-shared) systems. A threshold is considered to determine whether the running process will be interrupted because of the expiration of its time slice specified by the Round Robin policy or will continue execution until termination. Derived results show that the suggested modification minimizes the average waiting time and number of context switches compared to Round Robin algorithm.
References
S. M. Mostafa, S. Z. Rida, and S. H. Hamad, “Finding Time Quantum of Round Robin Cpu Scheduling Algorithm in General Computing Systems Using Integer Programming,” Int. J. New Comput. Archit. their Appl., vol. 5, no. October, pp. 64–71, Jan. 2010.
A. R. Dash, S. kumar Sahu, and S. K. Samantra, “An Optimized Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum,” Int. J. Comput. Sci. Eng. Inf. Technol., vol. 5, no. 1, pp. 07-26, 2015.
S. M. Mostafa and S. Kusakabe, “Effect of Thread Weight Readjustment Scheduler on Scheduling Criteria,” Inf. Eng. Express, Jan. 2015.
S. M. Mostafa and S. Kusakabe, “Towards Maximizing Throughput for Multithreaded Processes in Linux,” Int. J. New Comput. Archit. their Appl., vol. 4, no. 4, pp. 70–78, 2014.
A. Singh, P. Goyal, and S. Batra, “An optimized round robin scheduling algorithm for CPU scheduling,” Int. J. Comput. Sci. Eng., vol. 02, no. 07, pp. 2383–85, 2010.
S. Elmougy, S. Sarhan, and M. Joundy, “A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique,” J. Cloud Comput., vol. 6, no. 1, pp. 0–12, 2017.
S. M. Mostafa, “Proportional Weighted Round Robin: A Proportional Share CPU Scheduler in Time Sharing Systems,” Int. J. New Comput. Archit. their Appl., vol. 8, no. 3, pp. 142–47, 2018.
M. S. Iraji, “Time Sharing Algorithm with Dynamic Weighted Harmonic Round Robin,” J. Asian Sci. Res., vol. 5, no. 3, pp. 131–42, 2016.
T. Helmy and A. Dekdouk, “Burst round robin as a proportional-share scheduling algorithm,” Jan. 2007.
M. M. Tajwar, M. N. Pathan, L. Hussaini, and A. Abubakar, “CPU scheduling with a round robin algorithm based on an effective time slice,” J. Inf. Process. Syst., vol. 13, no. 4, pp. 941–50, 2017.
B. Caprita, W. C. Chan, J. Nieh, C. Stein, and H. Zheng, “Group ratio round-robin: O (1) proportional share scheduling for uniprocessor and multiprocessor systems,” Proc. Annu. Conf. USENIX Annu. Tech. Conf., no. 1, pp. 36–36, 2005.
B. Caprita, J. Nieh, and W. C. Chan, “Group Round Robin: Improving the Fairness and Complexity of Packet Scheduling,” Proc. 2005 ACM Symp. Archit. Netw. Commun. Syst., pp. 29–40, 2005.
L. Abeni, G. Lipari, and G. Buttazzo, “Constant bandwidth vs. proportional share resource allocation,” no. July 1999, pp. 107–11, 2003.
A. Silberschatz, G. Gagne, and P. B. Galvin, Operating Systems Concepts. 2012.
J. Sunil, V. G Anisha Gnana, and V. T Karthija, Fundamentals of Operating Systems Concepts. 2018.
