Performance Evaluation of a New Proposed Variant of Fittest Job First Dynamic Round Robin (VFJFDRR) Scheduling Algorithm with Intelligent Time Slice

Main Article Content

Rakesh Mohanty
Suchitra Panigrahi

Abstract

Round Robin (RR) is one of the most suitable and efficient scheduling algorithms for time-sharing systems. Recently many variants of RR scheduling algorithm have been developed and studied in the literature with the use of dynamic time quantum. In this paper, a new variant of Fittest Job First Dynamic Round Robin (FJFDRR) algorithm is proposed which we call as VFJFDRR in short. In this algorithm, the processes are arranged in the ready queue according to our calculated fit factor and are assigned dynamic time quantum using the intelligent time slice method. We have evaluated the performance and compared the results of our proposed VFJFDRR algorithm with the FJFDRR algorithm using three different cases of the input data set. Experimental results show that VFJFDRR performs better than FJFDRR in terms of average waiting time and average turnaround time when the processes are arranged in decreasing and random order of burst time. However VFJFDRR provides greater average waiting time and average turnaround time than FJFDRR when the processes are arranged in increasing order of burst time. In all the three cases, the number of context switches is increased for VFJFDRR making the algorithm more suitable for fair sharing.

Keywords: Operating System, Scheduling, Round Robin, Dynamic Time Quantum, Intelligent Time Slice.

Downloads

Download data is not yet available.

Article Details

Section
Articles