Case Study: Improved Round Robin Algorithm

Authors

  • Tri Dharma Putra Universitas Bhayangkara Jakarta Raya
  • Rakhmat Purnomo Universitas Bhayangkara Jakarta Raya

DOI:

10.33395/sinkron.v7i3.11530

Keywords:

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

Abstract

In this journal, discussion is given to analyse the improved round robin algorithm more thoroughly. Round robin algorithm plays a significant role to be used in embedded systems. Round robin algorithm usually applied in real-time systems. Here, three case studies are given, and also the analysis of each case study. Comparisons are given about the average turn around time and average waiting time, also number of context switching between the three case studies. Improved round robin algorithm, is a modification from the generic round robin algorithm. In improved round robin algorithm if the remaining burst time is less than the time slice that is allocated, then the currently running process is continue to be executed. Then finish the currently running process from ready queue and execute the next ready queue. Three case studies are given with three different time quantum, which are 3, 4, and 5 ms. The result of this case study analysis is that, the efficiency of the quantum 5 ms is the most effective one. There is an increase of 50% context switching from quantum 3 to quantum 5. And for average turn around time we get 13.13% reduction in efficiency. While in average waiting time we get reduction 12.08% efficiency.

GS Cited Analysis

Downloads

Download data is not yet available.

References

Arya, G. P., Nilay, K., & Prasad, D. (2018). An improved round robin CPU scheduling algorithm based on priority of process. International Journal of Engineering and Technology(UAE), 7(4), 238–241. https://doi.org/10.14419/ijet.v7i4.5.20077

Datta, L. (2015). Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice. International Journal of Education and Management Engineering, 5(2), 10–19. https://doi.org/10.5815/ijeme.2015.02.02

Dhruv, R. (2019). Round robin scheduling algorithm based on dynamic time quantum. International Journal of Engineering and Advanced Technology, 8(6), 593–595. https://doi.org/10.35940/ijeat.F8070.088619

Indusree, J. R., & Prabadevi, B. (2017). Enhanced round robin CPU scheduling with burst time based time quantum. IOP Conference Series: Materials Science and Engineering, 263(4). https://doi.org/10.1088/1757-899X/263/4/042038

Kumar Mishra, M., & Rashid, F. (2014). An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum. International Journal of Computer Science, Engineering and Applications, 4(4), 1–8. https://doi.org/10.5121/ijcsea.2014.4401

m. LaxmiJeevani, T.S.P. Madhuri, Y. S. D. (2018). Improvised Round Robin Scheduling Algorithm and comparison with Existing Round Robin CPU Scheduling Algorithm. IOSR Journal of Computer Engineering, 20(3), 1–4. https://doi.org/10.9790/0661-2003010104

Neha, A. J. (2018). An Improved Round Robin CPU Scheduling Algorithm. Iconic Research and Engineering Journal, 1(9), 82–86.

Paul, T., Hossain, R., & Samsuddoha, M. (2019). Improved Round Robin Scheduling Algorithm with Progressive Time Quantum. International Journal of Computer Applications, 178(49), 30–36. https://doi.org/10.5120/ijca2019919419

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. (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., & Fadjriya, A. (2021). Comparison Between Simple Round Robin and Intelligent Round Robin Algorithms in CPU Scheduling. IJARCCE, 10(4), 86–90. https://doi.org/10.17148/ijarcce.2021.10413

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

Sharma, A. (2015). Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm. International Journal of Computer Science and Mobile Computing, 4(12), 139–147.

Yaashuwanth, C., & R. Ramesh. (2010). Intelligent Time Slice for Round Robin in Real Time Operating Systems. IJRRAS, 2(2), 126–131.

Downloads


Crossmark Updates

How to Cite

Putra, T. D., & Purnomo, R. (2022). Case Study: Improved Round Robin Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 6(3), 950-956. https://doi.org/10.33395/sinkron.v7i3.11530

Issue

Vol. 6 No. 3 (2022): Article Research Volume 6 Number 3, July 2022

Section

Articles

License

Copyright (c) 2022 Rakhmat Purnomo, Tri Dharma Putra

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Crossref
Scopus
Google Scholar
Europe PMC