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

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.

@article{Mohanty2011,
  title     = {Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {2},
  number    = {2},
  year      = {2011},
  publisher = {The Science and Information Organization},
  author    = {Rakesh Mohanty and H. S. Behera and Khusbu Patwari and Monisha Dash and Lakshmi Prasanna},
  doi       = {10.14569/IJACSA.2011.020209},
  url       = {https://doi.org/10.14569/IJACSA.2011.020209}
}