Online Job-Migration for Reducing the Electricity Bill in the Cloud

Energy costs are becoming the fastest-growing element in datacenter operation costs. One basic approach to reduce these costs is to exploit the spatiotemporal variation in electricity prices by moving computation to datacenters in which energy is available at a cheaper price. However, injudicious job migration between datacenters might increase the overall operation cost due to the bandwidth costs of transferring application state and data over the wide-area network. To address this challenge, we propose novel online algorithms for migrating batch jobs between datacenters, which handle the fundamental tradeoff between energy and bandwidth costs. A distinctive feature of our algorithms is that they consider not only the current availability and cost of (possibly multiple) energy sources, but also the future variability and uncertainty thereof. Using the framework of competitive-analysis, we establish worst-case performance bounds for our basic online algorithm. We then propose a practical, easy-to-implement version of the basic algorithm, and evaluate it through simulations on real electricity pricing and job workload data. The simulation results indicate that our algorithm outperforms plausible greedy algorithms that ignore future outcomes. Notably, the actual performance of our approach is significantly better than the theoretical guarantees, within 6% of the optimal offline solution.

[1]  Joseph Naor,et al.  Metrical Task Systems and the k-Server Problem on HSTs , 2010, ICALP.

[2]  Tejaswi Redkar,et al.  Windows Azure Platform , 2010 .

[3]  Joseph Naor,et al.  Randomized competitive algorithms for generalized caching , 2008, STOC.

[4]  NaorJoseph,et al.  The Design of Competitive Online Algorithms via a Primal , 2009 .

[5]  Rajkumar Buyya,et al.  Energy Efficient Resource Management in Virtualized Cloud Data Centers , 2010, 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing.

[6]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[7]  Margaret Martonosi,et al.  Managing the cost, energy consumption, and carbon footprint of internet services , 2010, SIGMETRICS '10.

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

[9]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[10]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[11]  Mor Harchol-Balter,et al.  Optimality analysis of energy-performance trade-off for server farm management , 2010, Perform. Evaluation.

[12]  Yuval Peres,et al.  Mixing Time Power Laws at Criticality , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[14]  Amos Fiat,et al.  Better algorithms for unfair metrical task systems and applications , 2000, STOC '00.

[15]  Joseph Naor,et al.  Towards the randomized k-server conjecture: a primal-dual approach , 2010, SODA '10.

[16]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[17]  Joseph Naor,et al.  A primal-dual randomized algorithm for weighted paging , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

[19]  Xue Liu,et al.  Minimizing Electricity Cost: Optimization of Distributed Internet Data Centers in a Multi-Electricity-Market Environment , 2010, 2010 Proceedings IEEE INFOCOM.

[20]  Sanjay Ghemawat,et al.  MapReduce: simplified data processing on large clusters , 2008, CACM.

[21]  Andrew Tomkins,et al.  A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.

[22]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[23]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.