A Novel Method to improve the Round Robin CPU Scheduling Quantum time using Arithmetic Mean”

Abstract

Abstract: CPU Scheduling is one of the most important topics in Operating Systems. The selection of processes for implementation in Round-robin format is one of the greatest method. Operating System is the intermediary between the hardware program application program of computer systems. This interaction demands high level of scheduling for the processes that take part in this interaction. There are many algorithms that are introduced for optimum scheduling of processes, one of them is Round Robin and many of its variants. An algorithm which is variant of RR is introduced in this research paper. In this document we planned a new methodology to finding quantum time in each cycle based on arithmetic mean. This proposed algorithm after analyzing and experimenting give lesser turnaround time and waiting time for processes, when their arrival time is zero and when non-zero. This proposed algorithm satisfies scheduling criteria for CPU scheduling which is surety of its better performance than traditional Round Robin.