The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Speed scaling to manage energy and temperature
Abstract
Speed scaling is a power management technique that involves dynamically changing the speed of a processor. We study policies for setting the speed of the processor for both of the goals of minimizing the energy used and the maximum temperature attained. The theoretical study of speed scaling policies to manage energy was initiated in a seminal paper by Yao et al. [1995], and we adopt their setting. We assume that the power required to run at speed s is P ( s ) = s α for some constant α > 1. We assume a collection of tasks, each with a release time, a deadline, and an arbitrary amount of work that must be done between the release time and the deadline. Yao et al. [1995] gave an offline greedy algorithm YDS to compute the minimum energy schedule. They further proposed two online algorithms Average Rate (AVR) and Optimal Available (OA), and showed that AVR is 2 α − 1 α α -competitive with respect to energy. We provide a tight α α bound on the competitive ratio of OA with respect to energy. We initiate the study of speed scaling to manage temperature. We assume that the environment has a fixed ambient temperature and that the device cools according to Newton's law of cooling. We observe that the maximum temperature can be approximated within a factor of two by the maximum energy used over any interval of length 1/ b , where b is the cooling parameter of the device. We define a speed scaling policy to be cooling-oblivious if it is simultaneously constant-competitive with respect to temperature for all cooling parameters. We then observe that cooling-oblivious algorithms are also constant-competitive with respect to energy, maximum speed and maximum power. We show that YDS is a cooling-oblivious algorithm. In contrast, we show that the online algorithms OA and AVR are not cooling-oblivious. We then propose a new online algorithm that we call BKP. We show that BKP is cooling-oblivious. We further show that BKP is e -competitive with respect to the maximum speed, and that no deterministic online algorithm can have a better competitive ratio. BKP also has a lower competitive ratio for energy than OA for α ≥5. Finally, we show that the optimal temperature schedule can be computed offline in polynomial-time using the Ellipsoid algorithm.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Adhi Harmoko, S., M.Komp, Jacquard, J. M., Zuse, K., & Eniac (2005) · Cited by 18,035
Proceedings of the National Academy of Sciences, USA
(1996) · Current Biology · doi:10.1016/s0960-9822(09)00431-x · Cited by 5,258
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
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
Hard real-time computing systems: Predictable scheduling algorithms and applications
(1998) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(98)90205-x · Cited by 1,327
Algorithmic problems in power management
Irani, S., & Pruhs, K. R. (2005) · ACM SIGACT News · doi:10.1145/1067309.1067324 · Cited by 303
Self-citationVariational methods in optimization
Smith, D. R. (1974) · Cited by 199
Cited by
Concurrency and Computation: Practice and Experience
(2006) · Concurrency and Computation Practice and Experience · doi:10.1002/(issn)1532-0634 · Cited by 738
Albers, S. (2010) · Communications of the ACM · doi:10.1145/1735223.1735245 · Cited by 459
Green IoT for Eco-Friendly and Sustainable Smart Cities: Future Directions and Opportunities
Almalki, F. A., Alsamhi, S. H., Sahal, R., Hassan, J., Hawbani, A., Rajput, N. S., Saif, A., Morgan, J., & Breslin, J. (2023) · Mobile Networks and Applications · doi:10.1007/s11036-021-01790-w · Cited by 376
Metadata
- Authors
- Bansal, N., Kimbrel, T., & Pruhs, K.
- Venue
- Journal of the ACM
- Published
- 2007-03
- Volume
- 54
- Issue
- 1
- Pages
- 1-39
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2138779116
- Cited by
- 356
- References
- 8
- FWCI
- 26.32
- Type
- journal article
- 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: Speed scaling to manage energy and temperature. https://app.cochat.ai/papers/10.1145/1206035.1206038
- The paper
- Bansal, N., Kimbrel, T., & Pruhs, K. (2007). Speed scaling to manage energy and temperature. Journal of the ACM. https://doi.org/10.1145/1206035.1206038
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.