Title: A proposed priority dynamic quantum time algorithm to enhance varying time quantum round robin algorithm

Authors: Maysoon A. Mohammed; Mazlina AbdulMajid; Balsam A. Mustafa

Addresses: Faculty of Computer Systems & Software Engineering, Universiti Malaysia Pahang, Kuantan City 26300, Malaysia; Department of Mechanical Engineering, University of Technology, Baghdad City 10066, Iraq ' Faculty of Computer Systems & Software Engineering, Universiti Malaysia Pahang, Kuantan City 26300, Malaysia ' Faculty of Computer Systems & Software Engineering, Universiti Malaysia Pahang, Kuantan City 26300, Malaysia

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.

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.

DOI: 10.1504/IJCAT.2016.079871

International Journal of Computer Applications in Technology, 2016 Vol.54 No.3, pp.184 - 191

Received: 01 Oct 2015
Accepted: 06 Jan 2016
Published online: 19 Oct 2016 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article