Dynamic right-sizing for power-proportional data centers
| Citations: | 14 - 7 self |
BibTeX
@MISC{Lin_dynamicright-sizing,
author = {Minghong Lin and Adam Wierman and Lachlan L. H. Andrew and Eno Thereska},
title = {Dynamic right-sizing for power-proportional data centers},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 predictably 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 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. I.
