CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms

CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms

In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too s...

Full description

Bibliographic Details
Main Authors: Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa, Ghani, Rana Fareed
Format: Article
Language:English
Published: The International Journals of Engineering and Sciences (IJENS) 2015
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://umpir.ump.edu.my/id/eprint/16483/
http://umpir.ump.edu.my/id/eprint/16483/
http://umpir.ump.edu.my/id/eprint/16483/1/157706-9191-IJECS-IJENS.pdf
id ump-16483
recordtype eprints
spelling ump-164832018-02-06T01:59:12Z http://umpir.ump.edu.my/id/eprint/16483/ CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa Ghani, Rana Fareed QA75 Electronic computers. Computer science In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. Round Robin scheduling algorithm is the most suitable choice for time shared system but not for soft real time systems due to a large turnaround time, large waiting time and high number of context switches. The choice of the quantum time in RR is the optimal solution for the problem of large turnaround and waiting time with RR. In this study, we propose a priority algorithm with dynamic quantum time (PDQT), to improve the work of RR by improving the concept of Improved Round Robin with varying time quantum (IRRVQ). The proposed algorithm gave results better than RR and IRRVQ in terms of minimizing the number of context switches, average waiting time, average turnaround time, design and analysis. The simple Round-Robin algorithm has been improved by about 40%. By controlling quantum time according to the priorities and burst times of the processes, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput The International Journals of Engineering and Sciences (IJENS) 2015-12 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/16483/1/157706-9191-IJECS-IJENS.pdf Mohammed, Maysoon A. and Mazlina, Abdul Majid and Balsam, A. Mustafa and Ghani, Rana Fareed (2015) CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms. International Journal of Electrical & Computer Sciences IJECS-IJENS, 15 (06). pp. 23-34. ISSN 2227-2739(Print); 2077-1231(Online) http://ijens.org/Vol_15_I_06/157706-9191-IJECS-IJENS.pdf
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
Mohammed, Maysoon A.
Mazlina, Abdul Majid
Balsam, A. Mustafa
Ghani, Rana Fareed
CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
description In Round-Robin Scheduling, the time quantum is fixed and processes are scheduled such that no process uses CPU time more than one time quantum in one go. If time quantum is too large, the response time of the processes will not be tolerated in an interactive environment. If the time quantum is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. Round Robin scheduling algorithm is the most suitable choice for time shared system but not for soft real time systems due to a large turnaround time, large waiting time and high number of context switches. The choice of the quantum time in RR is the optimal solution for the problem of large turnaround and waiting time with RR. In this study, we propose a priority algorithm with dynamic quantum time (PDQT), to improve the work of RR by improving the concept of Improved Round Robin with varying time quantum (IRRVQ). The proposed algorithm gave results better than RR and IRRVQ in terms of minimizing the number of context switches, average waiting time, average turnaround time, design and analysis. The simple Round-Robin algorithm has been improved by about 40%. By controlling quantum time according to the priorities and burst times of the processes, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput
format Article
author Mohammed, Maysoon A.
Mazlina, Abdul Majid
Balsam, A. Mustafa
Ghani, Rana Fareed
author_facet Mohammed, Maysoon A.
Mazlina, Abdul Majid
Balsam, A. Mustafa
Ghani, Rana Fareed
author_sort Mohammed, Maysoon A.
title CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
title_short CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
title_full CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
title_fullStr CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
title_full_unstemmed CPU Burst Processes Prioritization Using Priority Dynamic Quantum Time Algorithm: A Comparison with Varying Time Quantum and Round Robin Algorithms
title_sort cpu burst processes prioritization using priority dynamic quantum time algorithm: a comparison with varying time quantum and round robin algorithms
publisher The International Journals of Engineering and Sciences (IJENS)
publishDate 2015
url http://umpir.ump.edu.my/id/eprint/16483/
http://umpir.ump.edu.my/id/eprint/16483/
http://umpir.ump.edu.my/id/eprint/16483/1/157706-9191-IJECS-IJENS.pdf
first_indexed 2023-09-18T22:22:12Z
last_indexed 2023-09-18T22:22:12Z
_version_ 1777415731517849600

Similar Items