A New Proposed Dynamic Quantum for Priority Based Round Robin Scheduling Algorithm

1Asst. Prof, Dept. of Computer Science & Engineering, Vikash Institute of Technology, Bargarh, Odisha, India 2,3,4 Student researcher, Dept. of Computer Science & Engineering, Vikash Institute of Technology, Bargarh, Odisha, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract : The main objective of this paper is to develop a new approach for round robin CPU scheduling algorithm which improves the performance of CPU using the priority factor in real time operating system. The proposed Priority based Round-Robin CPU Scheduling algorithm is based on the integration of round-robin and priority scheduling algorithm. It retains the advantage of round robin in reducing starvation and also integrates the advantage of priority scheduling. The proposed algorithm also implements the concept of dynamic time quantum to the processes. Existing round robin CPU scheduling algorithm cannot be implemented in real time operating system due to their high context switch rates, large waiting time, large response time, turnaround time and less throughput. The proposed algorithm improves all the drawbacks of round robin CP U scheduling algorithm. The paper also presents the comparative analysis of proposed algorithm with existing round robin scheduling algorithm on the basis of average waiting time, average turnaround time and number of context switches.