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/1/Queueing%20theory%20study%20of%20round%20robin%20versus%20priority%20dynamic%20quantum%20time%20round%20robin%20scheduling%20algorithms.pdf |
| _version_ | 1848819061968863232 |
|---|---|
| author | Maysoon, A. Mohammed Mazlina, Abdul Majid Balsam, A. Mustafa Rana, Fareed Ghani |
| author_facet | Maysoon, A. Mohammed Mazlina, Abdul Majid Balsam, A. Mustafa Rana, Fareed Ghani |
| author_sort | Maysoon, A. Mohammed |
| building | UMP Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T01:47:35Z |
| format | Conference or Workshop Item |
| id | ump-11689 |
| institution | Universiti Malaysia Pahang |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T01:47:35Z |
| publishDate | 2015 |
| publisher | IEEE |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | ump-116892018-02-06T02:00:00Z http://umpir.ump.edu.my/id/eprint/11689/ Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms Maysoon, A. Mohammed Mazlina, Abdul Majid Balsam, A. Mustafa Rana, Fareed Ghani QA76 Computer software 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. IEEE 2015 Conference or Workshop Item PeerReviewed application/pdf en 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 Maysoon, A. Mohammed and Mazlina, Abdul Majid and Balsam, A. Mustafa and Rana, Fareed Ghani (2015) Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms. In: 4th International Conference on Software Engineering and Computer Systems , 19-21 August 2015 , Kuantan, Pahang, Malaysia. pp. 189-194.. ISBN 978-1-4673-6722-6 (Published) http://dx.doi.org/10.1109/ICSECS.2015.7333108 |
| spellingShingle | QA76 Computer software Maysoon, A. Mohammed Mazlina, Abdul Majid Balsam, A. Mustafa Rana, Fareed Ghani Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms |
| title | Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms |
| title_full | Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms |
| title_fullStr | Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms |
| title_full_unstemmed | Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms |
| title_short | Queueing Theory Study of Round Robin Versus Priority Dynamic Quantum Time Round Robin Scheduling Algorithms |
| title_sort | queueing theory study of round robin versus priority dynamic quantum time round robin scheduling algorithms |
| topic | QA76 Computer software |
| url | 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 |