Performance analysis of cpu scheduling algorithms with dfrrs algorithm

Abstract

CPU scheduling is an integral part of any operating system and defines the basic functionality of an operating system. A scheduling algorithm is in-tended to execute user and system requests with the highest efficiency possible. The algorithm is responsible for analysing the processes, choosing and dispatching the most appropriate process for execution. Two of the most commonly used scheduling algorithms are the round robin (RR) algorithm and the priority scheduling algorithm. However, they both have their own pros and cons with respect to the qualities of service provided by a good scheduling algorithm. A new scheduling algorithm DFRRS (Dynamically Factored Round Robin Scheduling) has been developed to improve the performance of Round Robin Scheduler by incorporating the features of priority scheduling and SJF algorithm. A comparative analysis of turnaround and waiting Time is shown with the help of bar graphs (Histograms).