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

THE UTILIZATION OF BRANCH-AND-BOUND METHOD TO SOLVE THE PROBLEM OF MPS TASK DISTRIBUTION

作　　者：乔瑞[1] 

机构地区：[1]新疆工学院计算机工程系,乌鲁木齐830008

出　　处：《新疆工学院学报》1998年第2期129-131,共3页

摘　　要：应用简单的判定树法进行MPS任务分配，其结果一般不是最佳的[1]．本文使用分支定界法解决该问题[2]．使得多处理机系统的负载均衡，任务并行程度、运行效率、资源利用率和降低不同处理机间的进程通信开销等方面的综合性能达到最优．Using simple decision tree to carry out MPS task distribution does not lead to the bestresult. This paper is intended to solve this problem by means of branch - and - boundmethod so that the load of multiprocessor system can be balanced and the comprehensiveproperties of the degree of the task parallel, running efficiency, the utilization of resourceand the reduction of the process communication expenditures among different processors canbe best achieved.

关 键 词：分忠定界法 判定树 计算机 MPS任务分配 

分 类 号：TP315[自动化与计算机技术—计算机软件与理论]