Analisis Algoritma Round Robin pada Penjadwalan CPU Algoritma Scheduling CPU
Main Article Content
Abstract
ABSTRACT. Scheduling is a key concept in computer multitasking and multiprocessing operating system design and in real-time operating system design by switching the CPU among process. Round Robin Algorithm is a wellknown algorithm in CPU scheduling. Round Robin Algorithm provides a time quantum between context switching. Choosing the time quantum in Round Robin Algorithm is very crucial, large quantum time will result in lower context switching, while small quantum time wil result in higher context switching. For waiting time, the idea for waiting time is to get smaller waiting time which is more efficient. Turn around time also should be minimum, which is more efficient. Two case studies are discussed to understand this algorithm more deeply. We did analysis with data set process 1 till process 5 (P1-P5), with burst time dataset: 20ms, 34ms, 25ms, 62ms, 67ms. In case study 1, we use quantum 25m, and in case study 2, we use quantum 15ms. Context switching in case study 2 is 17 where on case study 1, only 10 context switchings. Total burst-time in case study 1 and case study 2 are 208 ms. Average waiting time in case study 1 is 82 ms, where in case study 2 is 105.8 ms. Average Turn Around Time in case study 1 is 123.6ms, where in case study 2 is 146.6 ms.
Keywords: Round Robin Algorithm, quantum time, context switching, average waiting time, average turn around time
Downloads
Article Details
Authors retain copyright of their work and grant Jurnal Ilmiah Teknologi Informasi Asia the right of first publication. The work is simultaneously licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
While the editorial board endeavors to ensure accuracy, they accept no responsibility for the content of articles. Liability rests solely with the respective authors.
This is an open-access journal. All articles are immediately available to read and reuse upon publication under the CC BY 4.0 license. Users may share and adapt the material for any purpose, including commercial use, provided they comply with the license terms.
References
Amar Ranjan Dash, S. K. (2015). An Optimized Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum. International Journal of Computer Science, Engineering and Information Technology, Vol. 5, No. 1, 7-26.
Arpita Sharma, M. G. (2015). Analysis of Adaptive Round Robin Algorithm and Proposed Round Robin Remaining Time Algorithm. International Journal of Computer Science and Mobile Computing, Vol 4. Issue 12, 139-147.
Datta, L. (2015). Efficient Round Robin Scheduling Algorithm with Dynamic Time Slice. International Journal of Education and Management Engineering, 10-19.
Dhruv, R. (2019). Round Robin Scheduling Algorithm Based on Dynamic Time Quantum. International Journal of Engineering and Advanced Technology, Volume X, Issue X, 593-595.
J. R. Indusree, B. P. (2017). Enhanced Round Robin CPU Scheduling with Burst Time Based Time Quantum. IOP Conference Series: Material Science and Engineering, 1-8.
Md. Sohrawordi, U. A. (2019). A Modified Round Robin CPU Scheduling Algorithm with Dynamic Time Quantum. International Journal of Advanced Research (IJAR), 422-429.
Putra, T. D. (2020). Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling. International Journal of Advanced Research in Computer and Communication Engineering, Vol 9, Issue 4, April, 41-45.
Tithi Paul, R. H. (2019). Improved Round Robin Scheduling Algorithm with Progressive Time Quantum. International Journal of Computer Application Volume 178, No. 49, 30-36.