首页 | 本学科首页   官方微博 | 高级检索  
     

基于蚁群优化算法的网格任务映射策略
引用本文:谭一鸣,张苗,张德贤.基于蚁群优化算法的网格任务映射策略[J].计算机应用,2008,28(6):1598-1600.
作者姓名:谭一鸣  张苗  张德贤
作者单位:河南工业大学,信息科学与工程学院,郑州,450001
摘    要:针对网格环境下实现任务最优映射的问题,提出一种基于蚁群优化算法的网格任务映射策略(ACO-GTM)。该算法通过人工蚂蚁在构建图上行走构建初始解,利用最优改进2-选择局部搜索方法对初始解进行局部优化,并采用全局信息素更新与局部信息素更新相结合的信息素更新策略。最后通过实验与其他算法进行比较,表明所提出的映射算法在最优跨度和负载平衡方面具有明显的优越性。

关 键 词:网格计算  任务映射  蚁群优化算法  局部搜索
文章编号:1001-9081(2008)06-1598-03
收稿时间:2007-12-19
修稿时间:2007年12月19

Tasks mapping in grid computing environment based on ACO algorithm
TAN Yi-ming,ZHANG Miao,ZHANG De-xian.Tasks mapping in grid computing environment based on ACO algorithm[J].journal of Computer Applications,2008,28(6):1598-1600.
Authors:TAN Yi-ming  ZHANG Miao  ZHANG De-xian
Affiliation:TAN Yi-ming,ZHANG Miao,ZHANG De-xianCollege of Information Science , Technology,Henan University of Technology,Zhengzhou Henan 450001,China
Abstract:In order to optimize the tasks mapping in grid, a grid tasks mapping algorithm based on Ant Colony Optimization (named ACO-GTM) was proposed. The algorithm generated initial solutions through these artificial ants traversed on the construction graph and optimized these initial solutions by using the Best-improvement 2-opt local search algorithm. It combined the global and local pheromone updates. The experiments show that the proposed algorithm for the mapping problem has better performance than other algorithms on optimum makespan and load-balancing.
Keywords:grid computing  tasks mapping  ACO  local search
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号