A Priority Based Round Robin CPU Scheduling Algorithm for Real Time Systems

This paper is to develop a new approach for round robin CPU scheduling algorithm which improves the performance of CPU 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 aging by assigning new priorities 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, large turnaround time and less throughput.

Provided by: International Journal of Innovations in Engineering and Technology (IJIET) Topic: Data Centers Date Added: Oct 2012 Format: PDF

Find By Topic