• DocumentCode
    2094895
  • Title

    Independent Tasks Scheduling Based on Genetic Algorithm in Cloud Computing

  • Author

    Zhao, Chenhong ; Zhang, Shanshan ; Liu, Qingfeng ; Xie, Jian ; Hu, Jicheng

  • Author_Institution
    Int. Sch. of Software, Wuhan Univ., Wuhan, China
  • fYear
    2009
  • fDate
    24-26 Sept. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Task scheduling algorithm, which is an NP-completeness problem, plays a key role in cloud computing systems. In this paper, we propose an optimized algorithm based on genetic algorithm to schedule independent and divisible tasks adapting to different computation and memory requirements. We prompt the algorithm in heterogeneous systems, where resources (including CPUs) are of computational and communication heterogeneity. Dynamic scheduling is also in consideration. Though GA is designed to solve combinatorial optimization problem, it´s inefficient for global optimization. So we conclude with further researches in optimized genetic algorithm.
  • Keywords
    Internet; combinatorial mathematics; genetic algorithms; scheduling; NP-complete problem; cloud computing; combinatorial optimization problem; dynamic scheduling; genetic algorithm; global optimization; heterogeneous systems; independent tasks scheduling; Application software; Cloud computing; Design optimization; Dynamic scheduling; Genetic algorithms; Job shop scheduling; Laboratories; Processor scheduling; Scheduling algorithm; Service oriented architecture;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-3692-7
  • Electronic_ISBN
    978-1-4244-3693-4
  • Type

    conf

  • DOI
    10.1109/WICOM.2009.5301850
  • Filename
    5301850