Improved Priority Scheduling Algorithm

The main objective of this paper is to introduce a new CPU scheduling algorithm called PSJF (PRIORITY WITH SHORTEST JOB FIRST) Scheduling Algorithm which is preemptive based on priority with less burst time. This scheduling algorithm tries to improve the average waiting time of priority algorithm in multi programming operating system. CPU Scheduling is the one of main task in operating system. The scheduler is responsible for to select one process among all by scheduling. There are several scheduling algorithms available for scheduling jobs like FCFS, SJF, Priority, Round Robin etc. The proposed algorithm is based on priority with less burst time in scheduling. In this paper, the aftereffects of the current need calculation and shortest job are contrasted and the proposed calculation.