Dynamic Ready Queue Based Process Priority Scheduling Algorithm

TL;DR

This paper introduces a modified Round Robin scheduling algorithm that dynamically calculates process priority based on waiting time and arrival time to improve system performance metrics.

Contribution

A novel variation of Round Robin scheduling that dynamically assigns priorities to reduce completion, turnaround, waiting times, and context switches.

Findings

Reduced average waiting and turnaround times.

Fewer context switches compared to traditional Round Robin.

Improved overall system efficiency.

Abstract

CPU scheduling is the reason behind the performance of multiprocessing and in time-shared operating systems. Different scheduling criteria are used to evaluate Central Processing Unit Scheduling algorithms which are based on different properties of the system. Round Robin is known to be the most recurrent pre-emptive algorithm used in an environment where processes are allotted a unit of time and multiprocessing operating systems. In this paper, a reformed variation of the Round Robin algorithm has been introduced to minimise the completion time, turnaround time, waiting time and number of context switches that results in the better performance of the system. The proposed work consists of calculation of priority on the basis of the difference between time spent in ready upto the moment and arrival time of the process, to ease up the burden on the ready queue. We have also evaluated the performance of the proposed approach on different datasets and measured the different scheduling criteria.