Dynamic Right-Sizing for Power-Proportional Data Centers

被引:314
作者
Lin, Minghong [1 ]
Wierman, Adam [1 ]
Andrew, Lachlan L. H. [2 ]
Thereska, Eno [3 ]
机构
[1] CALTECH, Pasadena, CA 91106 USA
[2] Swinburne Univ Technol, Hawthorn, Vic 3122, Australia
[3] Microsoft Res, Cambridge CB3 0FB, England
关键词
Capacity provisioning; data centers; energy efficiency; online algorithms; ALLOCATION; OPTIMALITY; MANAGEMENT;
D O I
10.1109/TNET.2012.2226216
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:1378 / 1391
页数:14
相关论文
共 44 条
[1]   Energy-Efficient Algorithms [J].
Albers, Susanne .
COMMUNICATIONS OF THE ACM, 2010, 53 (05) :86-96
[2]  
Amur H., 2010, Proceedings of the 1st ACM symposium on Cloud computing, P217
[3]  
Andrew LLH, 2010, PERF E R SI, V38, P37, DOI 10.1145/1811099.1811044
[4]  
[Anonymous], SPEC POW DAT SPEC WE
[5]  
[Anonymous], P ACM SPAA
[6]  
[Anonymous], 2011, P ACM SIGMETRICS JOI
[7]  
[Anonymous], 2008, UCBEECS2008127
[8]  
[Anonymous], MSRTR2009153
[9]  
[Anonymous], P APPR ONL ALG
[10]  
[Anonymous], 2010, 2010 P IEEE INFOCOM, DOI DOI 10.1109/INFCOM.2010.5461933