一个基于偏序的定时投入关联网络作业调度算法

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.