Efficient Round Robin Algorithm (ERRA) using the Average Burst Time
Masroor Aijaz, Ramsha Tariq, Maheen Ghori, Syeda Wasma Rizvi, Engr. Farheen Qazi · 2019
One of the most essential operations performed by operating system is CPU scheduling. Although there are different algorithms available for CPU scheduling but amongst them RR (Round Robin) is considered as best in time shared environment. The choice of time quantum has a huge effect on its effectiveness. A new CPU scheduling algorithm, named as ERRA (Efficient Round Robin Algorithm) has been proposed in this research paper. Instead of static TQ (Time-Quantum), it uses dynamic TQ (Time-Quantum) in ERRA. The performance of both the algorithms (i.e., ERRA RR) are experimentally compared. The results of ERRA presented in this research paper shows better performance in terms of average-waiting-time, average-turnaround-time and context-switching.