摘要
网格计算中的资源调度技术是连接网格底层和高层功能的纽带。蚁群算法作为一种成熟的分布式、启发式搜索算法,其实质上是一种通过群体智能间接散布最优解信息,采用逐步收敛的方式求解最优解的算法。通过介绍蚁群算法的原理,对使用蚁群算法作为网格计算资源调度策略的可行性进行了分析,并在此基础上探讨了基于蚁群算法的网格计算资源调度的设计思路、运作流程、需要考虑的信息素更新方式等关键问题,最后给出了基于蚁群算法的网格计算资源调度总控程序。
Resource schedulingtechnology of fgrid computing interconnects grid bottom and top functions. Ant colony algorithm （ACA）, as a sort of mature distributing and heuristic search algorithm, which is essentially an algorithm of seeking the best result through distri- buting optimized information between colony members and converging gradually to final optimization, By introducing the basic theory of ACA, the feasibility analysis of grid resource scheduling in ant colony algorithm is proposed. Based on this, some important problems are brought forward such as design ideas, operational process and pheromone updating, At the end, the control program of grid resource scheduling strategy based on ACA is present.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第15期3611-3612,3694,共3页
Computer Engineering and Design
关键词
网格计算
资源调度
蚁群算法
信息素
总控程序
grid computing
resource scheduling
ant colony algorithm
pheromone
control program
