Mean-Difference Round Robin (MDRR) Algorithm with Dynamic Time Slice for Task Scheduling Using Real time applications

Process scheduling means allocating a certain amount of CPU time to each of the user Processes. This paper proposes a CPU Scheduling algorithm, which is meant for optimizing CPU scheduling for real time applications. It is a new approach, which uses the concept of Mean Difference Round Robin (MDRR) with dynamic time quantum, whose value changes for each cycle. It acts better than RR and Mean Difference Round Robin (MDRR) Algorithm in terms of reducing the number of context switches, average waiting time and average turnaround time. The experimental results of the proposed algorithm have been compared with Mean-Difference Round Robin (MDRR) Algorithm is found to have produced optimum scheduling.