The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Green: a framework for supporting energy-conscious programming using controlled approximation
Abstract
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeoff quality of service/solution (QoS) for improvements in performance and reduction in energy consumption. Programmers sometimes take advantage of such opportunities, albeit in an ad-hoc manner and often without providing any QoS guarantees.
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
(2007) · doi:10.1145/1294261.1294281 · Cited by 3,447 · cited 1×
“Programmers often take advantage of such Quality of Service (QoS) tradeoffs by making use of domain-speci.c characteristics and employing a variety of heuristics.”
MethodThe PARSEC benchmark suite: characterization and architectural implications
Bienia, C., Kumar, S., Singh, J. P., & Li, K. (2008) · Proceedings of the 17th international conference on Parallel architectures and compilation techniques · doi:10.1145/1454115.1454128 · Cited by 3,444
Kajiya, J. T. (1986) · ACM SIGGRAPH Computer Graphics · doi:10.1145/15886.15902 · Cited by 2,238
The fast Fourier transform and its applications
(1989) · Choice Reviews Online · doi:10.5860/choice.26-3285 · Cited by 2,117
Ethernet: distributed packet switching for local computer networks
Metcalfe, R. M., & Boggs, D. R. (1983) · Communications of the ACM · doi:10.1145/357980.358015 · Cited by 1,509
Dynamo: amazon's highly available key-value store
DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., & Vogels, W. (2007) · ACM SIGOPS Operating Systems Review · doi:10.1145/1323293.1294281 · Cited by 1,151
Coordination languages and their significance
Gelernter, D., & Carriero, N. (1992) · Communications of the ACM · doi:10.1145/129630.129635 · Cited by 1,008
(2020) · Springer eBooks · doi:10.1007/978-3-319-78262-1_300273 · Cited by 253
Soft computing: the convergence of emerging reasoning technologies
Bonissone, P. P. (1997) · Soft Computing - A Fusion of Foundations, Methodologies and Applications · doi:10.1007/s005000050002 · Cited by 237
Liu, J. W. S., Shih, W., Lin, K.-J., Bettati, R., & Chung, J. (1994) · Proceedings of the IEEE · doi:10.1109/5.259428 · Cited by 233
Defect and error tolerance in the presence of massive numbers of defects
Breuer, M. A., Gupta, S. K., & Mak, T. M. (2004) · IEEE Design and Test of Computers · doi:10.1109/mdt.2004.8 · Cited by 227
Probabilistic accuracy bounds for fault-tolerant computations that discard tasks
Rinard, M. (2006) · Proceedings of the 20th annual international conference on Supercomputing · doi:10.1145/1183401.1183447 · Cited by 183
Using Code Perforation to Improve Performance, Reduce Energy Consumption, and Respond to Failures
Agarwal, A., Rinard, M., Sidiroglou, S., Misailovíc, S., & Hoffmann, H. (2009) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 133
Using early phase termination to eliminate load imbalances at barrier synchronization points
Rinard, M. (2007) · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · doi:10.1145/1297027.1297055 · Cited by 90
Exploiting Soft Computing for Increased Fault Tolerance
Li, X., & Yeung, D. (2006) · Cited by 34
Cited by
A Survey of Techniques for Approximate Computing
Mittal, S. (2016) · ACM Computing Surveys · doi:10.1145/2893356 · Cited by 1,058
Neural Acceleration for General-Purpose Approximate Programs
Esmaeilzadeh, H., Sampson, A., Ceze, L., & Burger, D. (2012) · 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2012.48 · Cited by 626
EnerJ: approximate data types for safe and general low-power computation
Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., & Grossman, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993518 · Cited by 589
Analysis and characterization of inherent application resilience for approximate computing
Chippa, V. K., Chakradhar, S. T., Roy, K., & Raghunathan, A. (2013) · Proceedings of the 50th Annual Design Automation Conference · doi:10.1145/2463209.2488873 · Cited by 546
OpenTuner: an extensible framework for program autotuning
Ansel, J., Kamil, S., Veeramachaneni, K., Ragan-Kelley, J., Bosboom, J., O'Reilly, U.-M., & Amarasinghe, S. (2014) · Proceedings of the 23rd international conference on Parallel architectures and compilation · doi:10.1145/2628071.2628092 · Cited by 530
Metadata
- Authors
- Baek, W., & Chilimbi, T. M.
- Venue
- Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2010-06-05
- Pages
- 198-209
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W2114703523
- Cited by
- 440
- References
- 15
- FWCI
- 16.74
- 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.