Scheduling Algorithms Comparisons and Analysis using Simulation Results

Abstract

Heuristics Process scheduling is one of the key components of any operating system design. It defines the way the CPU resources are shared among processes in the system. In this paper, we present the performance comparison of five different process scheduling algorithms: FIFO, Round Robin, Shortest Remaining Time, Shortest Processing Time, and Highest Response Ratio Next. We evaluated these algorithms based on the simulations and calculated their effect on three key metrics: turnaround time, waiting time, and CPU utilization. The results showed that each of them has its pros and cons, thus making the optimal choice of scheduling algorithm impossible. This paper can be used by operating system designers or professionals in selecting an appropriate scheduling algorithm for a certain system and learning objectives.