聂清彬, 霍敏霞, 曹耀钦. 基于TCBSA-ACO算法在云计算任务分配中的研究[J]. 微电子学与计算机, 2016, 33(6): 53-58.
引用本文: 聂清彬, 霍敏霞, 曹耀钦. 基于TCBSA-ACO算法在云计算任务分配中的研究[J]. 微电子学与计算机, 2016, 33(6): 53-58.
NIE Qing-bin, HUO Min-xia, CAO Yao-qin. A Research of Time Cost Balance Simulated Annealing Ant Colony Algorithm for Task Allocation in Cloud Computing[J]. Microelectronics & Computer, 2016, 33(6): 53-58.
Citation: NIE Qing-bin, HUO Min-xia, CAO Yao-qin. A Research of Time Cost Balance Simulated Annealing Ant Colony Algorithm for Task Allocation in Cloud Computing[J]. Microelectronics & Computer, 2016, 33(6): 53-58.

基于TCBSA-ACO算法在云计算任务分配中的研究

A Research of Time Cost Balance Simulated Annealing Ant Colony Algorithm for Task Allocation in Cloud Computing

  • 摘要: 针对云计算中的任务分配问题, 提出一种基于建立时间成本负载约束函数的模拟退火蚁群算法(a restraint Function of Time Cost Load based on the Simulated Annealing ant colony Algorithm, TCBSA-ACO), 该算法结合云计算中任务分配的特点, 创新地通过建立时间成本约束函数和负载标准差函数分别改进信息素的更新和启发信息, 并用模拟退火算法对求出的解进行全局寻优.利用CloudSim工具进行仿真测试, 与标准的蚁群算法BACO和最新的改进蚁群算法DSFACO做仿真对比, 实验结果表明TCBSA-ACO算法在云任务的执行时间, 成本, 系统负载均衡率方面均优于这两种算法, 提高了系统资源利用率.

     

    Abstract: Aiming at solving the problem of task allocation in cloud computing, this paper proposes a restraint function of Time Cost Balance Simulated Annealing Ant Colony Algorithm (TCBSA-ACO). The TCBSA-ACO, combined with features of task allocation in cloud computing, improves information elements updating and inspiring factors creatively by establishing a time cost restraint function and a load standard deviation function, and achieves global optimization of all the answers by adopting the simulated annealing algorithm. Some simulation experiments are done by the tool CloudSim, and the results are compared with those of the standard ant colony algorithms BACO and the latest ant colony algorithm DSFACO. The comparison shows that this TCBSA-ACO algorithm is more efficient than the other two algorithms both in reducing time and cost of task execution and in keeping load balance, thus improves resource utilization in the system.

     

/

返回文章
返回