Dynamic Quantum Time Round Robin Scheduling Algorithm

Abstract

Processor scheduling algorithms aim at organizing the entry of processes into the processor. The Round Robin (RR) algorithm which is the most frequently used algorithm, has been developed to give the less waiting time and a faster response time comparing to the First-Come-First-Served FCFS and Shortest Job First (SJF) scheduling algorithms. The performance analysis of these three algorithms shows that RR is similar to FCFS except that preemption is added to switch between processes. However, due the fixed quantum time unit assigned per process, RR may suffer a high turnaround and waiting time. This paper presents a dynamic Quantum Round Robin algorithm that dynamically generates Quantum time units based on Burst time values for queues.