Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms

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

Full description

Bibliographic Details
Main Authors:	Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa
Format:	Article
Language:	English
Published:	Foundation of Computer Science 2016
Subjects:	QA75 Electronic computers. Computer science
Online Access:	http://umpir.ump.edu.my/id/eprint/16487/ http://umpir.ump.edu.my/id/eprint/16487/ http://umpir.ump.edu.my/id/eprint/16487/1/mohammed-2016-ijca-907983%20google%20scholar.pdf

id	ump-16487
recordtype	eprints
spelling	ump-164872018-02-06T01:50:07Z http://umpir.ump.edu.my/id/eprint/16487/ Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa QA75 Electronic computers. Computer science In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. In this study, we propose a priority multi queues algorithm with dynamic quantum time. The algorithm uses multi queues with different quantum times for the processes. The quantum times for the processes are depending on the priorities which in turn depending on the burst times of the processes. The proposed algorithm has been compared with varying time quantum algorithm which already exist to improve the original round robin algorithm. With proposed algorithm, the simple Round-Robin algorithm has been improved by about 35%. By controlling quantum time, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput. Foundation of Computer Science 2016 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/16487/1/mohammed-2016-ijca-907983%20google%20scholar.pdf Mohammed, Maysoon A. and Mazlina, Abdul Majid and Balsam, A. Mustafa (2016) Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms. International Journal of Computer Applications, 134 (7). pp. 33-37. ISSN 0975-8887 http://www.ijcaonline.org/archives/volume134/number7/23929-2016907983
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 Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
description	In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughputs. In this study, we propose a priority multi queues algorithm with dynamic quantum time. The algorithm uses multi queues with different quantum times for the processes. The quantum times for the processes are depending on the priorities which in turn depending on the burst times of the processes. The proposed algorithm has been compared with varying time quantum algorithm which already exist to improve the original round robin algorithm. With proposed algorithm, the simple Round-Robin algorithm has been improved by about 35%. By controlling quantum time, 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
author_facet	Mohammed, Maysoon A. Mazlina, Abdul Majid Balsam, A. Mustafa
author_sort	Mohammed, Maysoon A.
title	Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
title_short	Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
title_full	Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
title_fullStr	Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
title_full_unstemmed	Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms
title_sort	multi-queue cpu process prioritization using a dynamic quantum time algorithm compared with varying time quantum and round-robin algorithms
publisher	Foundation of Computer Science
publishDate	2016
url	http://umpir.ump.edu.my/id/eprint/16487/ http://umpir.ump.edu.my/id/eprint/16487/ http://umpir.ump.edu.my/id/eprint/16487/1/mohammed-2016-ijca-907983%20google%20scholar.pdf
first_indexed	2023-09-18T22:22:13Z
last_indexed	2023-09-18T22:22:13Z
_version_	1777415731979223040

Multi-queue CPU Process Prioritization using a Dynamic Quantum Time Algorithm Compared with Varying Time Quantum and Round-Robin Algorithms

Similar Items