Design and Performance Evaluation of Precedence Scheduling algorithm with Mean Average as Time Quantum (PSMTQ)
P.Surendra Varma · International journal of advanced research in computer science and electronics engineering · 2012
Round Robin, considered as most widely used CPU scheduling algorithm depends on the time quantum. If the time quantum chosen is too large, the response time of processes is considered too high. On the other hand, if the time quantum is too small, it increases the overhead of the CPU. The performance of the RR can be improved by taking mean average of burst times as time quantum. The precedence scheduling algorithm is the extension of round robin algorithm which incorporates priority and calculates factor of precedence FP for each process which determines order of execution of processes. In this paper, a novel scheduling algorithm is used which uses mean average as a time quantum and uses the Balanced factor of precedence rather than factor of precedence to find the order of execution of processes. The experimental analysis shows that PSMTQ is better than RR and its variants in terms of reducing the number of context switches, average waiting time and average turnaround time.