A Review on AMRR and Improved Round Robin Algorithms: Comparative Study
DOI:
10.33395/sinkron.v8i4.13563Abstract
Round Robin Algorithm is a dominant algorithm in real time system. Improved round robin and average max round robin, which is also called AMRR are two types with a breakthrough. Improved round robin is an algorithm where if the remaining burst time of the process is less than the quantum, then the running process will continue to be executed. Afterwards the next iteration will be executed as its turn. So, each iteration will have a vary of quantum. It is called a dynamic time quantum. Different with improved round robin, in AMRR, in every iteration, the quantum will be calculated. So, for every iteration, the quantum might be different, depending upon the quantum calculation of the rest burst time. The first stage of this algorithm is to calculate the average of the existing burst times. Then this average is added with the maximum existing burst time. This addition then will be divided, then we get the quantum. This calculation will be executed again after the iteration finish. Based on our analysis, with quantum 10 in these two algorithms. It is can be shown that the improved round robin is less efficient than AMRR, because its average turnaround time and average waiting time is lower. The average turnaround time is 17.25 ms for AMRR compared to 23.25 ms in improved round robin. And the average turnaround time is 9 ms for AMRR compared to 15 ms in improved round robin.
Downloads
References
T. D. Putra and R. Purnomo, “Simulation of Priority Round Robin Scheduling Algorithm,” Sinkron, vol. 7, no. 4, pp. 2170–2181, 2022, doi: 10.33395/sinkron.v7i4.11665.
R. Purnomo and T. D. Putra, “Simulation of Preemptive Shortest Job First Algorithm,” vol. 11, no. 5, pp. 1–11, 2022, doi: 10.17148/IJARCCE.2022.11501.
T. D. Putra, “Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling,” IJARCCE, vol. 9, no. 4, pp. 41–45, 2020, doi: 10.17148/ijarcce.2020.9408.
T. D. Putra, “Analysis of Priority Preemptive Scheduling Algorithm: Case Study,” Ijarcce, vol. 11, no. 1, pp. 27–30, 2022, doi: 10.17148/ijarcce.2022.11105.
T. D. Putra and R. Purnomo, “Analisis Algoritma Round Robin pada Penjadwalan CPU,” J. Ilm. Teknol. Inf. Asia, vol. 15, no. 2, p. 85, 2021, doi: 10.32815/jitika.v15i2.481.
A. F. Tri Dharma Putra, “Comparison Between Simple Round Robin and Intelligent Round Robin Algorithms in CPU Scheduling,” Int. J. Adv. Res. Comput. Commun. Eng., vol. 10, no. 4, pp. 86–90, 2021.
D. L. Freire, R. Z. Frantz, F. R. Frantz, and V. B. Fernandes, “New developments in round robin algorithms and their applications: a systematic mapping study,” Int. J. Bus. Process Integr. Manag., vol. 11, no. 2, p. 90, 2022, doi: 10.1504/ijbpim.2022.128704.
F. Alhaidari and T. Z. Balharith, “Enhanced round-robin algorithm in the cloud computing environment for optimal task scheduling,” Computers, vol. 10, no. 5, 2021, doi: 10.3390/computers10050063.
S. M. Ali, R. F. Alshahrani, A. H. Hadadi, T. A. Alghamdi, F. H. Almuhsin, and E. E. El-Sharawy, “A Review on the CPU Scheduling Algorithms: Comparative Study,” Int. J. Comput. Sci. Netw. Secur., vol. 21, no. 1, pp. 19–26, 2021, doi: 10.22937/IJCSNS.2021.21.1.4.
A. Abdelkader, N. Ghazy, M. S. Zaki, and K. A. ElDahshan, “MMMRR: a Modified Median Mean Round Robin Algorithm for Task Scheduling,” Int. J. Intell. Eng. Syst., vol. 15, no. 6, pp. 599–608, 2022, doi: 10.22266/ijies2022.1231.53.
U. Shafi et al., “A novel amended dynamic round robin scheduling algorithm for timeshared systems,” Int. Arab J. Inf. Technol., vol. 17, no. 1, pp. 90–98, 2020, doi: 10.34028/iajit/17/1/11.
S. M. Mostafa and H. Amano, “Dynamic round robin CPU scheduling algorithm based on K-means clustering technique,” Appl. Sci., vol. 10, no. 15, 2020, doi: 10.3390/app10155134.
E. R. Simarmata, G. Lumbantoruan, R. Nainggolan, and J. Napitupulu, “Round Robin Algorithm with Average Quantum Dynamic Time Based on Multicore Processor,” J. Phys. Conf. Ser., vol. 1361, no. 1, 2019, doi: 10.1088/1742-6596/1361/1/012005.
Sakshi et al., “A new median-average round Robin scheduling algorithm: An optimal approach for reducing turnaround and waiting time,” Alexandria Eng. J., vol. 61, no. 12, pp. 10527–10538, 2022, doi: 10.1016/j.aej.2022.04.006.
A. Fiad, Z. M. Maaza, and H. Bendoukha, “Improved version of round robin scheduling algorithm based on analytic model,” Int. J. Networked Distrib. Comput., vol. 8, no. 4, pp. 195–202, 2020, doi: 10.2991/IJNDC.K.200804.001.
T. D. Putra and R. Purnomo, “Case Study : Improved Round Robin Algorithm,” Sink. J. dan Penelit. Tek. Inform., vol. 7, no. 3, pp. 950–956, 2022.
A. J. Neha, “An Improved Round Robin CPU Scheduling Algorithm,” Iconic Res. Eng. J., vol. 1, no. 9, pp. 82–86, 2018.
R. Purnomo and T. D. Putra, “Comparison Between Simple Round Robin and Improved Round Robin Algorithms,” JATISI (Jurnal Tek. Inform. dan Sist. Informasi), vol. 9, no. 3, pp. 2205–2221, 2022, doi: 10.35957/jatisi.v9i3.2547.
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2024 Rakhmat Purnomo, Tri Dharma Putra
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Muhammad Khoiruddin harahap
Google Scholar 
Moraref
PKP Index
Garuda Kemdikbud
Indonesia OneSearch
OCLC Worldcat
Dimensions
Index Copernicus
Scilit
