Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum

Provided by: International Journal of Innovative Technology and Exploring Engineering (IJITEE)
Topic:
Format: PDF
Round robin scheduling algorithm is designed especially for time sharing Operating System (OS). It is a preemptive CPU scheduling algorithm which switches between the processes when static time quantum expires. The round robin scheduling algorithm has its disadvantages that are its longer average waiting time, higher context switches and higher turnaround time. In this paper, a new algorithm is presented called Average Max Round Robin (AMRR) scheduling algorithm. In this scheduling algorithm the main idea is to adjust the time quantum dynamically so that (AMRR) perform better performance than simple round robin scheduling algorithm.

Find By Topic