Design and Performance Evaluation of Best Job First Dynamic Round Robin BJFDRR Scheduling Algorithm with Optimal Time Quantum Using Mean Average

Abstract

newline Round Robin scheduling is mostly used CPU scheduling algorithm; it gives better result in comparison to other scheduling algorithm. But this algorithm may lead many problems directly related to time quantum. If selected time quantum is large, then the response time of the processes may be too high. On the other hand, if time quantum is short, it increases the number of context switch which may lead overhead of the CPU. newlineThe research work proposed, designed and analyzed in this thesis is focused on the achieving the better CPU Scheduling Criteria such as decreasing Average waiting time, Average Turnaround Time, Number of Context Switches overhead, response time and increasing the throughput and CPU utilization by using the Proposed Best Job First Dynamic Round Robin (BJFDRR) scheduling Algorithm. In this thesis the researcher has aims to identify a Best Job available in ready queue, which is smart enough to have smart priority factor weight age and optimal time quantum in order to optimize the context switching and maximize the throughput. The research work has been implemented in three sections. newlineAt first researcher has proposed the scheduling algorithm namely Smart Job First Dynamic Round Robin (SJFDRR) with Smart Time Quantum. The proposed algorithm is implemented in Uniprocessor System. In the proposed algorithm the researcher has calculated a Smart Priority factor (SPF) for each process. The process which has smallest value of SPF will be schedule first. The process will be executed for a Smart Time Quantum (STQ) which is dynamically calculated in proposed algorithm. The researcher also compares his proposed algorithm with Fittest Job First Dynamic Round Robin (FJFDRR) and inferred that proposed algorithm gives better result than FJFDRR. newlineAt phase second researcher has implemented the SJFDRR Scheduling algorithm in Multilevel Feedback Queue and proposed the new scheduling algorithm namely Smart Job First Multilevel Feedback Queue (SJFMLFQ) with Dynamic Smart Time Quantum. In the proposed algorithm r