A Modified Priority Preemptive Algorithm for CPU Scheduling

Abstract Priority Preemptive scheduling algorithm is a popular among various other algorithms for scheduling CPU, however it leads to the problem of starvation which happens when processes with lower priority are not given any chance of CPU utilization due to continuous CPU usage by processes with higher priorities. To eradicate this problem here, we have proposed a new algorithm for scheduling CPU which we call it as Modified Priority Preemptive Scheduling Algorithm based on a new approach where we are executing priority Preemptive scheduling in a round robin fashion taking the time quanta equal to the shortest burst time of all the available processes. On analyzing the results, it is observed that modified Preemptive algorithm not only solves the problem of starvation but also enhances the performance of regular Priority Preemptive algorithm by lowering the mean turnaround time and mean waiting time.