Research on Grid Resources Schedule Based on an Adaptive Distribute Parallel Genetic Algorithm

In this paper an improved adaptive parallel genetic algorithm is proposed to solve problems of grid resources distribution and matching, comparing with the traditional genetic algorithms, a new adaptive selection operator is introduced, which can prevent the premature convergence of genetic algorithm efficiently. Besides, in this paper, the migration strategy of the parallel genetic algorithm can prevent the population trapped in the local extreme. And a pc-cluster containing eight computers is constructed to execute the coarse-grained parallel genetic algorithm and series genetic algorithm, and different scale resources and tasks are tested on the pc-cluster. Several examples are provided to be examined and the results illustrate that the proposed algorithm has higher global optimization capability, computational efficiency and stronger stability than the traditional genetic algorithm for the max time span. From these results, the parallel genetic algorithm reduced the searching time much more than series genetic algorithm for the same solutions. Moreover, compared with series genetic algorithm, the parallel genetic algorithm can get the more optimal solutions when the iteration is same.

[1]  Yong Lu,et al.  A robust stochastic genetic algorithm (StGA) for global numerical optimization , 2004, IEEE Transactions on Evolutionary Computation.

[2]  David E. Goldberg,et al.  Efficient Parallel Genetic Algorithms: Theory and Practice , 2000 .

[3]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  M. M. Ali,et al.  Integrated crossover rules in real coded genetic algorithms , 2007, Eur. J. Oper. Res..

[5]  Wanxing Sheng,et al.  Research and application of Distributed Parallel Genetic Algorithm Based on PC Cluster , 2007 .

[6]  Jinyuan You,et al.  Main sequences genetic scheduling for multiprocessor systems using task duplication , 2004, Microprocess. Microsystems.

[7]  Jonathan A. Wright,et al.  Self-adaptive fitness formulation for constrained optimization , 2003, IEEE Trans. Evol. Comput..

[8]  Enrique Alba,et al.  Heterogeneous Computing and Parallel Genetic Algorithms , 2002, J. Parallel Distributed Comput..

[9]  Jean-Michel Renders,et al.  Hybrid methods using genetic algorithms for global optimization , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[10]  Kalyanmoy Deb,et al.  A domain-specific crossover and a helper objective for generating minimum weight compliant mechanisms , 2008, GECCO '08.

[11]  Jun Zhang,et al.  Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms , 2007, IEEE Transactions on Evolutionary Computation.

[12]  Bu-Sung Lee,et al.  Efficient Hierarchical Parallel Genetic Algorithms using Grid computing , 2007, Future Gener. Comput. Syst..