Dynamic right-sizing for power-proportional data centers

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 tu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 Proceedings IEEE INFOCOM s. 1098 - 1106
Hlavní autoři: Minghong Lin, Wierman, A., Andrew, L. L. H., Thereska, E.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2011
Témata:
Data models
Delay
Heuristic algorithms
Optimization
Prediction algorithms
Servers
Switches
ISBN:1424499194, 9781424499199
ISSN:0743-166X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424499194
9781424499199
ISSN:0743-166X
DOI:10.1109/INFCOM.2011.5934885