Optimality analysis of energy-performance trade-off for server farm management

被引:140
作者
Gandhi, Anshul [1 ]
Gupta, Varun [1 ]
Harchol-Balter, Mor [1 ]
Kozuch, Michael A. [2 ]
机构
[1] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
[2] Intel Res, Pittsburgh, PA 15213 USA
关键词
Power management; Data centers; Capacity provisioning; Setup costs; Performance-per-Watt; Energy-delay product; ALGORITHMS;
D O I
10.1016/j.peva.2010.08.009
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A central question in designing server farms today is how to efficiently provision the number of servers to extract the best performance under unpredictable demand patterns while not wasting energy While one would like to turn servers off when they become idle to save energy the large setup cost (both in terms of setup time and energy penalty) needed to switch the server back on can adversely affect performance The problem is made more complex by the fact that today s servers provide multiple sleep or standby states which trade off the setup cost with the power consumed while the server is sleeping With so many controls finding the optimal server farm management policy is an almost intractable problem - How many servers should be on at any given time how many should be off and how many should be in some sleep state? In this paper we employ the popular metric of Energy-Response time Product (ERP) to capture the energy-performance trade-off and present the first theoretical results on the optimality of server farm management policies For a stationary demand pattern we prove that there exists a very small natural class of policies that always contains the optimal policy for a single server and conjecture it to contain a near-optimal policy for multi-server systems For time-varying demand patterns we propose a simple traffic-oblivious policy and provide analytical and empirical evidence for its near-optimality (C) 2010 Elsevier B V All rights reserved
引用
收藏
页码:1155 / 1171
页数:17
相关论文
共 25 条
  • [1] Combining make to order and make to stock
    Adan, IJBF
    van der Wal, J
    [J]. OR SPEKTRUM, 1998, 20 (02) : 73 - 81
  • [2] Energy-Efficient Algorithms for Flow Time Minimization
    Albers, Susanne
    Fujiwara, Hiroshi
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (04)
  • [3] [Anonymous], 2005, ACM Sigact News, DOI DOI 10.1145/1067309.1067324
  • [4] Dynamic speed scaling to manage energy and temperature
    Bansal, N
    Kimbrel, T
    Pruhs, K
    [J]. 45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 520 - 529
  • [5] Speed scaling to manage energy and temperature
    Bansal, Nikhil
    Kimbrel, Tracy
    Pruhs, Kirk
    [J]. JOURNAL OF THE ACM, 2007, 54 (01)
  • [6] Bansal N, 2009, PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P693
  • [7] The case for energy-proportional computing
    Barroso, Luiz Andre
    Hoelzle, Urs
    [J]. COMPUTER, 2007, 40 (12) : 33 - +
  • [8] EGGERT L, 2005, SIGOPS OPER SYST REV, V39, P249
  • [9] Gandhi A., 2010, CMUCS10108 SCH COMP
  • [10] Energy dissipation in general purpose microprocessors
    Gonzalez, R
    Horowitz, M
    [J]. IEEE JOURNAL OF SOLID-STATE CIRCUITS, 1996, 31 (09) : 1277 - 1284