%0 Conference Proceedings
%T Online Job-Migration for Reducing the Electricity Bill in the Cloud
%+ Open University of Israël
%+ Microsoft Research
%A Buchbinder, Niv
%A Jain, Navendu
%A Menache, Ishai
%Z Part 4: Energy Efficiency
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th IFIP Networking Conference (NETWORKING)
%C Valencia, Spain
%Y Jordi Domingo-Pascual
%Y Pietro Manzoni
%Y Sergio Palazzo
%Y Ana Pont
%Y Caterina Scoglio
%I Springer
%3 NETWORKING 2011
%V LNCS-6640
%N Part I
%P 172-185
%8 2011-05-09
%D 2011
%R 10.1007/978-3-642-20757-0_14
%K cloud computing
%K energy efficiency
%K job migration
%K datacenters
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01583406/document
%2 https://inria.hal.science/hal-01583406/file/978-3-642-20757-0_14_Chapter.pdf
%L hal-01583406
%U https://inria.hal.science/hal-01583406
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-NETWORKING
%~ IFIP-LNCS-6640