Optimised Round Robin with Virtual Runtime for CPU Scheduling

The Central Processing Unit (CPU) consists of the main circuitry to perform all the operations in a computer. One of the most important operations an Operating System performs is CPU Scheduling, which is responsible for managing all tasks and allocating CPU time to each task in an optimal order. This extends to applications in distributed systems since scheduling is required to maximise server utilisation in load-sharing mechanisms. One of the more commonly used scheduling algorithms for the mentioned application is Round Robin (RR), which is considered to be one of the most efficient. However, the efficiency of RR entirely depends on the chosen Static Time Quantum. In this paper, we have proposed an optimisation to the pre-existing RR algorithm, namely ‘Riti’, where Round Robin is implemented using Virtual Runtime and by calculating Dynamic Time Quantum. ‘Riti’ has achieved a 27.6% reduction in average Turnaround Time and 37.4% reduction in average Waiting Time as compared to Traditional Round Robin.