A SCHEDULING ALGORITHM BASED ON THE PARTIAL ORDER FOR INTER-RELATED JOBS IN TIMING SUBMIT

A scheduling algorithm based on the partial order for related network jobs in timing submit has been used in a big JobCenter Management System. Its idea is to find a optimum order for inter related network jobs in timing submit, so that the time which network jobs wait each other is reduced. First, this algorithm builds a model of inter related jobs according to partial order, and then the order values of network job are calculated. Finally, the optimum order is obtained by above results, so that the executed time is reduced by this order. Experimental testing shows that the algorithm has significant merit for inter related jobs in timing submit.