Agile Time Quantum Round Robin Algorithm
Sulalah Qais Mirkar, Amiksha Bobal, Sanjana Gattani · 2024
In multitasking operating systems, CPU scheduling algorithms are accountable for the queuing of tasks for execution on the CPU. The effectiveness of a CPU scheduling algorithm is measured through CPU utilization, throughput, and process waiting times. One such scheduling algorithm is Round Robin (RR), a preemptive methodology that allocates time in quanta (parts) to execute the processes in a loop. The problems with a static quantum, such as too many context switches and process starvation are addressed by the proposed algorithm named Agile Time Quantum Round Robin (ATQRR). The algorithm dynamically modifies the remaining time based on real-time system factors. To ensure a thorough validation, a comprehensive analysis of the existing literature has been undertaken to compare ATQRR with other similar approaches. This review has focused on many criteria, like average turnaround time, waiting times, throughput, context switch overhead, and the fairness of process scheduling.