A New Round Robin Based Scheduling Algorithm for Operating Systems: Dynamic Quantum Using the Mean Average

TL;DR

This paper introduces a dynamic quantum scheduling algorithm for operating systems that adjusts the time quantum based on process burst times, improving performance over traditional fixed quantum Round Robin.

Contribution

The paper proposes a novel dynamic-time-quantum approach for Round Robin scheduling, addressing fixed quantum issues and enhancing efficiency.

Findings

Reduces response time for processes with variable burst times

Decreases CPU overhead compared to fixed quantum algorithms

Improves overall scheduling performance in simulations

Abstract

Round Robin, considered as the most widely adopted CPU scheduling algorithm, undergoes severe problems directly related to quantum size. If time quantum chosen is too large, the response time of the processes is considered too high. On the other hand, if this quantum is too small, it increases the overhead of the CPU. In this paper, we propose a new algorithm, called AN, based on a new approach called dynamic-time-quantum; the idea of this approach is to make the operating systems adjusts the time quantum according to the burst time of the set of waiting processes in the ready queue. Based on the simulations and experiments, we show that the new proposed algorithm solves the fixed time quantum problem and increases the performance of Round Robin.