The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Energy-efficient algorithms
Abstract
Algorithmic solutions can help reduce energy consumption in computing environs.
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
Amortized efficiency of list update and paging rules
Sleator, D. D., & Tarjan, R. E. (1985) · Communications of the ACM · doi:10.1145/2786.2793 · Cited by 2,123
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
A survey of design techniques for system-level dynamic power management
Benini, L., Bogliolo, A., & De Micheli, G. (2000) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/92.845896 · Cited by 1,241
Speed scaling to manage energy and temperature
Bansal, N., Kimbrel, T., & Pruhs, K. (2007) · Journal of the ACM · doi:10.1145/1206035.1206038 · Cited by 356
Algorithmic problems in power management
Irani, S., & Pruhs, K. R. (2005) · ACM SIGACT News · doi:10.1145/1067309.1067324 · Cited by 303
Competitive randomized algorithms for nonuniform problems
Karlin, A. R., Manasse, M. S., McGeoch, L. A., & Owicki, S. (1994) · Algorithmica · doi:10.1007/bf01189993 · Cited by 258
The Price of Performance: An Economic Case for Chip Multiprocessing
Barroso, L. A. (2005) · Queue · doi:10.1145/1095408.1095420 · Cited by 236
Irani, S., Shukla, S., & Gupta, R. (2007) · ACM Transactions on Algorithms · doi:10.1145/1290672.1290678 · Cited by 222
Online strategies for dynamic power management in systems with multiple power-saving states
Irani, S., Shukla, S., & Gupta, R. (2003) · ACM Transactions on Embedded Computing Systems · doi:10.1145/860176.860180 · Cited by 181
Power-aware scheduling for makespan and flow
Bunde, D. P. (2006) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1148109.1148140 · Cited by 117
Augustine, J. E., Irani, S., & Swamy, C. (2008) · SIAM Journal on Computing · doi:10.1137/05063787x · Cited by 74
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Lam, T., Lee, L., To, I. K. K., & Wong, P. W. H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87744-8_54 · Cited by 70
Irani, S., Singh, G. K., Shukla, S. K., & Gupta, R. K. (2005) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2005.862725 · Cited by 58
Scheduling to minimize gaps and power consumption
Demaine, E. D., Ghodsi, M., Hajiaghayi, M., Sayedi-Roshkhar, A. S., & Zadimoghaddam, M. (2007) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1248377.1248385 · Cited by 37
Latency Constrained Aggregation in Sensor Networks
Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L., & Vitaletti, A. (2006) · Lecture notes in computer science · doi:10.1007/11841036_11 · Cited by 34
Improved Approximation Results for the Minimum Energy Broadcasting Problem
Flammini, M., Klasing, R., Alfredo Navarra, B., & Pérennès, S. (2007) · Algorithmica · doi:10.1007/s00453-007-9077-7 · Cited by 9
Cited by
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
A Survey of Green Networking Research
Bianzino, A. P., Chaudet, C., Rossi, D., & Rougier, J.-L. (2012) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.113010.00106 · Cited by 571
Energy-efficient scheduling in manufacturing companies: A review and research framework
Gahm, C., Denz, F., Dirr, M., & Tuma, A. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.07.017 · Cited by 474
Greening geographical load balancing
Liu, Z., Lin, M., Wierman, A., Low, S. H., & Andrew, L. L. H. (2011) · Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems · doi:10.1145/1993744.1993767 · Cited by 467
Dynamic Right-Sizing for Power-Proportional Data Centers
Lin, M., Wierman, A., Andrew, & Thereska, E. (2013) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2226216 · Cited by 446
Metadata
- Authors
- Albers, S.
- Venue
- Communications of the ACM
- Published
- 2010-05
- Volume
- 53
- Issue
- 5
- Pages
- 86-96
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2014008637
- Cited by
- 459
- References
- 16
- FWCI
- 64.83
- 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
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.