A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm

Management of the processes is an essential task performed by the scheduler in an Operating System (OS). One of the important units of the OS is Central Processing Unit (CPU), which is scheduling by many algorithms of scheduling. The main purpose of these algorithms is to enhance the system's p...

Full description

Bibliographic Details
Main Authors:	Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa
Format:	Article
Language:	English English
Published:	Inderscience 2016
Subjects:	QA76 Computer software
Online Access:	http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/1/A%20Proposed%20Priority%20Dynamic%20Quantum%20Time%20Algorithm%20to%20Enhance%20Varying%20Time%20Quantum%20Round%20Robin%20Algorithm.pdf http://umpir.ump.edu.my/id/eprint/14976/7/IJCAT540304_Mohammed%20et%20al%20PUBLISHED.pdf

id	ump-14976
recordtype	eprints
spelling	ump-149762018-02-06T01:51:26Z http://umpir.ump.edu.my/id/eprint/14976/ A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa QA76 Computer software Management of the processes is an essential task performed by the scheduler in an Operating System (OS). One of the important units of the OS is Central Processing Unit (CPU), which is scheduling by many algorithms of scheduling. The main purpose of these algorithms is to enhance the system's performance by increasing the utilisation of CPU, increasing the throughput of the system, reducing the turnaround and waiting times and reducing the context switches. Some of the famous scheduling algorithms are First-Come, First-Served, Shortest Job First (SJF), Round Robin (RR) and Priority Scheduling. RR scheduling algorithm is the most suitable choice for time shared system but not for soft real-time systems owing 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. This paper proposes a new algorithm to improve the work of RR by proposing a new algorithm to improve the concept of Improved Round Robin with Varying time Quantum (IRRVQ). The proposed algorithm gave results better than IRRVQ in terms of minimising the number of context switches, average waiting time and average turnaround time. Inderscience 2016 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/14976/1/A%20Proposed%20Priority%20Dynamic%20Quantum%20Time%20Algorithm%20to%20Enhance%20Varying%20Time%20Quantum%20Round%20Robin%20Algorithm.pdf application/pdf en http://umpir.ump.edu.my/id/eprint/14976/7/IJCAT540304_Mohammed%20et%20al%20PUBLISHED.pdf Mohammed, Maysoon A. and Mazlina, Abdul Majid and Balsam, A. Mustafa (2016) A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm. International Journal of Computer Applications in Technology, 54 (3). pp. 184-191. ISSN 0952-8091 (print); 1741-5047 (online) http://dx.doi.org/10.1504/IJCAT.2016.079871 DOI: 10.1504/IJCAT.2016.079871
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Malaysia Pahang
building	UMP Institutional Repository
collection	Online Access
language	English English
topic	QA76 Computer software
spellingShingle	QA76 Computer software Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
description	Management of the processes is an essential task performed by the scheduler in an Operating System (OS). One of the important units of the OS is Central Processing Unit (CPU), which is scheduling by many algorithms of scheduling. The main purpose of these algorithms is to enhance the system's performance by increasing the utilisation of CPU, increasing the throughput of the system, reducing the turnaround and waiting times and reducing the context switches. Some of the famous scheduling algorithms are First-Come, First-Served, Shortest Job First (SJF), Round Robin (RR) and Priority Scheduling. RR scheduling algorithm is the most suitable choice for time shared system but not for soft real-time systems owing 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. This paper proposes a new algorithm to improve the work of RR by proposing a new algorithm to improve the concept of Improved Round Robin with Varying time Quantum (IRRVQ). The proposed algorithm gave results better than IRRVQ in terms of minimising the number of context switches, average waiting time and average turnaround time.
format	Article
author	Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa
author_facet	Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa
author_sort	Mohammed, Maysoon A.
title	A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
title_short	A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
title_full	A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
title_fullStr	A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
title_full_unstemmed	A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm
title_sort	proposed priority dynamic quantum time algorithm to enhance varying time quantum round robin algorithm
publisher	Inderscience
publishDate	2016
url	http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/ http://umpir.ump.edu.my/id/eprint/14976/1/A%20Proposed%20Priority%20Dynamic%20Quantum%20Time%20Algorithm%20to%20Enhance%20Varying%20Time%20Quantum%20Round%20Robin%20Algorithm.pdf http://umpir.ump.edu.my/id/eprint/14976/7/IJCAT540304_Mohammed%20et%20al%20PUBLISHED.pdf
first_indexed	2023-09-18T22:19:09Z
last_indexed	2023-09-18T22:19:09Z
_version_	1777415539821379584

A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm

Similar Items