UMP Institutional Repository

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

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


Download (417kB) | Preview


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.

Item Type: Article
Uncontrolled Keywords: round robin; dynamic quantum time; priority; and PDQT
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Dr. Mazlina Abdul Majid
Date Deposited: 09 Feb 2017 06:46
Last Modified: 06 Feb 2018 01:43
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item