Abstract:
How to schedule resource successfully in complex grid environment is a NP problem. Parallel genetic algorithms have been proven to be a good way to solve this problem, but they have shortcomings such as premature and slow convergence. In order to overcome these shortcomings, it brings ant colony algorithm in. Combining two algorithms can exert each advantage, parallel genetic algorithms can solve computing resource scheduling problem more effectively.
Key words:
Grid,
Resource scheduling,
Parallel genetic algorithms,
Ant colony algorithm
摘要: 如何将网格这个复杂环境中的资源进行有效调度,是一个NP问题。并行遗传算法被证明是解决这类问题的有效算法,同时并行遗传算法有“早熟”和慢速收敛等缺点。为了克服其缺点,该文引进蚁群算法思想,将两个算法结合起来,充分发挥各自的优势,该算法能更有效地解决网格计算资源分配的问题。
关键词:
网格,
资源调度,
并行遗传算法,
蚁群算法
CLC Number:
XU Wenbo;ZHANG Tao.
Research of Grid Computing Resource Scheduling Algorithms
[J]. Computer Engineering, 2006, 32(14): 95-97.
须文波;张 涛. 网格计算资源调度算法研究[J]. 计算机工程, 2006, 32(14): 95-97.