Analyzing CPU scheduling algorithms according to waiting times - A case study

In multiprocessing operating systems, maximum CPU utilization is one of the most important goals. To obtain the maximum rate, the processes in the CPU queue must be scheduled properly. There are several scheduling algorithms to decide this process order as First-Come First-Served Scheduling, Last-Come First-Served Scheduling, Shortest Job Scheduling, Random Scheduling etc. This paper presents a case study to examine which of these scheduling methods is the most efficient one between these policies according to total waiting times.