Average Max Round Robin Algorithm: A Case Study

Authors

• Tri Dharma Putra Department of Informatics, Faculty of Computer Science, Universitas Bhayangkara Jakarta Raya
• Rakhmat Purnomo Department of Informatics, Faculty of Computer Science, Universitas Bhayangkara Jakarta Raya

Keywords:

Average Max Round Robin Algorithm, Average Turn Around Time, Average Waiting Time, Context Switching, Quantum

Abstract

Round Robin Algorithm is one wellknown algorithm in real time system. Several variants of round robin algorithms are in the fields. Average max round robin algorithm is a breakthrough to optimize context switching or also called quantum. Context switching is one big problem in round robin algorithm. To optimize high context switching is the key solution. This will make this algorithm efficient. There should be a way to optimize this context switching. Then the average max round robin algorithm is one solution to this problem. The average max algorithm is defined by finding the average of burst time then add the maximum burst time to the average burst time. Then calculate again the average of the two. The calculation will be iterated in the next round robin cycle. Here, in this journal, three case studies are discussed. Each with different burst times to understand this average max round robin algorithm more clearly. In the first case study we get turn around time 34 ms, and average waiting time 20.6 ms. In the second case study, we get average turn around time 21.8 ms, and the average waiting time 13 ms. And in the last case study, the third one, we get turn around time 12.2 ms, and the average waiting time 6.6 ms. There is no calculation for the second iteration for all case studies. Since the left burst time is only in one process. Optimizing the context switching, minimizing average turnaround time, and average waiting time is the key solution to round robin algorithm.

GS Cited Analysis

References

Abu-Dalbouh, H. M. (2022). A New Combination Approach to CPU Scheduling based on Priority and Round-Robin Algorithms for Assigning a Priority to a Process and Eliminating Starvation. International Journal of Advanced Computer Science and Applications, 13(4), 541–546. https://doi.org/10.14569/IJACSA.2022.0130463

Alhaidari, F., & Balharith, T. Z. (2021). Enhanced round-robin algorithm in the cloud computing environment for optimal task scheduling. Computers, 10(5). https://doi.org/10.3390/computers10050063

Ali, S. M., Alshahrani, R. F., Hadadi, A. H., Alghamdi, T. A., Almuhsin, F. H., & El-Sharawy, E. E. (2021). A Review on the CPU Scheduling Algorithms: Comparative Study. International Journal of Computer Science & Network Security, 21(1), 19–26. https://doi.org/10.22937/IJCSNS.2021.21.1.4

Fiad, A., Maaza, Z. M., & Bendoukha, H. (2020). Improved version of round robin scheduling algorithm based on analytic model. International Journal of Networked and Distributed Computing, 8(4), 195–202. https://doi.org/10.2991/IJNDC.K.200804.001

Freire, D. L., Frantz, R. Z., Roos-frantz, F., & Fernandes, V. B. (2021). New developments in Round Robin algorithms and their applications : a systematic mapping study New developments in Round Robin algorithms and their applications : a systematic mapping study Daniela L . Freire , Rafael Z . Frantz , Fabricia Roos-Frantz Vit. January.

Harki, N., Ahmed, A., & Haji, L. (2020). CPU Scheduling Techniques: A Review on Novel Approaches Strategy and Performance Assessment. Journal of Applied Science and Technology Trends, 1(2), 48–55. https://doi.org/10.38094/jastt1215

Mostafa, S. M., & Amano, H. (2020). An adjustable variant of round robin algorithm based on clustering technique. Computers, Materials and Continua, 66(3), 3253–3270. https://doi.org/10.32604/cmc.2021.014675

Omar, H. K., Jihad, K. H., & Hussein, S. F. (2021). Comparative analysis of the essential cpu scheduling algorithms. Bulletin of Electrical Engineering and Informatics, 10(5), 2742–2750. https://doi.org/10.11591/eei.v10i5.2812

Purnomo, R., & Putra, T. D. (2022). Simulation of Preemptive Shortest Job First Algorithm. 11(5), 1–11. https://doi.org/10.17148/IJARCCE.2022.11501

Putra, T. D. (2022). Analysis of Priority Preemptive Scheduling Algorithm: Case Study. Ijarcce, 11(1), 27–30. https://doi.org/10.17148/ijarcce.2022.11105

Putra, T. D., & Purnomo, R. (2021). Analisis Algoritma Round Robin pada Penjadwalan CPU. Jurnal Ilmiah Teknologi Informasi Asia, 15(2), 85. https://doi.org/10.32815/jitika.v15i2.481

Putra, T. D., & Purnomo, R. (2022). Case Study : Improved Round Robin Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 950–956.

Sakshi, Sharma, C., Sharma, S., Kautish, S., A. M. Alsallami, S., Khalil, E. M., & Wagdy Mohamed, A. (2022). A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time. Alexandria Engineering Journal, 61(12), 10527–10538. https://doi.org/10.1016/j.aej.2022.04.006

Shafi, U., Shah, M., Wahid, A., Abbasi, K., Javaid, Q., Asghar, M., & Haider, M. (2020). A novel amended dynamic round robin scheduling algorithm for timeshared systems. International Arab Journal of Information Technology, 17(1), 90–98. https://doi.org/10.34028/iajit/17/1/11

Tri Dharma Putra, A. F. (2021). Comparison Between Simple Round Robin and Intelligent Round Robin Algorithms in CPU Scheduling. International Journal of Advanced Research in Computer and Communication Engineering, 10(4), 86–90.