The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Dynamic right-sizing for power-proportional data centers
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 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.
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.
Integrity signals
Registry
Cites
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.
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
Lee, J. H., Kaisare, N. S., & García, C. E. (2007) · Springer eBooks · doi:10.1002/9781394333325.fmatter · Cited by 3,766
Live migration of virtual machines
Clark, C. J., Fraser, K. A., Hand, S., Hansen, J. G., Jul, E., Limpach, C., Pratt, I., & Warfield, A. (2005) · doi:10.5555/1251203.1251223 · Cited by 2,562
The Case for Energy-Proportional Computing
Barroso, L. A., & Hölzle, U. (2007) · Computer · doi:10.1109/mc.2007.443 · Cited by 2,491
Online Computation and Competitive Analysis
Borodin, A., & El‐Yaniv, R. (1998) · Cited by 2,333
A scheduling model for reduced CPU energy
Yao, F., Demers, A. J., & Shenker, S. J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492493 · Cited by 1,457
Managing energy and server resources in hosting centers
Chase, J. S., Anderson, D. C., Thakar, P. N., Vahdat, A. M., & Doyle, R. P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502045 · Cited by 1,284
Corriou, J.-P. (2004) · Process Control · doi:10.1007/978-1-4471-3848-8_16 · Cited by 1,271
Queueing systems, volume II: computer applications
Cooper, R. B. (1977) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(77)90118-3 · Cited by 829
A Taxonomy and Survey of Energy-Efficient Data Centers and Cloud Computing Systems
Beloglazov, A., Buyya, R., Lee, Y. C., & Zomaya, A. (2011) · Advances in Computers · doi:10.1016/b978-0-12-385512-1.00003-7 · Cited by 777
Power and performance management of virtualized computing environments via lookahead control
Kusic, D., Kephart, J. O., Hanson, J. E., Kandasamy, N., & Jiang, G. (2009) · Cluster Computing · doi:10.1007/s10586-008-0070-y · Cited by 699
Cited by
Resource Management in Clouds: Survey and Research Challenges
Jennings, B., & Stadler, R. (2015) · Journal of Network and Systems Management · doi:10.1007/s10922-014-9307-7 · Cited by 548
Online Learning for Offloading and Autoscaling in Energy Harvesting Mobile Edge Computing
Xu, J., Chen, L., & Ren, S. (2017) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2017.2725277 · Cited by 368
Online algorithms for geographical load balancing
Lin, M., Liu, Z., Wierman, A., & Andrew, L. L. H. (2012) · 2012 International Green Computing Conference (IGCC) · doi:10.1109/igcc.2012.6322266 · Cited by 290
Self-citationEnergy and Carbon-Efficient Placement of Virtual Machines in Distributed Cloud Data Centers
Khosravi, A., Garg, S. K., & Buyya, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40047-6_33 · Cited by 156
(2018) · doi:10.1109/tcc.2016.2535201 · Cited by 39
Metadata
- Authors
- Lin, M., Wierman, A., Andrew, L. L. H., & Thereska, E.
- Venue
- 2011 Proceedings IEEE INFOCOM
- Publisher
- IEEE
- Published
- 2011-04
- Pages
- 1098-1106
- OpenAlex
- W2135798231
- Cited by
- 437
- References
- 32
- FWCI
- 50.72
- Type
- conference paper
- Language
- en
- Open access
- closed
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/infcom.2011.5934885
- The paper
- Lin, M., Wierman, A., Andrew, L. L. H., & Thereska, E. (2011). Dynamic right-sizing for power-proportional data centers. 2011 Proceedings IEEE INFOCOM. https://doi.org/10.1109/infcom.2011.5934885
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.