Comparison Between Simple Round Robin and Improved Round Robin Algorithms
The objective of this journal is to compare the efficiency between these two algorithms, the simple round robin and improved round robin algorithms. In real time systems algorithm, round robin plays a significant role to be used in embedded systems. Here we compare the average turn around time and average waiting time, also number of context switching between these two algorithms. Improved round robin algorithm, is an algorithm where if the remaining burst time is less than the allocated time quantum then the running process is executed. Then remove the currently running process from ready queue and put it in the tail of the ready queue while in simple round robin algorithm the remaining burst time will be executed until finish as scheduled. This comparison proves that improved round robin algorithm is more efficient, with lower average turn around time and lower average waiting time, lower context switching. There by this increases the system throughput.
 R. Purnomo and T. D. Putra, “Simulation of Preemptive Shortest Job First Algorithm,” IJARCCE, vol. 11, no. 5, pp. 1–11, 2022, doi: 10.17148/IJARCCE.2022.11501.
 J. R. Indusree and B. Prabadevi, “Enhanced round robin CPU scheduling with burst time based time quantum,” IOP Conf. Ser. Mater. Sci. Eng., vol. 263, no. 4, 2017, doi: 10.1088/1757-899X/263/4/042038.
 R. Ramesh and E. Engineering, “Intelligent Time Slice for Round Robin in Real Time Operating Systems,” vol. 2, no. February, pp. 126–131, 2010.
 A. Sharma and G. Kakhani, “Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm,” Int. J. Comput. Sci. Mob. Comput., vol. 4, no. 12, pp. 139–147, 2015.
 T. D. Putra and A. Fadjriya, “Comparison Between Simple Round Robin and Intelligent Round Robin Algorithms in CPU Scheduling,” IJARCCE, vol. 10, no. 4, pp. 86–90, 2021, doi: 10.17148/ijarcce.2021.10413.
 R. Dhruv, “Round robin scheduling algorithm based on dynamic time quantum,” Int. J. Eng. Adv. Technol., vol. 8, no. 6, pp. 593–595, 2019, doi: 10.35940/ijeat.F8070.088619.
 L. Datta, “Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice,” Int. J. Educ. Manag. Eng., vol. 5, no. 2, pp. 10–19, 2015, doi: 10.5815/ijeme.2015.02.02.
 G. P. Arya, K. Nilay, and D. Prasad, “An improved round robin CPU scheduling algorithm based on priority of process,” Int. J. Eng. Technol., vol. 7, no. 4, pp. 238–241, 2018, doi: 10.14419/ijet.v7i4.5.20077.
 M. Kumar Mishra and F. Rashid, “An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum,” Int. J. Comput. Sci. Eng. Appl., vol. 4, no. 4, pp. 1–8, 2014, doi: 10.5121/ijcsea.2014.4401.
 Y. S. D. m. LaxmiJeevani, T.S.P. Madhuri, “Improvised Round Robin Scheduling Algorithm and comparison with Existing Round Robin CPU Scheduling Algorithm,” IOSR J. Comput. Eng., vol. 20, no. 3, pp. 1–4, 2018, doi: 10.9790/0661-2003010104.
 Neha and A. Jiyani, “An improved round robin CPU scheduling algorithm based on priority of process,” Int. J. Eng. Technol., vol. 7, no. 4, pp. 238–241, 2018, doi: 10.14419/ijet.v7i4.5.20077.
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
JATIS oleh http://jurnal.mdp.ac.id/index.php/jatisi disebarluaskan di bawah Lisensi Creative Commons Atribusi-BerbagiSerupa 4.0 Internasional.