• DocumentCode
    620530
  • Title

    The application of an improved cultural algorithm in grid computing

  • Author

    Zhou Wei ; Bu Yan-ping ; Zhou Ye-qing

  • Author_Institution
    Sch. of Bus., East China Univ. of Sci. & Technol., Shanghai, China
  • fYear
    2013
  • fDate
    25-27 May 2013
  • Firstpage
    4565
  • Lastpage
    4570
  • Abstract
    A cultural algorithm, rooting from simulation of evolution of human being society, provides a new computable framework of evolution algorithms. A novel cultural algorithm based on particle swarm optimization (PSO) algorithm was proposed in this paper. With the advent of the grid, task scheduling in heterogeneous environments becomes more and more important. After analyzing the model of grid scheduling problem, the CPSO algorithm was presented to solve the resource scheduling problem in grid computing. The optimal objective is to minimize the total completing time. The improved algorithm can keep all the advantages of the standard PSO, such as implementation simplicity, low computational burden, and few control parameters, etc. Simulation results demonstrate that it can be superior to the regular PSO. We also tested the CPSO algorithm with the Max-Min method to show the algorithm´s efficiency.
  • Keywords
    cultural aspects; evolutionary computation; grid computing; minimax techniques; particle swarm optimisation; Max-Min method; PSO algorithm; computable framework; evolution algorithms; grid computing; grid scheduling problem; human being society; improved cultural algorithm application; particle swarm optimization; resource scheduling problem; Algorithm design and analysis; Cultural differences; Particle swarm optimization; Processor scheduling; Scheduling; Sociology; Statistics; cultural algorithm; grid; particle swarm optimization algorithm; task scheduling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference (CCDC), 2013 25th Chinese
  • Conference_Location
    Guiyang
  • Print_ISBN
    978-1-4673-5533-9
  • Type

    conf

  • DOI
    10.1109/CCDC.2013.6561759
  • Filename
    6561759