International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 33 - Number 9 |
Year of Publication: 2011 |
Authors: D. Pandey, Vandana, M. K. Sharma |
10.5120/4048-5810 |
D. Pandey, Vandana, M. K. Sharma . Fuzzy Better Job First Scheduling Algorithm. International Journal of Computer Applications. 33, 9 ( November 2011), 13-16. DOI=10.5120/4048-5810
Time of arrival, size of CPU burst and priority are three major factors that are usually attached with a process which is submitted for execution. Several scheduling policies exist which use one or the other of these factors to place the submitted processes in appropriate order in the ready queue. Each of the existing schedulers has some positive and negative implications by way of assigning individual importance to any of the three factors. This work is an attempt to analyze the collective effect of time of arrival, size of CPU burst and priority of the process, through a logical combination of all the three. Fuzzy Better Job First (FBJF) scheduling algorithm logically integrates these three factors of a process and uses fuzzy ranking approach to determine the next most worthy job to be executed. The proposed policy thus enjoys advantages all the criteria to considerable extent.