Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems

TL;DR

This paper introduces PBDRR, a novel scheduling algorithm for soft real-time systems that dynamically adjusts time slices based on process priority, reducing context switches and waiting times.

Contribution

The paper presents a new Priority Based Dynamic Round Robin algorithm with intelligent time slices, improving performance over traditional RR in soft real-time environments.

Findings

Reduces context switches compared to existing algorithms

Lowers average waiting time and turnaround time

Adapts time slices dynamically for better efficiency

Abstract

In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algorithm, known as Priority Based Dynamic Round Robin Algorithm(PBDRR),which calculates intelligent time slice for individual processes and changes after every round of execution. The proposed scheduling algorithm is developed by taking dynamic time quantum concept into account. Our experimental results show that our proposed algorithm performs better than algorithm in [8] in terms of reducing the number of context switches, average waiting time and average turnaround time.