Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms

Abstract

Operating system is a software acting as an interface between computer hardware and user. Operating system is known as a resource manager. The main responsibility of operating system is to handle resources of computer system. Scheduling is a key concept in computer multitasking and multiprocessing operating system design by switching the CPU among process. Shortest job first (SJF) and round robin are two wellknown algorithms in CPU processing. For shortest job first, this algorithm can be preemptived. In preemptive shortest job first, when a new process coming in, the process can be interupted. Where with round robin algorithm there will be time slices, context switching, or also called quantum, between process. In this journal we wil discuss comparative study between preemptive shortest job first and round robin algorithms. Three comparative studies will be discussed to understand these two algorithms more deeply. For all comparative study, the average waiting time and average turnaround time is more for round robin algorithm. In the first comparative study, we get average waiting time 52% more. For average turnaround time, 30% more. In second comparative analysis, we get 52 % average waiting time more and we get 35 % average turnaround time more. For third comparative analysis, average waiting time we get 50% more and for average turnaround time, we get 28% more. Thus it is concluded in our comparative study for these kind of data the preemptive shortest job first is more efficient then the round robin algorithm.
 
 Keywords: comparative study, premptive shortest job first algorithm, round robin algorithm, turn around time, average waiting time, time slice