Median-Average Round Robin (MARR) Algorithm for Optimal CPU Task Scheduling
DOI:
10.33395/sinkron.v9i1.13920Keywords:
MARR, median-average round robin, quantum, turnaround time, waiting timeAbstract
Abstract: In operating systems, multitasking or multiprocessing terms are used. If more than one task operating consecutively, but the users feel that they are running simultaneously, than it is called multitasking. Round robin algorithm is a noted algorithm in multitasking. Several modifications of classical round robin algorithm have been proposed by experts. The idea behind these modifications are to get lower turnaround time and lower waiting time. The main topic’s discussion is about median-average round robin (MARR) algorithm. In this algorithm, the processes are arranged in ascending order. Then we get the median of the burst time. Afterwards, calculation of the average burst time is done. The summation of average and median, divide by two is the time quantum. So, the time quantum will be dynamic, based on each iteration of round robin. First iteration can have different time quantum compared to the second and so on. Each iteration will have one time quantum. Three analysis’s are given. Each with five processes. In the first analysis, time quantum for 1st iteration is 11 and the 2nd iteration is 4. The average turnaround time is 29. The average waiting time is 19. For the second analysis, time quantum for 1st iteration is 10 and the 2nd iteration is 8. The average turnaround time is 24.2. The average waiting time is 13.6. For the third analysis, time quantum for 1st iteration is 10 and the 2nd iteration is 9. The average turnaround time is 23.2. The average waiting time is 12.8.
Downloads
References
Abdelkader, A., Ghazy, N., Zaki, M. S., & ElDahshan, K. A. (2022). MMMRR: a Modified Median Mean Round Robin Algorithm for Task Scheduling. International Journal of Intelligent Engineering and Systems, 15(6), 599–608. https://doi.org/10.22266/ijies2022.1231.53
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., Frantz, F. R., & Fernandes, V. B. (2022). New developments in round robin algorithms and their applications: a systematic mapping study. International Journal of Business Process Integration and Management, 11(2), 90. https://doi.org/10.1504/ijbpim.2022.128704
Mostafa, S. M., & Amano, H. (2020). Dynamic round robin CPU scheduling algorithm based on K-means clustering technique. Applied Sciences (Switzerland), 10(15). https://doi.org/10.3390/app10155134
Neha, A. J. (2018). An Improved Round Robin CPU Scheduling Algorithm. Iconic Research and Engineering Journal, 1(9), 82–86.
Purnomo, R., & Putra, T. D. (2022a). Comparison Between Simple Round Robin and Improved Round Robin Algorithms. JATISI (Jurnal Teknik Informatika Dan Sistem Informasi), 9(3), 2205–2221. https://doi.org/10.35957/jatisi.v9i3.2547
Purnomo, R., & Putra, T. D. (2022b). Simulation of Preemptive Shortest Job First Algorithm. 11(5), 1–11. https://doi.org/10.17148/IJARCCE.2022.11501
Putra, T. D. (2020). Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling. IJARCCE, 9(4), 41–45. https://doi.org/10.17148/ijarcce.2020.9408
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. (2022a). Case Study : Improved Round Robin Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 950–956.
Putra, T. D., & Purnomo, R. (2022b). Simulation of Priority Round Robin Scheduling Algorithm. Sinkron, 7(4), 2170–2181. https://doi.org/10.33395/sinkron.v7i4.11665
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
Simarmata, E. R., Lumbantoruan, G., Nainggolan, R., & Napitupulu, J. (2019). Round Robin Algorithm with Average Quantum Dynamic Time Based on Multicore Processor. Journal of Physics: Conference Series, 1361(1). https://doi.org/10.1088/1742-6596/1361/1/012005
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.
Downloads
|
How to Cite
Issue
Section
License
Copyright (c) 2025 Tri Dharma Putra, Rakhmat
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
