【作者】 段智勇； 张大方； 张伟鹏；

【Author】 Duan Zhi-Yong, Zhang Da-Fang, Zhang Wei-Peng (College of Computer and Communication, Hunan University, Changsha 410082,China)

【机构】 湖南大学计算机与通信学院；

【摘要】 当网格被用来作为计算平台时,寻找网格中最佳资源以满足应用需要是困难的。为此, 文献[1]提出了一个资源选择算法,该算法通过扩展Condor的资源匹配框架,能够同时满足单一资源选择和多个资源选择的要求。但是,由于算法一开始就选择了资源集合中单机最强的节点,所以很容易陷入局部最优。本文对该算法进行改进,提出一个新的按域组合资源选择算法。实验结果说明新算法能找到更加匹配用户资源要求的资源组合。更多还原

【Abstract】 While Grids are used as a computing platform, selecting the best resource set in Grid to meet application requirements are difficult. As a result, paper[1] present a resource selection algorithm, which extends the Condor matchmaking framework to support both single resource and multiple-resource selection. But because the algorithm selects the most powerful node in Grid at first, it is very easy to fall into partial optimization. In this paper we present a new resource selection algorithm to improve the old algorithm. Experimental results show that new algorithm can select the resource set which match user’s resource requests better.更多还原