Energy-aware application scheduling based on genetic algorithm

As cloud computing is expected to expand rapidly in the coming years, the large-scale computing and data centers are becoming more and more widespread in the world. Energy consumption of these distributed systems has become a urgent problem and received much attention. Application Scheduling can alleviate this problem by reducing the number of running nodes and effectively maximizing total system efficiency. This paper focuses on scheduling applications in large-scale data centers using genetic algorithm. Specifically, we present the design and implementation of the cost function, the modification of the genetic operators and the choice of the data transition weight. The algorithm is studied via simulation and implementation in a large-scale data center. Test results and performance discussion justify the feasibility of the scheduling algorithm. From the results, we know that the proposed application scheduling method can be useful in practice, which can reduce the running nodes and minimize the cost of data transferred among the nodes efficiently.

[1]  Laurent Lefèvre,et al.  Designing and evaluating an energy efficient Cloud , 2010, The Journal of Supercomputing.

[2]  Barton P. Miller,et al.  Process migration in DEMOS/MP , 1983, SOSP '83.

[3]  Kartik Gopalan,et al.  Post-copy based live virtual machine migration using adaptive pre-paging and dynamic self-ballooning , 2009, VEE '09.

[4]  Rodney S. Tucker,et al.  Green Cloud Computing: Balancing Energy in Processing, Storage, and Transport , 2011, Proceedings of the IEEE.

[5]  Andrew P. Black,et al.  Fine-grained mobility in the Emerald system , 1987, TOCS.

[6]  Philipp Rohlfshagen,et al.  A genetic algorithm with exon shuffling crossover for hard bin packing problems , 2007, GECCO '07.

[7]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[8]  Giorgio Gambosi,et al.  Algorithms for the Relaxed Online Bin-Packing Model , 2000, SIAM J. Comput..

[9]  Hongfeng Wang,et al.  A hybrid genetic algorithm for 3D bin packing problems , 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

[10]  Hitoshi Iima,et al.  A new design of genetic algorithm for bin packing , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[11]  Felix T.S. Chan,et al.  Using genetic algorithms to solve quality-related bin packing problem , 2007 .

[12]  Martin Skutella,et al.  Online Scheduling with Bounded Migration , 2004, Math. Oper. Res..

[13]  Akshat Verma,et al.  pMapper: Power and Migration Cost Aware Application Placement in Virtualized Systems , 2008, Middleware.

[14]  Akshat Verma,et al.  Power-aware dynamic placement of HPC applications , 2008, ICS '08.

[15]  Andrew Warfield,et al.  Live migration of virtual machines , 2005, NSDI.

[16]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[17]  Víctor Ayala-Ramírez,et al.  Bin-packing using genetic algorithms , 2005, 15th International Conference on Electronics, Communications and Computers (CONIELECOMP'05).

[18]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[19]  Fred Douglis,et al.  Transparent process migration: Design alternatives and the sprite implementation , 1991, Softw. Pract. Exp..