Comparative Performance Analysis of Average Max Round Robin Scheduling Algorithm (AMRR) using Dynamic Time Quantum with Round Robin Scheduling Algorithm using static Time Quantum
Pallab Banerjee1, Probal Banerjee2, Shweta Sonali Dhal3
1Pallab Banerjee, Lecturer, CSE Department, Cambridge Institute of Technology, Ranchi.
2Probal Banerjee, Lecturer, ECE Department, Cambridge Institute of Technology, Ranchi.
3Shweta Sonali Dhal, Lecturer, EEE Department, Cambridge Institute of Technology, Ranchi.
Manuscript received on August 02, 2012. | Revised Manuscript received on August 06, 2012. | Manuscript published on August 10, 2012. | PP: 56-62 | Volume-1 Issue-3, August 2012. | Retrieval Number: C0220071312/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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 is its longer average waiting time, higher context switches, 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.
Keywords: Operating System, Round Robin, Average Max Round Robin, Turnaround time, Waiting time, Context Switch.