Analisis Algoritma Round Robin pada Penjadwalan CPU

Algoritma Scheduling CPU

Authors

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

DOI:

https://doi.org/10.32815/jitika.v15i2.481

Keywords:

Algoritma Round Robin, waktu quantum, context switching, rata-rata waktu tunggu, rata-rata turn around time

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

Download data is not yet available.

References

DAFTAR RUJUKAN
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.

Downloads

Published

02-09-2021

How to Cite

Putra, T. D., & Purnomo, R. (2021). Analisis Algoritma Round Robin pada Penjadwalan CPU: Algoritma Scheduling CPU. Jurnal Ilmiah Teknologi Informasi Asia, 15(2), 85–90. https://doi.org/10.32815/jitika.v15i2.481

Issue

Vol. 15 No. 2 (2021): Volume 15 Nomor 2 (8)

Section

Articles

License

Penulis mengirimkan naskah dan pengertian bahwa jika diterima untuk proses dipublikasi,  hak cipta dari artikel tersebut akan diberikan kepada jurnal ilmiah teknologi informasi asia. Jurnal ilmiah teknologi informasi asia (Jitika) dan Lp2m Stmik Asia Malang sebagai penerbit jurnal, komponen Hak cipta mencakup hak untuk mereproduksi dan mengirimkan artikel dalam semua bentuk dan media, termasuk cetak ulang, foto, mikrofilm, dan reproduksi serupa lainnya, serta terjemahannya.

Jurnal ilmiah teknologi infomasi asia, dan Lp2m ITB Asia Malang, beserta jajaran para redaksi berusaha keras untuk memastikan bahwa tidak ada data, opini, atau pernyataan yang salah atau menyesatkan ketika dipublikasikan di jurnal Jitika, dengan kondisi apapun, isi artikel dan iklan yang diterbitkan di Jurnal ilmiah teknologi infomasi asia adalah murni merupakan tanggung jawab masing-masing penulis dan pengiklan. Pengguna situs web ini akan dilisensikan dengan menggunakan materi dari situs web ini setelah Lisensi Internasional Creative Commons Attribution 4.0. Tidak ada biaya yang dibebankan. Silakan gunakan materi yang sesuai.

Anda bebas untuk:

Bagikan - salin dan sebarkan materi dalam media atau format apa pun.

Adaptasi - remix, transformasikan, dan bangun berdasarkan materi untuk tujuan apa pun, bahkan secara komersial.

Pemberi lisensi tidak dapat mencabut kebebasan ini selama Anda mengikuti ketentuan lisensi