Characteristic Specific Prioritized Dynamic Average Burst Round Robin Scheduling for Uniprocessor and Multiprocessor Environment

Abstract

CPU scheduling is one of the most crucial operations performed by operating systems. Different conventional algorithms like FCFS, SJF, Priority, and RR (Round Robin) are available for CPU Scheduling. The effectiveness of Priority and Round Robin scheduling algorithm completely depends on selection of priority features of processes and on the choice of time quantum. In this paper a new CPU scheduling algorithm has been proposed, named as CSPDABRR (Characteristic specific Prioritized Dynamic Average Burst Round Robin), that uses seven priority features for calculating priority of processes and uses dynamic time quantum instead of static time quantum used in RR. The performance of the proposed algorithm is experimentally compared with traditional RR and Priority scheduling algorithm in both uni-processor and multi-processor environment. The results of our approach presented in this paper demonstrate improved performance in terms of average waiting time, average turnaround time, and optimal priority feature.

An Optimized Disk Scheduling Algorithm with Bad-Sector Management

“…Amar, Sandipta, and Sanjay [4] have developed an optimized CPU scheduling algorithm "DABRR" by introducing a concept of dynamic time quantum, made up by finding the mean of burst time of all process. In further study Amar et al [5] selected specific priority features and proposed new scheduling algorithm "CSPDABRR". This algorithm made up of both round-robin and priority CPU scheduling algorithm.…”