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
Highlights
Abstrak−Penjadwalan CPU merupakan hal yang penting dalam multitasking dan multiprocessing sebuah sistem operasi karena banyaknya proses yang perlu dijalankan dalam komputer
The experiment was conducted with the First Come First Serve algorithm and the Round Robin of three different
The conclusion is that the First Come First Serve (FCFS)
Summary
Sistem operasi adalah suatu sistem yang mengatur sumber daya komputer yang diperlukan [5]. Penjadwalan proses CPU merupakan bagian dari fungsi dari sistem operasi yang berfungsi untuk mengatur proses-proses yang berjalan pada memory. Penjadwalan CPU merupakan hal yang penting dalam multitasking dan multiprocessing sebuah sistem operasi karena banyaknya proses yang perlu dijalankan dalam komputer. Penjadwalan CPU pada sistem operasi memiliki beberapa algoritma penjadwalan yang berbeda seperti algoritma prioritas, First Come First Serve (FCFS), round robin, dan lain-lain. Seperti contohnya algoritma Round Robin yang memiliki Quantum Time yang dapat memengaruhi hasil Throughput, sedangkan pada algoritma First Come First Serve (FCFS) tidak memilki Quantum Time sehingga nilai Throughput-nya bergantung pada burst Time masing-masing proses. Dari keterangan tersebut tidak berarti algoritma Round Robin selalu lebih unggul dari algoritma First Come First Serve, oleh karena itu kita perlu membandingkan setiap algoritmanya, sehingga kita tahu algoritma mana yang lebih unggul dalam penjadwalan CPU. Penjadwalan CPU dengan melakukan pengukuran terhadap Waiting Time, Turn Around Time, Throughput, dan CPU Utilization
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Building of Informatics, Technology and Science (BITS)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
