Dynamic Right-Sizing for Power-Proportional Data Centers

IEEE/ACM Transactions on Networking (TON)(2013)

引用 571|浏览367
暂无评分
摘要
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.
更多
查看译文
关键词
Servers,Delay,Heuristic algorithms,Optimization,Switches,Prediction algorithms,Load modeling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要