An Improved Dynamic Round Robin CPU Scheduling Algorithm Based on Variant Time Quantum
Scheduling is considered one of the main factors that affect the performance of real time embedded systems. It plays a vital role by switching the CPU among several processes concentrating on maximizing the CPU utilization and throughput and minimizing the waiting time, turnaround time and number of context switching for a set of processes. Many algorithms are available for CPU scheduling such as First Come First Serve (FCFS) Shortest Job First (SJF) Round Robin (RR) Priority Scheduling etc. Among all these algorithms Round Robin is most popular and widely used algorithm for timesharing systems. This paper presents a new Improved Dynamic Round Robin approach (IDRR) to reduce the average waiting time and turnaround time. The proposed algorithm IDRR is also compared with various variants of Round Robin algorithm. It produces minimal average waiting time and average turnaround time.