Analisis Perbandingan Penjadwalan Proses Menggunakan Algoritma Round Robin dan Priority Preemptive

Abstract

An algorithm is a sequence of steps that have been arranged in an orderly manner to solve a particular problem. To plan an algorithm, something called pseudocode has been used, which is similar to a program code. One of the algorithms that is often used is Round Robin, which has divided processor time fairly between various running processes. On the other hand, there is also a scheduling method using the Priority Preemptive method. In this research, the application of algorithms that have been able to increase efficiency and effectiveness in managing various processes has been discussed. The selection of the right scheduling algorithm has depended on the needs and characteristics of the system that has been used. The Round Robin algorithm has been suitable for systems that prioritize fairness and equality of process time. While the Priority Preemptive algorithm has been more suitable for systems that require fast handling with high priority. In Round Robin scheduling, an Average Waiting Time of 14.6 and an Average Turn Around Time of 22.8 have been obtained. While in Priority Preemptive scheduling, an Average Waiting Time of 10.6 and an Average Turn Around Time of 18.8 have been obtained.