Comparative Study of Enhanced Round Robin Algorithms with Drrha and Other Metaheuristic Algorithms

CPU scheduling has a substantial influence on system resource usage and overall performance. Scheduling Algorithms are a technique for reducing CPU resource deprivation while simultaneously maintaining fairness among the numerous programs that utilize the resources. Round Robin is a preemptive scheduling method that significantly improves response time by restricting each operation to a certain length of time known as the Time Quantum. Various efforts have been made to calculate a time quantum value to optimize these Round Robin algorithm parameters. However, this gain in response time comes at the expense of turnaround and waiting time. In this paper, we compare the conventional Round Robin CPU scheduling algorithm to updated Round Robin algorithms such as DRRHA, as well as our suggested approaches termed MDRRHA and NDRRHA, which seek to reduce process waiting time. The Quantum value for MDRRHA and NDRRHA is derived dynamically using the arithmetic mean and the normal distribution of execution time values of tasks, respectively. The recommended solutions decrease average turnaround time and average waiting time values by up to 13%. In this research, we compare different job scheduling approaches by simulating them in a variety of test situations.