Vague Oriented Highest Response Ratio Next (VHRRN) scheduling algorithm

Vague set theory of Gau and Buehrer is an emerging and powerful tool for dealing uncertainty, incomplete and imprecise information. To deal with the imprecise nature of data used with scheduling algorithm, we use vague set theory with Highest Response Ratio Next scheduling algorithm. In this paper, we propose a new scheduling algorithm called Vague Oriented Highest Response Ratio Next (VHRRN) scheduling algorithm. VHRRN algorithm computes the dynamic priority using vague logic. To compute the dynamic priority, we introduce a new framework which in corporate Vague Logic Unit (VLU) and Median Membership Function Unit (MMFU). We define the member functions in the vague logic unit, for the input variables burst time and the waiting time. The generated output from the VLU is applied to the MMFU which provides the median membership values both for burst time and the waiting time. These membership values are finally used to compute the dynamic priority for the HRRN algorithm. Finally, we evaluate the performance of VHRRN algorithm over the conventional HRRN algorithm on the basis of different performance criteria like waiting time, turnaround time and the normalized turnaround time. Results validates that the performance of VHRRN is better than the conventional HRRN scheduling algorithm.