Improved Shortest Remaining Burst Round Robin (ISRBRR) Using Optimal Time quantum

Main Article Content

P.Surendra Varma

Abstract

Round Robin (RR) performs optimally in timeshared systems because each process is given an equal amount of static time quantum. But the effectiveness of RR algorithm solely depends upon the choice of time quantum. I have made a comprehensive study and analysis of RR algorithm and SRBRR algorithm. I have proposed an improved version of SRBRR (Shortest Remaining Burst Round Robin) by assigning the processor to processes with shortest remaining burst in round robin manner using the optimal time quantum. Time quantum is computed with the help of median and highest burst time.

 

Keywords: Operating System, Scheduling Algorithm, Round Robin, Context switch, optimal tq

Downloads

Download data is not yet available.

Article Details

Section
Articles