Paper Title :Analysis of Process Scheduling Algorithms: SJF with and without Interruptions

Author :Jasmina Novakovic, Suzana Markovic, Aleksandar Vukomanovic

Article Citation :Jasmina Novakovic ,Suzana Markovic ,Aleksandar Vukomanovic , (2019 ) " Analysis of Process Scheduling Algorithms: SJF with and without Interruptions " , International Journal of Management and Applied Science (IJMAS) , pp. 60-62, Volume-5,Issue-3

Abstract : Process scheduling is a key operation for operating systems. The goal of scheduling algorithms is to minimize delay time, response time, and time needed to change the context. SJF (Shortest Job First) is a process scheduling algorithm that selects the one that requires the least execution time in the order of the ready execution process. The SJF algorithm can be with and without interruption. In this paper, the aim of the research is to experimentally analyze the performance of the SJF process scheduling algorithm with and without interruption. Index Terms - Interrupt, Context Change, Process Scheduling, SJF.

Type : Research paper

Published : Volume-5,Issue-3

	|		PDF	|	Viewed - 59	|	Published on 2019-06-08