CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm

CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm

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...

Full description

Bibliographic Details
Main Authors: Mohammed, Maysoon A., Mazlina, Abdul Majid, Balsam, A. Mustafa, Ghani, Rana Fareed
Format: Article
Language:English
Published: Asian Research Publishing Network 2016
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://umpir.ump.edu.my/id/eprint/16486/
http://umpir.ump.edu.my/id/eprint/16486/
http://umpir.ump.edu.my/id/eprint/16486/1/jeas_1116_5351.pdf
id ump-16486
recordtype eprints
spelling ump-164862018-02-06T01:43:29Z http://umpir.ump.edu.my/id/eprint/16486/ CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm 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. In this study, we propose a priority Round-Robin algorithm with dynamic quantum time (PDQT). The algorithm used the old fixed quantum time to generate new one for each process depending on its priority. The simple Round-Robin algorithm has been improved by about 20%. By controlling quantum time, we experience fewer context switches and shorter waiting and turnaround times, thereby obtaining higher throughput. Asian Research Publishing Network 2016-11 Article PeerReviewed application/pdf en http://umpir.ump.edu.my/id/eprint/16486/1/jeas_1116_5351.pdf Mohammed, Maysoon A. and Mazlina, Abdul Majid and Balsam, A. Mustafa and Ghani, Rana Fareed (2016) CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm. ARPN Journal of Engineering and Applied Sciences, 11 (22). pp. 13084-13089. ISSN 1819-6608 http://www.arpnjournals.org/jeas/research_papers/rp_2016/jeas_1116_5351.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 Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
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. In this study, we propose a priority Round-Robin algorithm with dynamic quantum time (PDQT). The algorithm used the old fixed quantum time to generate new one for each process depending on its priority. The simple Round-Robin algorithm has been improved by about 20%. 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
Ghani, Rana Fareed
author_facet Mohammed, Maysoon A.
Mazlina, Abdul Majid
Balsam, A. Mustafa
Ghani, Rana Fareed
author_sort Mohammed, Maysoon A.
title CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
title_short CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
title_full CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
title_fullStr CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
title_full_unstemmed CPU Thread Prioritization Using a Dynamic Quantum Time Round-Robin Algorithm
title_sort cpu thread prioritization using a dynamic quantum time round-robin algorithm
publisher Asian Research Publishing Network
publishDate 2016
url http://umpir.ump.edu.my/id/eprint/16486/
http://umpir.ump.edu.my/id/eprint/16486/
http://umpir.ump.edu.my/id/eprint/16486/1/jeas_1116_5351.pdf
first_indexed 2023-09-18T22:22:13Z
last_indexed 2023-09-18T22:22:13Z
_version_ 1777415731825082368

Similar Items