期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2015
卷号：76
期号：1
出版社：Journal of Theoretical and Applied
摘要：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 turnaround time (ATAT), and number of context switches (NCS). From the obtained results we observed that proposed algorithm met better scheduling criterion than the basic round robin scheduling algorithm.
