%0 Journal Article
%T Tasks mapping in grid computing environment based on ACO algorithm<br>基于蚁群优化算法的网格任务映射策略
%A TAN Yi-ming
%A ZHANG Miao
%A ZHANG De-xian
%A <br>谭一鸣
%A 张苗
%A 张德贤
%J 计算机应用
%D 2008
%I 
%X 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.
%K grid computing
%K tasks mapping
%K ACO
%K local search<br>网格计算
%K 任务映射
%K 蚁群优化算法
%K 局部搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=CA02DFAB10EF67DAD7B0FAE0EA797879&yid=67289AFF6305E306&vid=D3E34374A0D77D7F&iid=B31275AF3241DB2D&sid=1AC2995B88F4B692&eid=22E618DED444E3B5&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=7