Adaptive Round Robin CPU Scheduling using AMS Time Quantum

Operating system scheduling is designed for allocation of available processes to the CPU resources. Efficiency of CPU Scheduler depends on the design of the high quality scheduling algorithm which suits the scheduling goals. The main goal of scheduling algorithm is to maximize CPU utilization and throughput along with minimizing turnaround time, waiting time and number of context switching for a set of requests. There are some popular CPU scheduling algorithms available which are FCFS, SFJ, Priority scheduling and RR. Among all of them Round Robin being the most popular choice, but it is not able to give us the better reading of turnaround time and waiting time. So, this article is about improving performance of scheduling algorithm in terms of turnaround time, waiting time and number of context switching by adapting the method of Round Robin algorithm. The performance of Adaptive Round Robin algorithm is compared with RR, using CPU Scheduling Simulator which is developed using Java and Java Swing.