Design and Performance Evaluation of Smart Job First Dynamic Round Robin (SJFDRR) Scheduling Algorithm with Individual Time Quantum for Each Process

Main Article Content

Amit Kumar Gupta, Dr. Narendra Singh Yadav, Dr. Dinesh Goyal

Abstract

Round Robin scheduling is mostly used CPU scheduling algorithm; it gives better result in comparison to other scheduling algorithm. But this algorithm may lead many problems directly related to time quantum. If selected time quantum is large, then the response time of the processes may turn in too high. On the other hand, if time quantum is short, it increases the number of context switch which may lead overhead of the CPU. In this paper, researcher proposed a new algorithm, called Smart Job First Dynamic Round Robin (SJFDRR) with individual time quantum for each process. The proposed algorithm calculates smart priority factor (SPF) and individual time quantum for each process. The factor SPF is calculated on the basis of user priority and system priority. The individual time quantum is calculated on the basis of burst time of the process. Based on the analysis, researcher has shown that the new proposed algorithm (SJFDRR) with individual time quantum solves the fixed time quantum problem and enhanced the performance of Round Robin.

Article Details

How to Cite
, A. K. G. D. N. S. Y. D. D. G. (2016). Design and Performance Evaluation of Smart Job First Dynamic Round Robin (SJFDRR) Scheduling Algorithm with Individual Time Quantum for Each Process. International Journal on Recent and Innovation Trends in Computing and Communication, 4(12), 63 –. https://doi.org/10.17762/ijritcc.v4i12.2671
Section
Articles