The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Improving dynamic voltage scaling algorithms with PACE
Abstract
This paper addresses algorithms for dynamically varying (scaling) CPU speed and voltage in order to save energy. Such scaling is useful and effective when it is immaterial when a task completes, as long as it meets some deadline. We show how to modify any scaling algorithm to keep performance the same but minimize expected energy consumption. We refer to our approach as PACE (Processor Acceleration to Conserve Energy) since the resulting schedule increases speed as the task progresses. Since PACE depends on the probability distribution of the task's work requirement, we present methods for estimating this distribution and evaluate these methods on a variety of real workloads. We also show how to approximate the optimal schedule with one that changes speed a limited number of times. Using PACE causes very little additional overhead, and yields substantial reductions in CPU energy consumption. Simulations using real workloads show it reduces the CPU energy consumption of previously published algorithms by up to 49.5%, with an average of 20.6%, without any effect on performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Numerical recipes in C: the art of scientific computing
(1993) · Choice Reviews Online · doi:10.5860/choice.30-5638 · Cited by 17,933
Density Estimation for Statistics and Data Analysis
Silverman, B. W. (2018) · Routledge eBooks · doi:10.1201/9781315140919 · Cited by 15,796
Numerical recipes in Pascal: the art of scientific computing
(1990) · Choice Reviews Online · doi:10.5860/choice.27-5158 · Cited by 11,811
Density Estimation for Statistics and Data Analysis
(1986) · Springer eBooks · doi:10.1007/978-1-4899-3324-9 · Cited by 8,525
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433 · cited 1×
“One important result is that if a set of tasks has feasible deadlines, scheduling them in increasing deadline order will always make all the deadlines [11].”
BackgroundDesigning the user interface: Strategies for effective human-computer interaction
(1993) · Applied Ergonomics · doi:10.1016/0003-6870(93)90471-k · Cited by 5,587
Numerical Recipes in C: The Art of Scientific Computing.
Birchenhall, C., Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · The Economic Journal · doi:10.2307/2234664 · Cited by 4,355
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
LIU, C. L., & LAYLAND, J. W. (2002) · Readings in Hardware/Software Co-Design · doi:10.1016/b978-155860702-6/50016-8 · Cited by 3,233
Designing the user interface strategies for effective human-computer interaction
Shneiderman, B. (1987) · ACM SIGBIO Newsletter · doi:10.1145/25065.950626 · Cited by 2,798
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
Chandrakasan, A. P., Sheng, S., & Brodersen, R. W. (2015) · Cited by 2,232
Chandrakasan, A. P., Sheng, S., & Brodersen, R. W. (1992) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.126534 · Cited by 2,156
(1992) · Choice Reviews Online · doi:10.5860/choice.29-3347 · Cited by 2,095
Distributions in Statistics: Continuous Multivariate Distributions.
Fisk, P. R., Johnson, N. L., & Kotz, S. (1973) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344756 · Cited by 1,543
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
Scheduling for Reduced CPU Energy
Weiser, M., Welch, B., Demers, A., & Shenker, S. (2007) · The Kluwer International Series in Engineering and Computer Science · doi:10.1007/978-0-585-29603-6_17 · Cited by 1,181
Energy-aware adaptation for mobile applications
Flinn, J., & Satyanarayanan, M. (1999) · Proceedings of the seventeenth ACM symposium on Operating systems principles · doi:10.1145/319151.319155 · Cited by 596
Comparing algorithm for dynamic speed-setting of a low-power CPU
Govil, K., Chan, E., & Wasserman, H. (1995) · Proceedings of the 1st annual international conference on Mobile computing and networking - MobiCom '95 · doi:10.1145/215530.215546 · Cited by 454
(1992) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 451
Design issues for dynamic voltage scaling
Burd, T. D., & Brodersen, R. W. (2000) · Proceedings of the 2000 international symposium on Low power electronics and design - ISLPED '00 · doi:10.1145/344166.344181 · Cited by 363
Policies for dynamic clock scheduling
Grunwald, D. C., Morrey, C. B., Levis, P. A., Neufeld, M., & Farkas, K. I. (2000) · doi:10.5555/1251229.1251235 · Cited by 286
Smooth Tests of Goodness of Fit
King, T. (1991) · Technometrics · doi:10.1080/00401706.1991.10484896 · Cited by 215
Cited by
Real-time dynamic voltage scaling for low-power embedded operating systems
Pillai, P., & Shin, K. G. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502044 · Cited by 1,138
Energy-Optimal Mobile Cloud Computing under Stochastic Wireless Channel
Zhang, W., Wen, Y., Guan, K., Kilper, D., Luo, H., & Wu, D. O. (2013) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2013.072513.121842 · Cited by 863
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
Managing server energy and operational costs in hosting centers
Chen, Y., Das, A., Qin, W., Sivasubramaniam, A., Wang, Q., & Gautam, N. (2005) · Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/1064212.1064253 · Cited by 556
Energy Efficient Mobile Cloud Computing Powered by Wireless Energy Transfer
You, C., Huang, K., & Chae, H. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2016.2545382 · Cited by 495
Metadata
- Authors
- Lorch, J. R., & Smith, A. J.
- Venue
- Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 2001-06
- Pages
- 50-61
- OpenAlex
- W2108387401
- Cited by
- 386
- References
- 22
- FWCI
- 16.92
- 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
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.