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

基于一种自适应并行遗传算法的网格资源选择策略
引用本文:武频,李建敦,刘权胜,李松倍. 基于一种自适应并行遗传算法的网格资源选择策略[J]. 上海大学学报(自然科学版), 2007, 13(5): 629-633
作者姓名:武频  李建敦  刘权胜  李松倍
作者单位:上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072;上海大学,计算机工程与科学学院,上海,200072
摘    要:网格是在某一单一时间,将网络中众多的计算机资源集中起来共同处理某个单一问题的.而如何有效地从众多的资源中选出多个较优秀的资源是一个NP问题.该文提出一种新的自适应的并行遗传算法(NAPGA),并对网格资源的选择策略在C+MPI平台上进行了并行模拟.结果表明,该算法不仅有效地避免了过早收敛的现象,而且取得了比改进型的并行遗传算法(NIPGA)更优的搜索结果.最后对遗传算法的搜索和收敛规律进行了一些讨论.

关 键 词:网格  遗传算法  MPI
文章编号:1007-2861(2007)05-0629-05
收稿时间:2007-01-23
修稿时间:2007-01-23

Grid Resource Selection Strategy Based on an Adaptive Parallel Genetic Algorithm
WU Pin,LI Jian-dun,LIU Quan-sheng,LI Song-bei. Grid Resource Selection Strategy Based on an Adaptive Parallel Genetic Algorithm[J]. Journal of Shanghai University(Natural Science), 2007, 13(5): 629-633
Authors:WU Pin  LI Jian-dun  LIU Quan-sheng  LI Song-bei
Affiliation:School of Computer Engineering and Science, Shanghai University, Shanghai 200072, China
Abstract:With a large amount of computer resources becoming available in the network, grid can been used to handle a single problem simultaneously. Selecting more than one outstanding resource from numerous resources is an NP problem. In this paper, a new adaptive parallel genetic algorithm (NAPGA) is proposed, with which parallel model simulation of the grid resources selection strategy on C+MPI platform is made. The result indicates that the algorithm can effectively solve the problem of premature convergence, and produce results that are better than a new improved parallel genetic algorithm (NIPGA). Searching and converging disciplinarian of genetic algorithm are discussed.
Keywords:MPI
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《上海大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《上海大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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