Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm

Abstract

Scheduling refers to a set of policies and mechanisms to control the order of work to be performed by a Computer system. Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm is a CPU scheduling algorithm that uses the dynamic mean of the burst time to be used as the quantum time for Round Robin. The idea for this approach is to make the CPU Scheduler to arrange the processes in ascending order in the burst time and go to the least time that will be processed then it will calculate the dynamic mean from the burst time to be used for the quantum time for the Round Robin. Shortest job first selects the waiting process with the smallest execution time to execute next with the disadvantage of having starvation for being a greedy-algorithm which therefore implemented with Round Robin that will help the Operating System know the burst time and sort them to eliminate the starvation. There are some scheduling criteria, on the basis of these criteria we analysis and determine which scheduling algorithm is best. The performance of the optimized Shortest Job First Scheduling Algorithm was compared with Round Robin, Shortest Job First, and First Come First in reducing average waiting time, average Turnaround Time and average Response Time in some cases. Compared results from the three test cases showed that our algorithm performs better than Round Robin, and First Come First Serve in some cases but falls behind Shortest Job First where in the optimization of Shortest Job First Dynamic Round Robin (oSJFDRR) scheduling algorithm reduces the average Turnaround Time and average Waiting Time.