Date of Publication :9th March 2017

Abstract: Scheduling is one of the most important activities of the process manager which take decision to choose which of the process in the ready queue will be assigned to the CPU. There are different types of scheduling algorithms available for taking decision. One of them is Priority Scheduling Algorithm, which is based on the priority assigned to each process. In priority scheduling the Processes are executed on the basis of priority, the process having highest priority is executed first. In case of similar priority FCFS is used. In this paper, the priority scheduling algorithm is used in such a way that, in case of similar priority SJF algorithm is used instead of FCFS and average waiting time and average turnaround time is calculated. The comparative analysis is performed on the SJF based priority scheduling and FCFS based priority scheduling to compare the average waiting time and average turnaround time

Reference :