Search Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/235775
- Title
- Dynamic right-sizing for power-proportional data centers
- Author(s)
- Lin, Minghong; Wierman, Adam; Andrew, Lachlan L. H.; Thereska, Eno
- Abstract
- Power consumption imposes a significant cost for data centers implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of low load. This paper investigates how much can be saved by dynamically 'right-sizing' the data center by turning off servers during such periods, and how to achieve that saving via an online algorithm. We propose a very general model and prove that the optimal offline algorithm for dynamic right-sizing has a simple structure when viewed in reverse time, and this structure is exploited to develop a new 'lazy' online algorithm, which is proven to be 3-competitive. We validate the algorithm using traces from two real data center workloads and show that significant cost-savings are possible. Additionally, we contrast this new algorithm with the more traditional approach of receding horizon control.
- Publication type
- Journal article
- Research centre
- Swinburne University of Technology
- Source
- IEEE/ACM Transactions on Networking, (article in press)
- Publication year
- 2013 (in press)
- FOR Code(s)
- 0805 Distributed Computing
- Keyword(s)
- Cloud computing; Cost savings; Data centres; Dynamic right-sizing; Energy consumption; Energy costs; Online algorithm; Power consumption; Servers; Service capacity; Workloads
- Publisher
- IEEE
- ISSN
- 1063-6692
- Publisher URL
- http://dx.doi.org/10.1109/TNET.2012.2226216
- Copyright
- Copyright © 2012.
- Research Projects
-
Increasing internet energy and cost efficiency by improving higher-layer protocols, Australian Research Council grant number FT0991594
- Peer reviewed



