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

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). (Published)

Preview	PDF A Proposed Priority Dynamic Quantum Time Algorithm to Enhance Varying Time Quantum Round Robin Algorithm.pdf Download (41kB) | Preview
	PDF IJCAT540304_Mohammed et al PUBLISHED.pdf - Published Version Restricted to Repository staff only Download (273kB) | Request a copy

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Round robin scheduling; CPU scheduling algorithms; Central processing unit; Priority; Dynamic quantum time; Burst time; Time shared systems; Context switches; Waiting times; Turnaround times
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Faculty/Division:	Faculty of Computer System And Software Engineering
Depositing User:	Mrs. Neng Sury Sulaiman
Date Deposited:	09 Feb 2017 01:39
Last Modified:	06 Feb 2018 01:51
URI:	http://umpir.ump.edu.my/id/eprint/14976
Download Statistic:	View Download Statistics

Actions (login required)

View Item