Published April 2011 | Version public
Book Section - Chapter

Dynamic right-sizing for power-proportional data centers

  • 1. ROR icon California Institute of Technology
  • 2. ROR icon Swinburne University of Technology
  • 3. ROR icon Microsoft (United States)

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.

Additional Information

© 2011 IEEE. Date of Current Version: 30 June 2011.

Additional details

Identifiers

Eprint ID
29989
Resolver ID
CaltechAUTHORS:20120405-090850105

Dates

Created
2012-04-05
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field

Caltech Custom Metadata

Series Name
IEEE Infocom