A comparison of common processor scheduling algorithms

Abstract

This paper describes some projects given in an operating systems course that deal with processor scheduling in a multiprogramming environment. We use a Java program to simulate a number of CPU scheduling algorithms including first-come first-served, shortest process next, round robin, shortest remaining time next, highest response ratio next, and feedback queue. We describe a single processor system and explain different performance criteria including response time, turnaround time, throughput, and processor utilization. Students can use the simulator to study the impact of additional soft constraints such as deadlines on the performance of a given algorithm.