Demand Response aware cluster resource provisioning for parallel applications

Data center energy consumption is significant and accounts for about 2% of total energy use in the U.S. recently. A range of approaches, from cooling techniques to workload consolidation have been taken to improve data center energy efficiency. In contrast to most methods published so far, this paper treats a data centre as a consumer in an electricity market. Our intention is to make data centres more responsive to electricity market conditions with minimal impact on their performance. In electricity markets, Demand Response(DR) is a method for improving grid efficiency by encouraging consumers to adjust their demand during price peaks or network stress. Significant consumption and cost savings can potentially be made via implementing DR programs involving a large set of consumers. Traditionally, DR has been a largely manual process, however, automated DR is becoming increasingly prevalent due to the deployment of smart grid technologies. In this paper, we treat the server cluster in a data centre as an energy consumer that participates DR activities. We give two algorithms to enable the cluster to automatically adjust the number of active servers to respond to DR requests while maintaining acceptable system performance. We evaluate our algorithms using real traces.

[1]  Albert Y. Zomaya,et al.  Profiling Applications for Virtual Machine Placement in Clouds , 2011, 2011 IEEE 4th International Conference on Cloud Computing.

[2]  Dror G. Feitelson,et al.  Paired Gang Scheduling , 2003, IEEE Trans. Parallel Distributed Syst..

[3]  Richard E. Brown,et al.  Report to Congress on Server and Data Center Energy Efficiency: Public Law 109-431 , 2008 .

[4]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[5]  David A. Lifka,et al.  The ANL/IBM SP Scheduling System , 1995, JSSPP.

[6]  Dror G. Feitelson,et al.  Improved Utilization and Responsiveness with Gang Scheduling , 1997, JSSPP.

[7]  Dan Tsafrir,et al.  Backfilling Using System-Generated Predictions Rather than User Runtime Estimates , 2007, IEEE Transactions on Parallel and Distributed Systems.

[8]  James Patton Jones,et al.  Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization , 1999, JSSPP.

[9]  Dan Tsafrir,et al.  A Short Survey of Commercial Cluster Batch Schedulers , 2005 .

[10]  Thomas F. Wenisch,et al.  PowerNap: eliminating server idle power , 2009, ASPLOS.

[11]  Sujata Banerjee,et al.  ElasticTree: Saving Energy in Data Center Networks , 2010, NSDI.

[12]  Henri Casanova,et al.  Dynamic fractional resource scheduling for HPC workloads , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS).

[13]  Alexandru Iosup,et al.  Scheduling Strategies for Cycle Scavenging in Multicluster Grid Systems , 2009, 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid.

[14]  Luiz André Barroso,et al.  The Case for Energy-Proportional Computing , 2007, Computer.

[15]  Dror G. Feitelson,et al.  Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860 , 1995, JSSPP.

[16]  Sila Kiliccote,et al.  Open Automated Demand Response Communications Specification (Version 1.0) , 2009 .

[17]  Bruce M. Maggs,et al.  Cutting the electric bill for internet-scale systems , 2009, SIGCOMM '09.

[18]  Lachlan L. H. Andrew,et al.  Greening geographical load balancing , 2011, PERV.

[19]  Amar Phanishayee,et al.  FAWN: a fast array of wimpy nodes , 2009, SOSP '09.

[20]  Anand Sivasubramaniam,et al.  An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration , 2001, JSSPP.

[21]  Uwe Schwiegelshohn,et al.  Theory and Practice in Parallel Job Scheduling , 1997, JSSPP.