Analisis Perbandingan Algoritma Penjadwalan CPU First Come First Serve (FCFS) Dan Round Robin
-
Muhammad Taufik Dwi Putra
*
Universitas Pendidikan Indonesia, Bandung,
Indonesia
- Haryanto Hidayat Universitas Pendidikan Indonesia, Bandung, Indonesia
- Naziva Septian Universitas Pendidikan Indonesia, Bandung, Indonesia
- Tiara Afriani Universitas Pendidikan Indonesia, Bandung, Indonesia (*) Corresponding Author
Abstract
CPU scheduling is important in multitasking and multiprocessing an operating system because of the many processes that need to be run in a computer. This causes the operating system to need to divide resources for running processes. CPU scheduling has several algorithms in it such as First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR) algorithms. The writing of this study is intended to compare the First Come First Serve and Round Robin algorithms with four specified parameters namely Average Turn Around Time, Waiting Time, Throughput, and CPU Utilization. The experiment was conducted with the First Come First Serve algorithm and the Round Robin of three different Quantum Times. These calculations at different quantum times aim to find out if the differences affect the advantages of the Round Robin algorithm over the First Come First Serve algorithm. The conclusion is that the First Come First Serve (FCFS) algorithm is superior to the Round Robin (RR) algorithm. This is indicated by the average turn around time, waiting time, and throughput values of the First Come First Serve algorithm more effective in running the process
Downloads
References
Fratiwi, D., & Mariana, N. (2020). Metode Fcfs Dalam Menunjang Sistem Layanan Antrian Pembagian Dana Pensiun Studi Kasus Kantor Pos Bongsari. Proceeding SENDIU, 978–979.
Hadi, R., & Nugrahaeni, Y. (2016). Aplikasi Penjadwalan Terapi dengan Metode FCFS pada Sixo Reflexology. Journal of Applied Intelligent System, 1(2), 134–143. http://publikasi.dinus.ac.id/index.php/jais/article/view/1190/894
Harki, N., Ahmed, A., & Haji, L. (2020). CPU Scheduling Techniques: A Review on Novel Approaches Strategy and Performance Assessment. Journal of Applied Science and Technology Trends, 1(2), 48–55. https://doi.org/10.38094/jastt1215
Masrizal (2017). Simulasi Perbandingan Penjadwalan Round Robin dan FCFS untuk Manajemen Proses dalam Single Processing. Jaringan Sistem Informasi Robotik, 1.
Putra, T. D., & Purnomo, R. (2021). Analisis Algoritma Round Robin pada Penjadwalan CPU. Jurnal Ilmiah Teknologi Informasi Asia, 15(2), 85–90.
Rajput, I. S., & Gupta, D. (2012). A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems. Journal of Advanced Engineering Technologies, 1(3), 1–11.
Riadi, S., & Ulum, F. (2021). ANALISIS PENERAPAN ALGORITMA FIRST COME FIRST SERVED ( FCFS ) DALAM PROSES PESANAN PADA APLIKASI GOJEK. 2(2), 268–275.
Santika, M., & Hansun, S. (2014). Implementasi Algoritma Shortest Job First dan Round Robin pada Sistem Penjadwalan Pengiriman Barang. Jurnal ULTIMATICS, 6(2), 94–99. https://doi.org/10.31937/ti.v6i2.336
Sofiansyah Fadli, Maulana Ashari, K. I. (2020). 136-13-1117-1-10-20200714. Sistem Penjadwalan Event Organizer Dengan Metode Round Robin (Rr), 3(2).
Wijaya, A., Gunawan (2018). Implementasi Algoritma Round Robin Pada Sistem Penjadwalan Mata Kuliah (Studi Kasus: Universitas Muhammadiyah Bengkulu). JURNAL INFORMATIKA UPGRIS Vol. 4, No.1, 65
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Analisis Perbandingan Algoritma Penjadwalan CPU First Come First Serve (FCFS) Dan Round Robin
Pages: 207-212
Copyright (c) 2021 Muhammad Taufik Dwi Putra, Haryanto Hidayat, Naziva Septian, Tiara Afriani
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
