A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis

Abstract

Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to context switching, which is an overhead and it occurs during each scheduling. Overall performance of the system depends on choice of an optimal time quantum, so that context switching can be reduced. In this paper, we have proposed a new variant of RR scheduling algorithm, known as Dynamic Quantum with Readjusted Round Robin (DQRRR) algorithm.We have experimentally shown that performance of DQRRR is better than RR by reducing number of context switching, average waiting time and average turnaround time. General TermsScheduling, Round Robin Scheduling.

An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum

“…al. [7] did the similar work as [3] [4]. The optimal time quantum is assigned to each process after every cycle of execution.…”

“…The scheduling algorithm proposed in [11] uses two processors, one processor is dedicated to execute CPU-intensive processes only and the other processor is dedicated to executed I/O-intensive process. This gives better result in a two processor environment than [4]. A New Round Robin based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average [12] introduce a new concept of calculating the average burst time of the processes from the ready queue after every cycle and allocated as dynamic time quantum.…”

“…Time quantum is continuously adjusted according to the burst time of the processes in Self-Adjustment Time Quantum in Round Robin Algorithm [3]. The job mix order for the algorithm in [3] is used in Dynamic Quantum with Readjusted Round Robin Scheduling Algorithm [4]. Robust quantum time value has been proposed in [5] after arranging the process in the ascending order and taking the average of minimum and maximum burst time of the processes in the ready queue.…”

A New Improved Round Robin (NIRR) CPU Scheduling Algorithm

“…Behera et al [3] developed an algorithm that arranges the processes in the ready queue in ascending order of burst time. Then, the time quantum is calculated.…”

An Enhanced Round Robin CPU Scheduling Algorithm

“…Time quantum is calculated using the median and the highest burst time. In [13], Ready queue is sorted according to processes' burst time and median is calculated. Time slice is equal to the median of all the processes present in ready queue.…”