Progressive Round Robin CPU Scheduling Algorithm for Operating Systems

This paper introduces the Progressive Round Robin (PRR) algorithm, an advanced approach to CPU scheduling that seeks to optimize system efficiency by dynamically adjusting time quanta. Traditional Round Robin (TRR) scheduling methods assign a fixed quantum of time to processes, often leading to inefficiencies due to varying process demands. Our proposed algorithm, PRR, addresses this by using a Smart Time Quantum (STQ) and Delta mechanism that adapts the time quantum based on the remaining burst times of the processes. This method aims to reduce Average Waiting Time (AWT) and Turnaround Time (TAT) while minimizing context switches. Comparative analysis with standard Round Robin and other variations demonstrates significant improvements in process throughput and system responsiveness, making PRR a viable option for multitasking operating systems.