A K-Factor CPU Scheduling Algorithm

In a multi-tasking environment, it is crucial to optimize the CPU scheduling process. Several algorithms have been proposed and are in use to schedule processes on CPU. This paper aims to evaluate shortest job first (SJF) algorithm and propose an algorithm to overcome the shortcomings of SJF. The simulation results yield useful data for comparison and evaluation. The performance metrics include average turnaround time and average waiting time. The numbers of processes have been varied in the range 10 to 100000, which provides actual scenarios inside a system. For evaluation, simulations have been run many times, between 10 to 100 runs. The results indicate that the starvation created by SJF for longer processes is not present in the proposed algorithm, making it a suitable choice for implementation.