A Comparative Study on Variant's of Dynamic RR Scheduling Algorithms for Multiprogramming System
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Central Department of Computer Science and Information Technology
Abstract
Round Robin scheduling algorithm is used in multitasking computers for executing
several programs at the same time in interactive ways. In some multiprogramming
systems one of the processes is called the foreground processes and others are called
background processes. The foreground processes is the one that accepts input.
Background processes cannot accept interactive input from a user but can access data
stored on the disk. Background processes generally have a lower priorities than fore
ground processes so that they do not interfere with interactive applications. Round Robin
algorithm also used in load balancing technique in DNS server in data communication
system. Many researchers has purposed and developed the varieties of Round Robin
algorithms whose key factor is depending on the optimal quantum size. This research
study includes the performance evaluation of the different algorithms based on different
parameters. This comparative analysis study consists of three variants of dynamic round
robin scheduling algorithms namely DRR, Mean based RR and Median based RR. The
data for the analysis are randomly generated and analyzed on different scheduling
parameters. The analysis result shows Median based RR algorithm has better
performance over DRR. Average waiting time and average turnaround time of Median
based RR has up to 19.04% and 25.50% less than DRR similarly up to 17.74% and
17.14% less than mean based RR. The optimal quantum corresponds to median based
RR.