A Comparative Parameters Analysis of Different Round Robin Scheduling Algorithm using Dynamic Time Quantum

Scheduling is the most important concept in computer system. The concept of scheduling helps in selection of the process for execution. Selection of process is number of ways. Most popular scheduling techniques are First Come First Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (RR) etc. These algorithm outputs depends mainly three parameters, first is average waiting time, second average turnaround time and other is context switch. In this paper, we focus on RR scheduling techniques. There are two types, one is RR with static time quantum and other is RR with dynamic time quantum. In this paper we compare with different dynamic time quantum techniques and we show that average mid-max scheduling is the best scheduling technique compare to simple RR, min-max RR and efficient RR.