A New Improved Round Robin (NIRR) CPU Scheduling Algorithm

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.

An Improved Round Robin CPU Scheduling Algorithm with Varying Time Quantum

“…It reduces the waiting time of the process in the ready queue and hence improve the performance. An Additional Improvement in Round Robin (AAIRR) CPU Scheduling Algorithm [15] proposed an improvement in the conventional RR and IRR [14]. This approach is similar to the IRR but it picks the process from the ready queue whose remaining burst time is shortest.…”

“…This approach is similar to the IRR but it picks the process from the ready queue whose remaining burst time is shortest. The algorithm proposed in [16] is again an improvement of IRR [14] which uses two queues, ARRIVE queue and REQUEST queue. It is giving significance performance improvement compared to IRR.…”

Achieving Stability in the Round Robin Algorithm

“…It preempts the currently executing process to execute another one, whereas a non-preemptive SJF algorithm allows the process to execute till completion [4] [5] [6]. Priority Scheduling Algorithm: it is a non-preemptive algorithm.…”

“…When the CPU is available, it is assigned to the process that has the smallest next execution time. If there are two processes have the same execution time, it will be executed on a first come first served basis [4] [5] [6].…”

“…This algorithm is so easy because it selects the first process regardless of its execution time. It has low throughput because long processes can keep the processor occupied for a long time causing small processes to suffer and have high average waiting time, so the FCFS algorithm has a poor performance [4] [5].…”