A FINEST TIME QUANTUM FOR IMPROVING SHORTEST REMAINING BURST ROUND ROBIN (SRBRR) ALGORITHM

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 best possible time quantum. Time quantum is computed with the help of median and highest burst time. My experimental analysis shows that ISRBRR performs better than RR algorithm and SRBRR in terms of reducing the number of context switches, average waiting time and average turnaround time.

Keywords: Operating System, Scheduling Algorithm, Round Robin, Context switch, Waiting time, Turnaround time.

Full Text:

pdf2

Refbacks

  • There are currently no refbacks.


© 2017 International Journal of Global Research in Computer Science (JGRCS)
Copyright Agreement & Authorship Responsibility