An Improvement of Round Robin Scheduling Algorithm

The processor is one among the foremost imperative parts of computer system. CPU scheduling regulates foremost powerful way to serve the pending appeals of the processes. The maximum algorithm of CPU scheduling emphasis on supreme CPU usage and diminishing waiting time, turnaround time and throughput for a gang of requests. In the time measured scheme, the Round Robin algorithm is the appropriate selection. It is inappropriate for actual time schemes because of higher WT(Waiting Time), higher TT(Turnaround Time) and a large amount of NCS(No. of Context Switches. Selection of TQ (Time Quantum) is incredibly vital. Time quantum influences algorithm's performance. The effectiveness of the algorithm totally relies on the selection of time quantum. Here, an improved version of the Round Robin(RR) algorithm, FMMRR (Forhad Mrinmoy Monowar Round Robin) has been proposed. It needs dynamic TQ rather than static TQ needed in RR. The behavior of our recommended FMMRR algorithm is experimentally distinguished with RR and a few other improved versions of RR. The experimental output of our method demonstrates improved performance in terms of some scheduling criteria such as average TT, average WT, throughput etc. Once enhancement in RR, it's been initiated that WT and TT have been shortened remarkably.