Research In Motion
The Round Robin (RR) 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 paper proposes a new algorithm that enhanced on the Improved Round Robin CPU (IRR) scheduling algorithm. The proposed algorithm was implemented and benchmarked against basic round robin algorithms available in the literature. The proposed algorithm compared with the basic round robin algorithms, produces minimal Average Waiting Time (AWT), Average Turn-Around Time (ATAT), and Number of Context Switches (NCS).