CPU Scheduling Algorithm Round Robin with Dynamic Time Quantum

Abstract

CPU programming in the operating system is one of the basic factors for determining the performance of the multitasking operating system which makes a computer system more productive by changing the CPU between processes. An operating system manages all operations that continuously and consistently manage the available resources provided by the system in an optimal approach. Process planning is the important operating system functionality for process management. The most popular algorithms are First Come First Serve(FCFS), Priority Based Scheduling, Round Robin(RR) and Shortest Job First(SJF). The performance of the programming algorithms depends on minimizing response times, waiting times, response times, changing the context and optimizing CPU usage. Round Robin (RR) programming is mostly used as CPU programming algorithm in the operating system. The efficiency of a multitasking system that includes Round Robin CPU programming is based on selecting the optimal time. In this article, we study a new CPU programming algorithm, set up as DABRR (Dynamic Average Burst Round Robin) and we also elaborated comparison of DABRR through the static Round Robin algorithm. It takes dynamic quantum time in place of the static quantum time used in RR. The results presented in this paper demonstrate the improvement of the algorithm's statistics in terms of average waiting time, average response time.