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 inef...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2024 5th IEEE Global Conference for Advancement in Technology (GCAT) s. 1 - 6
Hlavní autori: Kanani, Jash, Makwana, Param, Kalbhor, Yash, Kulkarni, Vikram
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 04.10.2024
Predmet:
Average Waiting Time
Context Switches
CPU Scheduling
Delta
Dynamic scheduling
Heuristic algorithms
Multitasking
Operating systems
Progressive Round Robin
Quantum computing
Real-time systems
Round robin
Smart Time Quantum
System performance
Throughput
Turnaround Time
ISBN:9798350376661
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISBN:9798350376661
DOI:10.1109/GCAT62922.2024.10923888