![]() |
10.5120/15563-4277 |
Abdulrazaq Abdulrahim, Saleh E Abdullahi and Junaidu B Sahalu. Article: A New Improved Round Robin (NIRR) CPU Scheduling Algorithm. International Journal of Computer Applications 90(4):27-33, March 2014. Full text available. BibTeX
@article{key:article, author = {Abdulrazaq Abdulrahim and Saleh E. Abdullahi and Junaidu B. Sahalu}, title = {Article: A New Improved Round Robin (NIRR) CPU Scheduling Algorithm}, journal = {International Journal of Computer Applications}, year = {2014}, volume = {90}, number = {4}, pages = {27-33}, month = {March}, note = {Full text available} }
Abstract
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 further improved on the Improved Round Robin CPU (IRR) scheduling algorithm by Manish and AbdulKadir. The proposed algorithm was implemented and benchmarked against five other algorithms available in the literature. The proposed algorithm compared with the other algorithms, produces minimal average waiting time (AWT), average turnaround time (ATAT), and number of context switches (NCS). Based on these results, the proposed algorithm should be preferred over other scheduling algorithms for systems that adopt RR CPU scheduling.
References
- Abdullahi, I. , and Junaidu, S. B (2013): Empirical Framework to Migrate Problems in Longer Job First Scheduling Algorithm (LJF+CBT), International Journal of Computer Applications (0975 – 8887) Volume 75– No. 14, pp 9-14.
- Ajit, S, Priyanka, G and Sahil, B (2010): An Optimized Round Robin Scheduling Algorithm for CPU Scheduling, International Journal on Computer Science and Engineering (IJCSE), Vol. 02, No. 07, 2383-2385, pp 2382-2385.
- Behera, H. S, Mohanty, R and Debashree, N (2010): A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis, International Journal of Computer Applications (0975 – 8887) Volume 5, No. 5, pp 10-15.
- Ishwari, S. R and Deepa, G (2012): A Priority based Round Robin CPU Scheduling Algorithm for Real Time Systems, International Journal of Innovations in Engineering and Technology (IJIET), Vol. 1 Issue 3, pp 1-11.
- Lalit, K, Rajendra, S and Praveen, S (2011): Optimized Scheduling Algorithm, International Journal of Computer Applications, pp 106-109.
- Manish K. M. and Abdul Kadir K. (2012): An Improved Round Robin CPU Scheduling Algorithm, Journal of Global Research in Computer Science, ISSN: 2229-371X, Volume 3, No. 6, pp 64-69.
- Operating Systems_ CPU Scheduling, http://www. cs. uic. edu/~jbell/CourseNotes/OperatingSystems/5_CPU_Scheduling. html?, accessed 8th October 2013.
- Soraj, H and Roy, K. C: Adaptive Round Robin scheduling using shortest burst approach, based on smart time slice", International Journal of Data Engineering (IJDE), Volume 2, Issue 3, www. cscjournals. org/csc/manuscript/Journals/IJDE/. . . /IJDE-57. pdf?, accessed 10th December 2012.
- Suri, P. K and Sumit, M (2012): Design of Stochastic Simulator for Analyzing the Impact of Scalability on CPU Scheduling Algorithms, International Journal of Computer Applications (0975 – 8887) Volume 49, No. 17, pp 4-9.