计算机工程 ›› 2010, Vol. 36 ›› Issue (3): 215-217.doi: 10.3969/j.issn.1000-3428.2010.03.072

• 人工智能及识别技术 • 上一篇    下一篇

基于混合蚁群算法的网格任务调度

魏 东1,2,吴良杰1,佐 丹1,刘 刚2   

  1. (1. 哈尔滨工程大学计算机科学与技术学院,哈尔滨 150001;2. 海军飞行学院,葫芦岛 125001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-02-05 发布日期:2010-02-05

Grid Task Schedule Based on Hybrid Ant Colony Algorithm

WEI Dong1,2, WU Liang-jie1, ZUO Dan1, LIU Gang2   

  1. (1. College of Computer Science and Technology, Harbin Engineering University, Harbin 150001; 2. Navy Flying College, Huludao 125001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-02-05 Published:2010-02-05

摘要: 针对网格任务调度的调度时间长、资源负载不平衡等问题,提出一种基于混合蚁群算法的网格任务调度方法。该方法将禁忌搜索作为蚁群算法的局部搜索策略,以扩大解的搜索空间,避免陷入局部最优,并通过多样化机制提高算法收敛速度。利用平衡因子调节信息素的更新,改善资源的负载平衡性能。

关键词: 网格, 任务调度, 蚁群算法, 禁忌搜索, 负载平衡

Abstract: Aiming at problems such as long-time schedule, load imbalance of resources in grid task schedule, this paper proposes a grid task schedule method based on hybrid ant colony algorithm. This method uses tabu search as the local search strategy of ant colony algorithm to expand the solution search space and avoid local optimum. It uses the diversification mechanism to improve the convergence speed and adjust the balance factor to adjust the pheromone update and improve the load balance performance of resources.

Key words: grid, task schedule, ant colony algorithm, tabu search, load balance

中图分类号: