利用分支定界法解决MPS任务分配问题  

The Utilization of Branch-and-Bound Method To Solve the Problem of MPS Task Distribution

作　　者：乔瑞[1] 

机构地区：[1]新疆工学院计算机工程系

出　　处：《新疆大学学报（自然科学版）》1998年第2期22-25,共4页Journal of Xinjiang University(Natural Science Edition)

摘　　要：应用简单的判定树法进行ＭＰＳ任务分配，其结果一般不是最佳的［１］．本文使用分支定界法解决该问题［２］．使得多处理机系统的负载均衡，任务并行程度、运行效率、资源利用率和降低不同处理机间的进程通信开销等方面的综合性能达到最优．Using simple decision tree to carry out MPS task distribu tion does not lead to the best result.This paper is in tended to solve this problem by means of branch and bound method.So that the load of multiprocessor system could be balanced and the comprehensive properties of the degree of the task parallel,running efficiency,the utilization of resource and the reduction of the process communication expenditures amore different processors could be best achived.

关 键 词：分支定界法 判定树 MPS任务分配 算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]