The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
EnerJ: approximate data types for safe and general low-power computation
Abstract
Energy is increasingly a first-order concern in computer systems. Exploiting energy-accuracy trade-offs is an attractive choice in applications that can tolerate inaccuracies. Recent work has explored exposing this trade-off in programming models. A key challenge, though, is how to isolate parts of the program that must be precise from those that can be approximated so that a program functions correctly even as quality of service degrades. We propose using type qualifiers to declare data that may be subject to approximate computation. Using these types, the system automatically maps approximate variables to low-power storage, uses low-power operations, and even applies more energy-efficient algorithms provided by the programmer. In addition, the system can statically guarantee isolation of the precise program component from the approximate component. This allows a programmer to control explicitly how information flows from approximate data to precise data. Importantly, employing static analysis eliminates the need for dynamic checks, further improving energy savings. As a proof of concept, we develop EnerJ, an extension to Java that adds approximate data types. We also propose a hardware architecture that offers explicit approximate storage and computation. We port several applications to EnerJ and show that our extensions are expressive and effective; a small number of annotations lead to significant potential energy savings (10%-50%) at very little accuracy cost.
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
Wattch: a framework for architectural-level power analysis and optimizations
Brooks, D., Tiwari, V., & Martonosi, M. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339657 · Cited by 2,578
Li, S., Ahn, J. H., Strong, R. D., Brockman, J. B., Tullsen, D. M., & Jouppi, N. P. (2009) · Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/1669112.1669172 · Cited by 2,376
Language-based information-flow security
Sabelfeld, A., & Myers, A. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.806121 · Cited by 1,907
Power provisioning for a warehouse-sized computer
Fan, X., Weber, W.-D., & Barroso, L. A. (2007) · Proceedings of the 34th annual international symposium on Computer architecture · doi:10.1145/1250662.1250665 · Cited by 1,797
An Analysis of Power Consumption in a Smartphone
Carroll, A., & Heiser, G. A. (2010) · Cited by 1,363
Razor: a low-power pipeline based on circuit-level timing speculation
Ernst, D., Kim, N. S., Das, S., Pant, S., Rao, R. R., Pham, T. T., Ziesler, C. H., Blaauw, D. T., Austin, T. M., Flautner, K., et al. (2003) · doi:10.5555/956417.956571 · Cited by 1,072
JFlow: practical mostly-static information flow control
Myers, A. C. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292561 · Cited by 1,034
Igarashi, A., Pierce, B. C., & Wadler, P. L. (2001) · ACM Transactions on Programming Languages and Systems · doi:10.1145/503502.503505 · Cited by 986
Green: a framework for supporting energy-conscious programming using controlled approximation
Baek, W., & Chilimbi, T. M. (2010) · Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1806596.1806620 · Cited by 440
Flikker: saving DRAM refresh-power through critical data partitioning
Liu, S., Pattabiraman, K., Moscibroda, T., & Zorn, B. G. (2011) · Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems · doi:10.1145/1950365.1950391 · Cited by 412
A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
Thies, W., Chandrasekhar, V., & Amarasinghe, S. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.38 · Cited by 274
Foster, J. S., Fähndrich, M., & Aiken, A. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301665 · Cited by 261
Misailovic, S., Sidiroglou, S., Hoffmann, H., & Rinard, M. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806808 · Cited by 224
Relax: an architectural framework for software recovery of hardware faults
de Kruijf, M., Nomura, S., & Sankaralingam, K. (2010) · Proceedings of the 37th annual international symposium on Computer architecture · doi:10.1145/1815961.1816026 · Cited by 201
Practical pluggable types for java
Papi, M. M., Ali, M., Correa, T. L., Perkins, J. H., & Ernst, M. D. (2008) · International Symposium on Software Testing and Analysis · doi:10.1145/1390630.1390656 · Cited by 199
Power Consumption Breakdown on a Modern Laptop
Mahesri, A., & Vardhan, V. (2005) · Lecture Notes in Computer Science · doi:10.1007/11574859_12 · Cited by 167
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
Patterns and statistical analysis for understanding reduced resource computing
Rinard, M., Hoffmann, H., Misailovíc, S., & Sidiroglou, S. (2010) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1869459.1869525 · Cited by 45
A Semantic Framework for Declassification and Endorsement
Askarov, A., & Myers, A. C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-11957-6_5 · Cited by 41
Fault-tolerant typed assembly language
Perry, F., Mackey, L. W., Reis, G. A., Ligatti, J., August, D. I., & Walker, D. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250741 · Cited by 38
Exploiting Soft Computing for Increased Fault Tolerance
Li, X., & Yeung, D. (2006) · Cited by 34
Reasoning about Control Flow in the Presence of Transient Faults
Perry, F., & Walker, D. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-69166-2_22 · Cited by 10
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
Self-citationMinerva: enabling low-power, highly-accurate deep neural network accelerators
Reagen, B., Whatmough, P., Adolf, R., Rama, S., Lee, H., Lee, S. K., Hernández-Lobato, J. M., Wei, G.-Y., & Brooks, D. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001165 · Cited by 446
Dual-Quality 4:2 Compressors for Utilizing in Dynamic Accuracy Configurable Multipliers
Akbari, O., Kamal, M., Afzali-Kusha, A., & Pedram, M. (2017) · IEEE Transactions on Very Large Scale Integration (VLSI) Systems · doi:10.1109/tvlsi.2016.2643003 · Cited by 312
Quantifying the Accuracy of High-Level Fault Injection Techniques for Hardware Faults
Wei, J., Thomas, A., Li, G., & Pattabiraman, K. (2014) · 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks · doi:10.1109/dsn.2014.2 · Cited by 182
Metadata
- Authors
- Sampson, A., Dietl, W., Fortuna, E., Gnanapragasam, D., Ceze, L., & Grossman, D.
- Venue
- ACM SIGPLAN Notices
- Published
- 2011-06-04
- Volume
- 46
- Issue
- 6
- Pages
- 164-174
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W2143283746
- Cited by
- 589
- References
- 22
- FWCI
- 31.93
- 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.