VORR: A New Round Robin Scheduling Algorithm | ||||
| Al-Azhar Bulletin of Science | ||||
| Article 10, Volume 2021, Issue 12, December 2021, Page 45-54 PDF (414.47 K) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/absb.2021.99340.1141 | ||||
 View on SCiNiTO | ||||
| Author | ||||
Afaf A. Abdelhafiz 
| ||||
| Department of Mathematics, Division of Computer Science, Faculty of Science, Al-Azhar University (Girls Branch), Cairo, Egypt. | ||||
| Abstract | ||||
| Task scheduling on resources is critical for improving the performance of real-time systems. Enormous efforts have recently and rapidlybeen proposed by many researchers with improvements in various accessible algorithms of the task scheduling process. Each improvement contributes to the optimization of the system act. The field of enhancing CPU scheduling algorithms (such as the Round Robin algorithm RR) is still open. The Round Robin scheduling has many negatives, such as high waiting time, high turnaround time, or a high number of context switches. Such negatives affect the performance of the algorithm badly. This paper discusses a new approach named, VORR (Variant On Round Robin), which is one of the improvements and enhancements to the Round Robin scheduling algorithm. It effectively exploits the CPU by setting up an effective time quantum based on the median of burst times. The experimental results have demonstrated the worth of the proposed approach in comparison with the traditional Round Robin scheduling algorithm and its recent editions in terms of average waiting time, average turnaround time, and number of context switches. Also, it enhances the response time for some RR algorithms. | ||||
| Keywords | ||||
| Round robin algorithm; CPU scheduling; Time quantum; Average waiting time; Average turnaround time | ||||
| References | ||||
|
[1] Mahmoud H, Thabet M, Khafagy MH, Omara FA. An efficient load balancing technique for task scheduling in heterogeneous cloud environment. Cluster Comput [Internet]. 2021;24(4):3405–3419. Available from: https://doi.org/10.1007/s10586-021-03334-z
[2] Rofifah D. Operating Systems Internal and Design Principles. Paper Knowledge . Toward a Media History of Documents. 2020. 12–26 p.
[3] Noon A, Kalakech A, Kadry S. A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average. 2011;(November 2011):224-229. Available from: http://arxiv.org/abs/1111.5348
[4] Dave B, Yadev S, Mathuria M, Sharma YM. Optimize task scheduling act by modified round robin scheme with vigorous time quantum. Proc Int Conf Intell Sustain Syst ICISS 2017. 2018;(Iciss):905–910.
[5] Arora H, Arora D, Goel B, Jain P. An Improved CPU Scheduling Algorithm. Int J Appl Inf Syst. 2013;6(6):7–9.
[6] Kumar Mishra M, Rashid F. An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum. Int J Comput Sci Eng Appl. 2014;4(4):1–8.
[7] Garg S, Kumar D. A K-Factor CPU Scheduling Algorithm. 2018 9th Int Conf Comput Commun Netw Technol ICCCNT 2018. 2018;1–6.
[8] ElDahshan K, Abd A, Ghazy N. Achieving Stability in the Round Robin Algorithm. Int J Comput Appl. 2017;172(6):15–20.
[9] Zouaoui S, Boussaid L, Mtibaa A. Priority based round robin (PBRR) CPU scheduling algorithm. Int J Electr Comput Eng. 2019;9(1):190-202.
[10] a S. a Modified Round Robin Cpu Scheduling Algorithm With Dynamic Time Quantum. Int J Adv Res. 2019;7(2):422–429.
[11] Mostafa SM, Amano H. Dynamic round robin CPU scheduling algorithm based on K-means clustering technique. Appl Sci. 2020;10(15).
[12] Faizan K, Marikal A, Anil K. A Hybrid Round Robin Scheduling Mechanism for Process Management. Int J Comput Appl. 2020;177(36):14–19.
[13] Arif KI, Morad M, Mohammed MA, Subhi MA. AN EFFICIENT THRESHOLD ROUND-ROBIN SCHEME for CPU SCHEDULING (ETRR). J Eng Sci Technol. 2020;15(6):4048–4060.
[14] Fiad A, Maaza ZM, Bendoukha H. Improved version of round robin scheduling algorithm based on analytic model. Int J Networked Distrib Comput. 2020;8(4):195–202.
[15] Sharma PS, Kumar S, Gaur MS, Jain V. A novel intelligent round robin CPU scheduling algorithm. Int J Inf Technol [Internet]. 2021; Available from: https://doi.org/10.1007/s41870-021-00630-0
[16] Mostafa SM, Idris SA, Kaur M. ATS: A novel time-sharing cpu scheduling algorithm based on features similarities. Comput Mater Contin. 2022;70(3):6271–6288.
| ||||
|
Statistics Article View: 375 PDF Download: 262 |
||||
