A Comparative Study of CPU Scheduling Algorithms

Abstract

Process scheduling is an important feature of Operating System. In multiprogramming many programs run simultaneously. In multiprogramming environment the multiple processes may arrive and terminate frequently. So we have to keep track that the system is always in a balance state. We also have to ensure a good process mix is always present. This paper presents various kinds of schedulers and the comparative study of various scheduling algorithms such as First Come First Serve, Shortest Job First, Round Robin, Priority, Longest Job First, and highest Response Ratio Next with their preemptive and non preemptive modes. All these algorithms are presented with their examples and grant charts. These algorithms are judged on the various factors which are necessary for improving multiprogramming and CPU utilization.

Keywords: Turnaround Time, Preemptive Scheduling, Response Ratio