杨庆娜, 李定主. 一种改进的网格资源配置算法的研究与设计[J]. 微电子学与计算机, 2011, 28(1): 150-153.
引用本文: 杨庆娜, 李定主. 一种改进的网格资源配置算法的研究与设计[J]. 微电子学与计算机, 2011, 28(1): 150-153.
YANG Qing-na, LI Ding-zhu. Research and Design of an Improved Algorithm of Grid Resources Allocation[J]. Microelectronics & Computer, 2011, 28(1): 150-153.
Citation: YANG Qing-na, LI Ding-zhu. Research and Design of an Improved Algorithm of Grid Resources Allocation[J]. Microelectronics & Computer, 2011, 28(1): 150-153.

一种改进的网格资源配置算法的研究与设计

Research and Design of an Improved Algorithm of Grid Resources Allocation

  • 摘要: 网格资源优化配置问题是一个NP问题,遗传算法可以有效地解决这类问题.针对基本遗传算法收敛速度慢的不足,提出一种改进的遗传算法.该算法通过产生符合条件的初始种群和保护优秀个体的交叉策略,提高了算法的搜索能力和收敛速度.提出的算法综合考虑了资源任务的通信代价、任务执行时间和资源利用率等参数;并结合网格资源的特点,将所有资源统一描述和对待,扩展了资源的概念,具有实际应用意义.

     

    Abstract: Grid resource optimized allocation is a NP problem, which can be solved by genetic algorithm efficiently.An improved genetic algorithm is proposed in order to overcome the defect of slow convergence speed in this algorithm.Qualified initial population and excellent members protecting crossover strategies are brought in, they all can help to enhance the searching ability and convergence speed.This method plays a practical role by considering many parameters such as the communication cost between the resources and tasks, execution time of task and the utility of resources, and describing resources uniformly in the way of combining the characteristics of grid resources.

     

/

返回文章
返回