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

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

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 par...

Full description

Bibliographic Details
Main Authors: Maysoon, A. Mohammed, Mazlina, Abdul Majid, Balsam, A. Mustafa, Rana, Fareed Ghani
Format: Conference or Workshop Item
Language:English
Published: IEEE 2015
Subjects:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/11689/
http://umpir.ump.edu.my/id/eprint/11689/1/Queueing%20theory%20study%20of%20round%20robin%20versus%20priority%20dynamic%20quantum%20time%20round%20robin%20scheduling%20algorithms.pdf

Similar Items

Similar Items