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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
IEEE
2015
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/11689/ 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 |
| Summary: | 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. |
|---|