A NEW IMPROVED ROUND ROBIN (NIRR) CPU SCHEDULING ALGORITHM
A NEW IMPROVED ROUND ROBIN (NIRR) CPU SCHEDULING ALGORITHM
No Thumbnail Available
Date
2014-09
Authors
ABDULRAZAQ, ABDULRAHIM
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
The Round Robin CPU scheduling algorithm is a fair scheduling algorithm that gives equal time quantum to all processes. The choice of the time quantum is critical as it affects the algorithm’s performance. This thesis proposes a new algorithm that further improved on the Improved Round Robin (IRR) CPU scheduling algorithm by Manish and AbdulKadir. This proposed algorithm was implemented and benchmarked against First-Come-First-Serve (FCFS), Shortest-Job-First (SJF), Round Robin (RR), Improved Round Robin (IRR) and Longest Job First with Combinational Burst Time (LJF+CBT) using three different statistical distributions (namely Normal, Uniform and Exponential distributions) to generate the burst time of the processes. It was observed that the proposed algorithm (i.e. A New Improved Round Robin (NIRR)) compared with the other Round Robin scheduling algorithms, produces best Average Waiting Time (AWT), Average Turnaround Time (ATAT) and Number of Context Switches (NCS) in all categories of the statistical distributions used. Based on these results, the proposed algorithm outperformed other scheduling algorithms for systems that adopt RR CPU scheduling
Description
Keywords
NEW, MPROVED, ROUND, ROBIN (NIRR, CPU, SCHEDULING, ALGORITHM.