ARCHIVES

A key component of a modern operating systems is CPU scheduling, since it effectively controls the resources of the system and optimizes performance. The classical scheduling algorithms either focus on the speed or priority which can create the starving- starving state where There is never any response to the low priority processes. In order to address this issue, we use a scheduling algorithm called Priority-Sorted Hybrid Round Robin (PSH-RR). which is a new multi-level hybrid algorithm to enhance efficiency and fairness. The processes in PSH-RR model are classified into two, high-priority and low priority. High-priority queue has the Round Robin (RR) scheme which is pre-sorted according to burst time in order to provide responsiveness whereas the Low priority queue has the Shortest Job First (SJF) strategy that provides maximum throughput. The fairness of an integrated aging mechanism is provided through gradual boosting tasks from the low priority queue to the high priority queue in order to minimize starvation. The algorithm was realized and tested using C++ based simulations, and compared to traditional methods of scheduling. It is shown through experimental evidence that PSH-RR leads to more than the average waiting time was decreased by 17–35%, and the average turnaround time for PSH-RR was improved by 13–27% over traditional Round Robin scheduling. This offers an advantage of PSH-RR as a viable solution in cases where the balance between responsiveness, throughput, and fairness is a key factor.