Analysis of Preemptive Shortest Job First (SJF) Algorithm in CPU Scheduling
Tri Dharma Putra
Abstract
Scheduling is a key concept in computer multitasking and multiprocessing operating system design and in real-time operating system design by switching the CPU among process. Shortest Job First (SJF) is a wellknown algorithm in CPU processing. There are preemptive Shortest Job First and non preemptive Shortest Job First Algorithms. Preemptive SJF is when the process can be interupted when a new process gets in. When with non preemptive algorithm, the algorithm will continue to be finish eventhough a new process gets in. In this journal, we will discuss premptive Shortest Job First Algoritm in CPU processing. An efficient Shortest Job First is with lower average waiting time and turn around time. Three case studies are discussed to understand this algorithm more deeply.