A novel resilent round robin algorithm based CPU scheduling for efficient CPU utlilization

The central processing unit (CPU) is one of the most important resources of any computer system. Effective scheduling of CPUs across multiple processes is the primary function of any typical operating system to improve the overall performance of the system. An important design characteristic of an operating system is the type of scheduling algorithm it uses and supports. The main function of any scheduling algorithm is to select a process from the ready queue and allocate processor time to each process. The round robin (RR) algorithm is one of the most widely used CPU scheduling algorithms in time-sharing systems. The round robin algorithm is based on the concept of time quantum (TQ); this means that each process is given a certain amount of time to run by the CPU, after which the CPU goes to subsequent processes in the ready queue. The proposed Novel Resilient Round Robin (NRRR) algorithm uses a dynamic TQ whose value is calculated using one of the statistical measures proposed in the paper. The proposed algorithm is robust and resilient, in the sense that it schedules the execution of the process in a balanced way, where an improvement in one scheduling criterion does not lead to great degradation in another, but continuously maintains a balance between them. The proposed algorithm significantly reduces the average wait time (AWT), the average turnaround time (ATT), the number of context switches (NCS) and enhances CPU utilisation criterions. The proposed algorithm uses the CPU more efficiently and ultimately improves overall system performance.