Weighted Approach to Better Job First Scheduling

Abstract

Order of arrival, CPU time requirement and priority are three important factors that are usually attached with a process arriving for
execution. Several algorithms have been developed to order the processes in ready queue in an attempt to minimize average waiting time, response time or increasing the throughput. Existing algorithms have some positive and negative effects by way of assigning individual importance to any of the three factors. Present work is an effort 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. Proposed approach is based on a suitable classification of the attributes and ranking the processes according to logically assigned weights. The policy thus enjoys some advantages of all the criteria.