快速降阶匈牙利算法的云计算任务分配模型.pdfVIP

DOI ：10.13265/ki.jxlgdxxb.2014.03.008 网络出版时间：2014-06-06 17:30 网络出版地址：/kcms/doi/10.13265/ki.jxlgdxxb.2014.03.008.html 快速降阶匈牙利算法的云计算任务分配模型 任金霞,何富江 （江西理工大学电气工程与自动化学院,江西 赣州 341000 ） 摘 要：为了提高云计算任务分配效率,在标准匈牙利算法的基础上,提出一种快速降阶优化算法的云计 算任务分配模型.为实现快速求解全局任务分配问题,快速降阶算法不断排除已确定的分配方案对应的 代价矩阵元素,从而快速降低矩阵的阶次.并可根据成本矩阵规模将矩阵分解成多个矩阵,使得该算法在 任务和计算机不对等的情况下同样适用.论文最后的仿真结果表明,快速降阶匈牙利算法计算耗时远远 小于匈牙利算法,并能有效提高计算机的利用率. 关键词:云计算；任务分配；降阶；匈牙利算法 中图分类号：TP393 文献标识码：A Faster Reduced order Cloud Task Assignment Model Based on Hungary Algorithm Ren Jin-xia, He Fu-jiang (School of Electrical Engineering and Automation, Jiangxi University of Science and Technology, Ganzhou 341000,China) Abstract: In order to improve the efficiency of cloud computing task allocation, on the basis of standard Hungary algorithm, this paper puts forward a cloud computing task allocation model of fast reduced order optimization algorithm. To achieve fast solving all task allocation problem, fast reduced order algorithm constantly rules out to matrix elements that the determined allocation plan corresponds, thus the order of the matrix is quickly reduced. And the matrix is decomposed into multiple matrixes according to the size of cost matrix, which makes the algorithm also applicable in the uncoordinated case of tasks and computer. The final the simulation results of the paper show that calculation time of fast reduced order Hungary algorithm is