Design and Performance Evaluation of Multi Cyclic Round Robin (MCRR) Algorithm Using Dynamic Time Quantum
|H. S. Behera#1, Rakesh Mohanty#2, Sabyasachi Sahu#3, Sourav Kumar Bhoi#4
Department of Computer Science and Engineering,Veer Surendra Sai University of Technology, Burla, Sambalpur, Orissa, India
|Related article at Pubmed, Scholar Google|
The efficiency and performance of a system mainly depends on productive time and resource utilization. CPU scheduling algorithm gives a real time measurement of this productive utilization and its feasibility. CPU being considered a primary computer resource, its scheduling is central to operating-system design. A thorough performance evaluation of various scheduling algorithms indicates that Round Robin Algorithm is considered as optimal in time shared environment because the static time is equally shared among the processes. In this paper, we have proposed an improved scheduling algorithm by using dynamic time quantum and multi-cycled Round Robin concept. Our approach is based on the calculation of time quantum twice in a single round robin cycle. Experimental analysis shows that our proposed algorithm performs better than Round Robin algorithm. It also minimizes the overall number of context switches, average waiting time and average turn-around time.