Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms

No default citation style available for Eprints

PDF Queueing theory study of round robin versus priority dynamic quantum time round robin scheduling algorithms.pdf Restricted to Registered users only Download (733kB) | Request a copy

Abstract

The queue size distribution and average waiting time for a time-shared system using round-robin (RR) scheduling, with and without overhead, are determined. In this study, the incoming processes are prioritized, and dynamic quantum times are assigned depending on the level of priority. With these parameters, RR versus priority dynamic quantum time round robin scheduling algorithm is analyzed to explore the effect of changing the quantum time of processes and determine the optimum context switches, turnaround time, and waiting time.

Item Type:	Conference or Workshop Item (Speech)
Uncontrolled Keywords:	queueing theory; Round Robin; Priority Dynamic Quantum Time; quantum time; scheduling algorithms
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Faculty/Division:	Faculty of Computer System And Software Engineering
Depositing User:	Mrs. Neng Sury Sulaiman
Date Deposited:	25 Feb 2016 06:58
Last Modified:	06 Feb 2018 02:00
URI:	http://umpir.ump.edu.my/id/eprint/11689
Download Statistic:	View Download Statistics

Actions (login required)

View Item