Dynamic Right-Sizing for Power-Proportional Data Centers

By Minghong Lin, Adam Wierman, L. Andrew, Eno Thereska. IEEE/ACM Transactions on Networking, 2011

770 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Information Systems

View Paper: https://www.semanticscholar.org/paper/686ea1426a50b5e263c1acb845d3d6f7558e9eb4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Khaled Ben Letaief
  2. Jun Zhang
  3. Kaibin Huang
  4. Changsheng You
  5. Jie Xu
  6. Yonggang Wen
  7. Miyuru Dayarathna
  8. Yuyi Mao

In Information Systems

  1. Yonggang Wen
  2. Miyuru Dayarathna
  3. Adam Wierman
  4. Rayadurgam Srikant
  5. Mugen Peng
  6. Srinivasan Keshav
  7. Khaled Ben Letaief
  8. Rolf Stadler

Citations in the corpus