基于异构型结点的任务均衡调度研究  

A Study on Tasks Equipoise Scheduling in Heterogeneous Nodes

作　　者：王群[1] 周之英[1] 

机构地区：[1]清华大学计算机系

出　　处：《计算机工程与应用》1999年第3期1-3,7,共4页Computer Engineering and Applications

摘　　要：该文以实现时间最短为目标，全面考虑影响任务集实现开销的各种因素，建立了异构型结点集中带偏序关系的任务集的均衡调度模型及其随机搜索算法。调度模型将任务集实现过程分成：执行、传递和等待，强调执行和传递的并行性，降低因等待而发生的费用。算法在统计意义下为多项式时间复杂度。这一模型在工作时限要求较高的领域应用前景广泛。This paper studies an equipoise scheduling model, which is based on considering overdl influence fac- tors of overhead with precedence order of the set of tasks in hetenogeneous nodes,and its random searching al- gorithm.The materialized process of the set of tasks is disported:executing,transmiting and waiting.Model declhes waiting costs on emphasizing parallel of executing and transmitting. The algorithm's complexity of calcu- lation is polynomial in a speciftc statistic's sense. This model is utilized widespreadly in domains of tasks which requiring higher time limit.

关 键 词：异构型结点集 调度问题 任务均衡调度 计算机 

分 类 号：O224[理学—运筹学与控制论]