An Improved Way to Implement Round Robin Scheduling Algorithm

The Scheduling algorithm is primarily responsible for the system’s effectiveness. The Round Robin (RR) algorithm is considerably more effective than the currently available ones. Every task in the Round Robin algorithm is given a set amount of time to complete the part of execution. The process needs to be taken out of ready queue if it is finished, otherwise it’s added to the end of ready queue, and waits for the process’s execution turn. In this chapter, we propose a technique related to the dynamic time quantum approach of Round Robin that works well. The dynamic time quantum (TQ) approach autonomously figures out the time quantum for each cycle based on a prescribed formula. In the proposed technique, TQ is calculated in each cycle and is compared to each process burst time for its execution. Further, the dynamic TQ reduced the Average Waiting Time, Average Turnaround Time, and Number of Context Switches.