高技术通讯2016，Vol.26Issue(4)：344-348,5.DOI:10.3772/j.issn.1002-0470.2016.04.003
多核集群任务分配问题的0-1整数规划求解模型
A model for solving task allocation problems in multi-core clusters using 0-1 integer programming
摘要
Abstract
The in-node communication characteristics of the task allocation of multi-core clusters was studied .An opti-mized model for solving task allocation problems in multi-core clusters using 0-1 integer linear programming was proposed based on the 0-1 integer linear programming model and the linear relaxation technique .Considering that the traffic and delay of in-node communications are bigger , which brings serious limitations to the traditional models aiming to minimize the computing cost and the cost of the node-node communications , the proposed model takes ac-count of the cost of in-node communications and adopts the technique of linear programming relaxation , with the aim to minimize the computing cost , the cost of node-node communications , and the in-node communication cost . The effectiveness of the model is verified by the computation result .关键词
多核集群/任务分配问题( TAP)/0-1整数规划/线性规划松弛Key words
multi-core cluster/tast allocation problem/0-1 integer programming/linear programming relaxation引用本文复制引用
杨际祥,凌玲..多核集群任务分配问题的0-1整数规划求解模型[J].高技术通讯,2016,26(4):344-348,5.基金项目
国家自然科学基金（11401061），重庆市自然科学基金（KJ1400316）和交通运输部建设科技基金（2014318223030）资助项目。 （）
