A Caltech Library Service

Dynamic right-sizing for power-proportional data centers

Lin, Minghong and Wierman, Adam and Andrew, Lachlan L. H. and Thereska, Eno (2011) Dynamic right-sizing for power-proportional data centers. In: 2011 IEEE INFOCOM Proceedings. IEEE Infocom. IEEE , Piscataway, NJ, pp. 1098-1106. ISBN 978-1-4244-9919-9.

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item:


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.

Item Type:Book Section
Related URLs:
URLURL TypeDescription ItemJournal Article
Additional Information:© 2011 IEEE. Date of Current Version: 30 June 2011.
Series Name:IEEE Infocom
Record Number:CaltechAUTHORS:20120405-090850105
Persistent URL:
Official Citation:Minghong Lin; Wierman, A.; Andrew, L.L.H.; Thereska, E.; , "Dynamic right-sizing for power-proportional data centers," INFOCOM, 2011 Proceedings IEEE , vol., no., pp.1098-1106, 10-15 April 2011 doi: 10.1109/INFCOM.2011.5934885 URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:29989
Deposited By: Ruth Sustaita
Deposited On:05 Apr 2012 16:38
Last Modified:09 Nov 2021 19:34

Repository Staff Only: item control page