Energy-aware hierarchical scheduling of applications in large scale data centers

With the rapid advance of cloud computing, large scale data center plays a key role in cloud computing. Energy consumption of such distributed systems has become a prominent problem and received much attention. Among existing energy-saving methods, application scheduling can reduce energy consumption by replacing and consolidating applications to decrease the number of running servers. However, most application scheduling approaches did not consider the energy cost on network devices, which is also a big portion of power consumption in large data centers. In this paper we propose a Hierarchical Scheduling Algorithm for applications, namely HSA, to minimize the energy consumption of both servers and network devices. In HSA, a Dynamic Maximum Node Sorting (DMNS) method is developed to optimize the application placement on servers connected to a common switch. Hierarchical crossing-switch adjustment is applied to further reduce the number of running servers. As a result, both the number of running servers and the amount of data transfer can be greatly reduced. The time complexity of HSA is Θ(n ∗ log(logn)), where n is the total number of the severs in the data center. Its stability is verified via simulations. Experiments show that the performance of HSA outperforms existing algorithms.

[1]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[2]  Amin Vahdat,et al.  Managing energy and server resources in hosting centers , 2001, SOSP.

[3]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[4]  Pavan Balaji,et al.  Are nonblocking networks really needed for high-end-computing workloads? , 2008, 2008 IEEE International Conference on Cluster Computing.

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

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

[7]  Laurent Lefèvre,et al.  Demystifying energy consumption in Grids and Clouds , 2010, International Conference on Green Computing.

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

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

[10]  Dhabaleswar K. Panda,et al.  Towards provision of quality of service guarantees in job scheduling , 2004, 2004 IEEE International Conference on Cluster Computing (IEEE Cat. No.04EX935).

[11]  Martin Skutella,et al.  Online Scheduling with Bounded Migration , 2004, ICALP.

[12]  Gregor von Laszewski,et al.  Efficient resource management for Cloud computing environments , 2010, International Conference on Green Computing.

[13]  David S. Johnson,et al.  Near-optimal bin packing algorithms , 1973 .

[14]  Pavan Balaji,et al.  Analyzing and Minimizing the Impact of Opportunity Cost in QoS-aware Job Scheduling , 2007, 2007 International Conference on Parallel Processing (ICPP 2007).

[15]  Dhabaleswar K. Panda,et al.  QoPS: A QoS Based Scheme for Parallel Job Scheduling , 2003, JSSPP.

[16]  Feng Zhao,et al.  Energy aware consolidation for cloud computing , 2008, CLUSTER 2008.

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