An Improved Round Robin Algorithm for an Efficient CPU Scheduling

Abstract

The algorithm policy applied by a CPU, to schedule running processes, has an impact on the efficiency of an operating system (OS). As a result, a superior CPU scheduling algorithm leads to higher OS performance while using limited resources and for shorter periods of time. As a result, several strategies have been suggested and implemented to improve CPU scheduling performance. Any scheduler’s primary responsibility is to assign jobs to the most effective and reliable resource available. It’s also a fact that if jobs and resources aren’t planned properly, the entire operating system’s productivity suffers significantly. The "Round Robin" is deemed an effective and fair approach because of each process is allocated the same amount of time quantum. Nevertheless, the effectiveness of the system is determined by the selected time-quantum. The major goal of this research is to develop the present round-robin algorithm by enhancing the time quantum for candidate processes in real-time in such a way that its impartiality is maintained. There is no loss of property. This paper’s proposed algorithm finds the time left in a process’s last turn, and then Determines whether it is time-based on a certain threshold value, should quantum be expanded or not. An arithmetic simulation has been created to demonstrate that the suggested method is correct. It outperforms the traditional round-robin algorithm. In words of several performing metrics such as average waiting time, context switches and the number of turnaround times, the suggested adjusted version of the round- robin algorithm outperforms the traditional round-robin algorithm, according to the results of the experimental investigation.