Lucid dynamic time quantum based round Robin algorithm

Abstract

Round Robin (RR) algorithm is the most used algorithm among time shared systems because of its influential feature of Time Quantum (TQ) that it possessed. Nevertheless, every algorithm has its deficiency or paucity and RR algorithm being the most widely used algorithm in time shared system, it has the problem of overheads of more context switches (CS) when the TQ is small, and starvation when the TQ is large because. In this study, we evaluate the performance of a novel approach of CPU scheduling algorithm; Lucid Dynamic Round Robin (LDRR); an improved Round Robin scheduling algorithm whose Time quantum (TQ) was compromised and adjusted base on its burst times, against the well-known Round Robin algorithm, and other subsequent improved Round Robin algorithms. The performance of the proposed algorithm was compared with the well-known Round Robin algorithm, and its subsequent improved algorithms. The proposed algorithm reduces delays for longer processes, which outperformed RR by an average of 35.62%, EQRR by 3.95%, and SJF-RR by 25.93%, which proves an effective and successful process completion. The proposed technique performs well in asymmetric, skewed, and clustered burst time distributions, which are prevalent in contemporary systems where existing dynamic quantum techniques frequently fall short. Compared to many previous heuristics, LDRR gives researchers flexible alternatives for varied workload characteristics that offers distinct adjustment techniques, it is also more deployable in real-time and time-sharing environments because it is self-tuning and does not require manual configuration of quantum values.