Swinburne
Browse
- No file added yet -

Dynamic right-sizing for power-proportional data centers

Download (395.13 kB)
conference contribution
posted on 2024-07-13, 08:13 authored by Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, Eno Thereska
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.

History

Available versions

PDF (Accepted manuscript)

ISBN

9781424499199

Journal title

30th IEEE International Conference on Computer Communications (IEEE INFOCOM 2011), Shanghai, China, 10-15 April 2011

Conference name

30th IEEE International Conference on Computer Communications IEEE INFOCOM 2011, Shanghai, China, 10-15 April 2011

Pagination

8 pp

Publisher

IEEE

Copyright statement

Copyright © 2011 IEEE. The accepted manuscript is reproduced in accordance with the copyright policy of the publisher. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

Language

eng

Usage metrics

    Publications

    Categories

    No categories selected

    Keywords

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC