A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
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 robindoi:10.5120/ijca2018916722 fatcat:6hkpbkie5vdixdkgxuipyzhvgm