Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 446

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Dynamic Right-Sizing for Power-Proportional Data Centers

Open access
Lin, Minghong, Wierman, Adam, Andrew, Thereska, Eno·2013·IEEE/ACM Transactions on Networking

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnet.2012.2226216

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 446

Metadata

Authors
Lin, M., Wierman, A., Andrew, & Thereska, E.
Venue
IEEE/ACM Transactions on Networking
Published
2013-10
Volume
21
Issue
5
Pages
1378-1391
ISSN
  • 1063-6692 (ISSN-L)
  • 1558-2566
OpenAlex
W2120881346
Cited by
446
References
2
FWCI
75.13
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Dynamic Right-Sizing for Power-Proportional Data Centers. https://app.cochat.ai/papers/10.1109/tnet.2012.2226216
The paper
Lin, M., Wierman, A., Andrew, & Thereska, E. (2013). Dynamic Right-Sizing for Power-Proportional Data Centers. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2012.2226216

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.