Improvised Priority based Round Robin CPU Scheduling

In this paper a new approach for Priority based round robin CPU scheduling algorithm is performed which improves the CPU performance in real time operating system. It retains the advantage of existing round-robin algorithms [5, 6, 8] and improves the performance. The proposed algorithm gives better performance with given priority as well as assigned priority and in both cases, minimize average waiting time which context switch number, and Average turnaround time from existing round robin algorithms. The paper gives a Graph comparative analysis of proposed algorithm with existing round robin scheduling algorithms on various cases with different combination of CPU burst varying time quantum, average waiting time, average turnaround time and number of context switches.