Abstract
Scheduling is one of the most important issues in the operating system, such as the tasks must be affected to the appropriate virtual machines, considering different factors at the same time to ensure better use of resources. A lot of research has been carried out to propose more efficient task scheduling algorithms. Round robin is one of the most powerful algorithms in this field but its main challenge is the choice of time quantum. The effectiveness of Round Robin depends on the choice of this parameter. In this paper, we aimed to overcome these challenge by proposing an improved Round Robin scheduling algorithm using a variable time quantum based on an analytic model. Our analytical model takes into consideration different parameters to determine the order of tasks execution. The use of burst time as parameters in our model ensures a more suitable time quantum. This algorithm can be applied in any operating system and therefore in the cloud computing environment. In order to assess the performance and effectiveness of the proposed approach, five different scenarios have been implemented; the comparisons made with existing works have shown that the proposed approach improves the average waiting time and the average turnaround time, which ensures better scheduling of tasks and better use of resources.
Article PDF
Avoid common mistakes on your manuscript.
References
A. Silberschatz, G. Gagne, P.B. Galvin, Operating system concepts, John Wiley & Sons, 2003.
B. Mohamed, N.E. Al-Attar, W. Awad, F.A. Omara, Dynamic job scheduling algorithms based on round robin for cloud environment, Res. J. Appl. Sci. Eng. Technol. 14 (2017), 124–131.
K. Etminani, M. Naghibzadeh, A min-min max-min selective algorihtm for grid task scheduling, 2007 3rd IEEE/IFIP International Conference in Central Asia on Internet, IEEE, Tashkent, Uzbekistan, 2007, pp. 1–7.
M.M. Tajwar, M.N. Pathan, L. Hussaini, A. Abubakar, CPU scheduling with a round robin algorithm based on an effective time slice, J. Inform. Process. Syst. 13 (2017), 941–950.
C.C. Lin, P. Liu, J.J. Wu, Energy-aware virtual machine dynamic provision and scheduling for cloud computing, 2011 IEEE 4th International Conference on Cloud Computing, IEEE, Washington, DC, USA, 2011, pp. 736–737.
Eucalyptus. (n.d.), retrieved from: https://www.eucalyptus.cloud/ (accessed July 02, 2019).
M.K. Mishra, F. Rashid, An improved round robin CPU scheduling algorithm with varying time quantum, Int. J. Comput. Sci. Eng. Appl. 4 (2014), 1–8.
A.R. Dash, S.K. Sahu, S.K. Samantra, An optimized round robin CPU scheduling algorithm with dynamic time quantum, Int. J. Comput. Sci. Eng. Inform. Technol. 5 (2015), 7–26.
P. Pradhan, P.K. Behera, B.N.B. Ray, Modified round robin algorithm for resource allocation in cloud computing, Proced. Comput. Sci. 85 (2016), 878–890.
MATLAB. (n.d.), retrieved from: https://www.mathworks.com/products/matlab.html (accessed June 26, 2019).
M. Singh, R. Agrawal, Modified round robin algorithm (MRR), 2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI), IEEE, Chennai, India, 2017, pp. 2832–2839.
H. Mora, S.E. Abdullahi, S.B. Junaidu, Modified median round robin algorithm (MMRRA), 2017 13th International Conference on Electronics, Computer and Computation (ICECCO), IEEE, Abuja, Nigeria, 2017, pp. 1–7.
S. Arif, N. Ghaffar, A. Javed, Implementation of alternating median based round robin scheduling algorithm, 2016 IEEE International Conference on Computer and Information Technology (CIT), IEEE, Nadi, Fiji, 2016, pp. 154–160.
S. Elmougy, S. Sarhan, M. Joundy, A novel hybrid of shortest job first and round robin with dynamic variable quantum time task scheduling technique, J. Cloud Comp. 6 (2017), 12.
B. Dave, S. Yadev, M. Mathuria, Y.M. Sharma, Optimize task scheduling act by modified round robin scheme with vigorous time quantum, 2017 International Conference on Intelligent Sustainable Systems (ICISS), IEEE, Palladam, India, 2017, pp. 905–910.
S.B. Das, S.K. Mishra, A.K. Sahu, An efficient average execution time-round-robin (AET-RR) scheduling algorithm, Int. J. Inform. Technol. (2019).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC 4.0 license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
Fiad, A., Maaza, Z.M. & Bendoukha, H. Improved Version of Round Robin Scheduling Algorithm Based on Analytic Model. Int J Netw Distrib Comput 8, 195–202 (2020). https://doi.org/10.2991/ijndc.k.200804.001
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.2991/ijndc.k.200804.001