Modified RR Algorithm with Dynamic Time Quantum for Externally Prioritized Tasks

Abstract

The objective of this paper is to modify Round Robin scheduling for soft real time systems. It introduces a variation of round robin algorithm which can schedule tasks considering their priorities in a round robin fashion. Simple Round Robin scheduling algorithm and Priority scheduling algorithm, both have their own drawbacks. The proposed algorithm removes the drawbacks of Round Robin scheduling and Priority scheduling. The proposed scheduling algorithm calculates different time slices for individual processes considering their priorities. Experimental analysis reveals that the proposed algorithm produces better average turnaround time, average waiting time and less number of context switches than some existing algorithms useful for interactive systems. KeywordsOperating System; Scheduling; Round Robin Algorithm; Context switch; Turnaround time; Average Waiting time __________________________________________________*****_________________________________________________