Comparative Analysis between First-Come-First-Serve (Fcfs) and Shortest-Job-First (Sjf) Scheduling Algorithms

Abstract

Scheduling is a fundamental operating system function, since almost all computer resources are scheduled before use. The CPU is one of the primary computer resources. Central Processing Unit (CPU) scheduling plays an important role by switching the CPU among various processes. A processor is the important resource in computer; the operating system can make the computer more productive. The purpose of the operating system is to allow the process as many as possible running at all the time in order to make best use of CPU. The high efficient CPU scheduler depends on design of the high quality scheduling algorithms which suits the scheduling goals. In this project, two fundamental CPU scheduling algorithms (First-Come-First-Serve and Shortest Job First) for a single CPU were reviewed and compared to show which algorithm is more suitable for certain processes and how their scheduling are being implemented. A theoretical analysis that subject the algorithms to the same condition is performed through the use of exemplary job processes to determine the best among the algorithms. Average Waiting time and Average Turnaround time scheduling criteria were used to evaluate the algorithms and it was discovered that Shortest Job First scheduling algorithm gives more optimal performance of scheduling processes than the First-Come-First-Serve scheduling algorithm.