A Comparative Study on Variant's of Dynamic RR Scheduling Algorithms for Multiprogramming System

Simple item page
dc.contributor.authorDhami, Ganesh Bahadur
dc.date.accessioned2023-03-31T09:39:42Z
dc.date.available2023-03-31T09:39:42Z
dc.date.issued2016
dc.description.abstractRound 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.en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14540/16080
dc.language.isoen_USen_US
dc.publisherCentral Department of Computer Science and Information Technologyen_US
dc.subjectRR schedulingen_US
dc.subjectMultiprogramming systemen_US
dc.subjectAlgorithmsen_US
dc.titleA Comparative Study on Variant's of Dynamic RR Scheduling Algorithms for Multiprogramming Systemen_US
dc.typeThesisen_US
local.academic.levelMastersen_US
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
chapter page.pdf
Size:
1.66 MB
Format:
Adobe Portable Document Format
Description:
Download
No Thumbnail Available
Name:
cover page.pdf
Size:
249.3 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Computer Science & Information Technology