ScholarLens Back to search
2014•International Journal of Computer ApplicationsOpen access

A New Improved Round Robin (NIRR) CPU Scheduling Algorithm

Abdulrazaq Abdulrahim, Saleh E. Abdullahi, Junaidu B. Sahalu

Open full text 24 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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.

Key concepts: Computer science, Algorithm, Turnaround time, Fair-share scheduling, Context switch, Round-robin scheduling, Scheduling (production processes), Dynamic priority scheduling

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Improved Round Robin (NIRR) CPU Scheduling Algorithm — Research Paper | ScholarLens