skip to main content
10.1145/2744769.2751163acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article

Approximate computing and the quest for computing efficiency

Published: 07 June 2015 Publication History

Abstract

Diminishing benefits from technology scaling have pushed designers to look for new sources of computing efficiency. Multicores and heterogeneous accelerator-based architectures are a by-product of this quest to obtain improvements in the performance of computing platforms at similar or lower power budgets. In light of the need for new innovations to sustain these improvements, we discuss approximate computing, a field that has attracted considerable interest over the last decade. While the core principles of approximate computing---computing efficiently by producing results that are good enough or of sufficient quality---are not new and are shared by many fields from algorithm design to networks and distributed systems, recent e.orts have seen a percolation of these principles to all layers of the computing stack, including circuits, architecture, and software. Approximate computing techniques have also evolved from ad hoc and applicationspecific to more broadly applicable, supported by systematic design methodologies. Finally, the emergence of workloads such as recognition, mining, search, data analytics, inference and vision are greatly increasing the opportunities for approximate computing. We describe the vision and key principles that have guided our work in this area, and outline a holistic cross-layer framework for approximate computing.

References

[1]
Jörg Henkel, Heba Khdr, Santiago Pagani, and Muhammad Shafique. New trends in dark silicon. In Proc. DAC, 2015.
[2]
Yuan Xie, Hsiangyun Cheng, Jia Zhan, Jishen Zhao, Jack Sampson, and Mary Jane Irwin. Core vs. uncore: Which part of silicon is darker? In Proc. DAC, 2015.
[3]
R. H. Dennard et. al. Design of ion-implanted MOSFETs with very small physical dimensions. IEEE Journal of Solid-State Circuits, 9(5):256--268, Oct 1974.
[4]
M. Bohr. A 30 year retrospective on Dennard's MOSFET scaling paper. IEEE Solid-State Circuits Society Newsletter, 12(1):11--13, Winter 2007.
[5]
H. Esmaeilzadeh et. al. Dark silicon and the end of multicore scaling. In Proc. ISCA, pages 365--376, 2011.
[6]
M. Hill and C. Kozyrakis. Advancing computer systems without technology progress. In Outbrief of DARPA/ISAT Workshop (http://www.cs.wisc.edu/.markhill/papers/isat2012 ACSWTP.pdf), March 2012.
[7]
Y. K. Chen et. al. Convergence of recognition, mining, and synthesis workloads and its implications. Proc. IEEE, 96(5):790--807, May 2008.
[8]
V. K. Chippa et. al. Analysis and characterization of inherent application resilience for approximate computing. In Proc. DAC, 2013.
[9]
S. Chakradhar et. al. Best-effort computing: Re-thinking parallel software and hardware. In Proc. DAC, 2010.
[10]
V. V. Vazirani. Approximation Algorithms. Springer-Verlag New York, Inc., 2001.
[11]
M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
[12]
L. L. Peterson and B. S. Davie. Computer Networks, Fifth Edition: A Systems Approach. Morgan Kaufmann Publishers Inc., 2011.
[13]
W. Vogels. Eventually consistent. Commun. ACM, 52(1):40--44, January 2009.
[14]
B. Liu. Effect of finite word length on the accuracy of digital filters---a review. IEEE Transactions on Circuit Theory, 18(6):670--677, Nov 1971.
[15]
V. Madisetti. Digital Signal Processing Handbook 2nd Edition. CRC Press, 2008.
[16]
J. W-S. Liu et. al. Imprecise computations. Proceedings of the IEEE, 82(1):83--94, Jan 1994.
[17]
S. H. Nawab et. al. Approximate signal processing. Journal of VLSI signal processing systems for signal, image and video technology, 15(1-2):177--200, 1997.
[18]
R. Hegde et. al. Energy-efficient signal processing via algorithmic noise-tolerance. In Proc. ISLPED, pages 30--35, 1999.
[19]
K. Palem et. al. Ten years of building broken chips: The physics and engineering of inexact computing. ACM Trans. on Embedded Computing Systems, 12(2s):1--23, 2013.
[20]
H. Esmaeilzadeh et. al. Architecture support for disciplined approximate programming. In Proc. ASPLOS, pages 301--312, 2012.
[21]
S. Sidiroglou-Douskos et. al. Managing performance vs. accuracy trade-offs with loop perforation. In Proc. ACM SIGSOFT symposium, pages 124--134, 2011.
[22]
S. Narayanan et. al. Scalable stochastic processors. In Proc. DATE, pages 335--338, 2010.
[23]
J. Han et. al. Approximate computing: An emerging paradigm for energy-efficient design. In Proc. ETS, pages 1--6, 2013.
[24]
V. K. Chippa et. al. Scalable effort hardware design. IEEE Trans. on VLSI Systems, pages 2004--2016, Sept 2014.
[25]
N. Banerjee et. al. Process variation tolerant low power DCT architecture. In Proc. DATE, pages 1--6, April 2007.
[26]
N. Banerjee et. al. A process variation aware low power synthesis methodology for fixed-point FIR filters. In Proc. ISLPED, pages 147--152, 2007.
[27]
G. Karakonstantis et. al. Design methodology to trade o. power, output quality and error resiliency: Application to color interpolation filtering. In Proc. ICCAD, pages 199--204, 2007.
[28]
D. Mohapatra et. al. Design of voltage-scalable meta-functions for approximate computing. In Proc. DATE, 2011.
[29]
S. Ramasubramanian et. al. Relax-and-retime: A methodology for energy-efficient recovery based design. In Proc. DAC, 2013.
[30]
Jong-Sun Park. Low Complexity Digital Signal Processing System Design Techniques. PhD thesis, West Lafayette, IN, USA, 2005. AAI3198154.
[31]
G. Karakonstantis and K. Roy. An optimal algorithm for low power multiplierless fir filter design using Chebychev criterion. In Proc. ICASSP, volume 2, pages II.49--II.52, April 2007.
[32]
V. Gupta et. al. IMPACT: imprecise adders for low-power approximate computing. In Proc. ISLPED, pages 409--414, 2011.
[33]
S. Venkataramani et. al. SALSA: systematic logic synthesis of approximate circuits. In Proc. DAC, 2012.
[34]
S. Venkataramani et. al. Substitute-and-simplify: A unified design paradigm for approximate and quality configurable circuits. In Proc. DATE, pages 1367--1372, 2013.
[35]
A. Ranjan et. al. ASLAN: synthesis of approximate sequential circuits. In Proc. DATE, 2014.
[36]
D. Mohapatra et. al. Significance driven computation: A voltage-scalable, variation-aware, quality-tuning motion estimator. In Proc. ISLPED, pages 195--200, 2009.
[37]
V. K. Chippa et. al. Approximate computing: An integrated hardware approach. In Proc. Asilomar Conf. on Signals, Systems and Computers, pages 111--117, 2013.
[38]
V. K. Chippa et. al. Scalable effort hardware design: Exploiting algorithmic resilience for energy efficiency. In Proc. DAC, pages 555--560, 2010.
[39]
V. K. Chippa et. al. Dynamic effort scaling: Managing the quality-efficiency tradeo. In Proc. DAC, pages 603--608, 2011.
[40]
V. K. Chippa, S. Venkataramani, K. Roy, and A. Raghunathan. StoRM: A stochastic recognition and mining processor. In Proc. ISLPED, pages 39--44, 2014.
[41]
V. K. Chippa et. al. Energy-efficient recognition and mining processor using scalable effort design. In Custom Integrated Circuits Conference (CICC), 2013 IEEE, pages 1--4, Sept 2013.
[42]
S. Venkataramani et. al. Quality programmable vector processors for approximate computing. In Proc. MICRO, 2013.
[43]
Ik Joon Chang, D. Mohapatra, and K. Roy. A priority-based 6t/8t hybrid sram architecture for aggressive voltage scaling in video applications. Circuits and Systems for Video Technology, IEEE Transactions on, 21(2):101--112, Feb 2011.
[44]
Georgios Karakonstantis, Debabrata Mohapatra, and Kaushik Roy. Logic and memory design based on unequal error protection for voltage-scalable, robust and adaptive dsp systems. Journal of Signal Processing Systems, 68(3):415--431, 2012.
[45]
A. Ranjan et. al. Approximate storage for energy efficient spintronic memories. In Proc. DAC, 2015.
[46]
J. Meng et. al. Best-effort parallel execution framework for recognition and mining applications. In Proc. IPDPS, 2009.
[47]
J. Meng et. al. Exploiting the forgiving nature of applications for scalable parallel execution. In Proc. IPDPS, April 2010.
[48]
Surendra Byna, Jiayuan Meng, Anand Raghunathan, Srimat Chakradhar, and Srihari Cadambi. Best-effort semantic document search on gpus. In Proc. GPGPU Workshop, pages 86--93, 2010.
[49]
R. Farivar et. al. PIC: Partitioned iterative convergence for clusters. In Proc. CLUSTER, pages 391--401, Sept 2012.
[50]
S. Venkataramani et. al. AxNN: energy-efficient neuromorphic systems using approximate computing. In Proc. ISLPED, pages 27--32, 2014.
[51]
A. Raha et. al. Quality configurable reduce-and-rank kernals for energy-efficient approximate computing. In Proc. DATE, March 2015.
[52]
S. Venkataramani et. al. Scalable-effort classifiers for energy-efficient machine learning. In Proc. DAC, June 2015.
[53]
J. Schmidhuber. Deep learning in neural networks: An overview. CoRR, abs/1404.7828, 2014.
[54]
R. Venkatesan et. al. MACACO: modeling and analysis of circuits for approximate computing. In Proc. ICCAD, pages 667--673, 2011.

Cited By

View all
  • (2025)Approximate Computing Survey, Part II: Application-Specific & Architectural Approximation Techniques and ApplicationsACM Computing Surveys10.1145/371168357:7(1-36)Online publication date: 20-Feb-2025
  • (2025)AI-Enabled Efficient Memory Design for Data-Intensive ApplicationsAI-Enabled Electronic Circuit and System Design10.1007/978-3-031-71436-8_3(83-108)Online publication date: 28-Jan-2025
  • (2024)A Survey on Design Space Exploration Approaches for Approximate Computing SystemsElectronics10.3390/electronics1322444213:22(4442)Online publication date: 13-Nov-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DAC '15: Proceedings of the 52nd Annual Design Automation Conference
June 2015
1204 pages
ISBN:9781450335201
DOI:10.1145/2744769
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2015

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Funding Sources

  • National Science Foundation

Conference

DAC '15
Sponsor:
DAC '15: The 52nd Annual Design Automation Conference 2015
June 7 - 11, 2015
California, San Francisco

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25
62nd ACM/IEEE Design Automation Conference
June 22 - 26, 2025
San Francisco , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)85
  • Downloads (Last 6 weeks)8
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Approximate Computing Survey, Part II: Application-Specific & Architectural Approximation Techniques and ApplicationsACM Computing Surveys10.1145/371168357:7(1-36)Online publication date: 20-Feb-2025
  • (2025)AI-Enabled Efficient Memory Design for Data-Intensive ApplicationsAI-Enabled Electronic Circuit and System Design10.1007/978-3-031-71436-8_3(83-108)Online publication date: 28-Jan-2025
  • (2024)A Survey on Design Space Exploration Approaches for Approximate Computing SystemsElectronics10.3390/electronics1322444213:22(4442)Online publication date: 13-Nov-2024
  • (2024)AxOMaP: Designing FPGA-based Approximate Arithmetic Operators using Mathematical ProgrammingACM Transactions on Reconfigurable Technology and Systems10.1145/364869417:2(1-28)Online publication date: 19-Feb-2024
  • (2024)Efficient Error-Tolerant Computation: Static Segmented Multipliers with Inner Approximation2024 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI)10.1109/ACCAI61061.2024.10602240(1-7)Online publication date: 9-May-2024
  • (2024)Syntactic and Semantic Analysis of Temporal Assertions to Support the Approximation of RTL DesignsJournal of Electronic Testing10.1007/s10836-024-06115-940:2(199-214)Online publication date: 23-Apr-2024
  • (2024)A Power-Efficient Gaussian Filter Architecture Using Adder Compressors for Edge Detection ApplicationCircuits, Systems, and Signal Processing10.1007/s00034-024-02894-wOnline publication date: 28-Oct-2024
  • (2023)DAEM: A Data- and Application-Aware Error Analysis Methodology for Approximate AddersInformation10.3390/info1410057014:10(570)Online publication date: 17-Oct-2023
  • (2023)FAC: A Fault-Tolerant Design Approach Based on Approximate ComputingElectronics10.3390/electronics1218381912:18(3819)Online publication date: 9-Sep-2023
  • (2023)A Comprehensive Model for Efficient Design Space Exploration of Imprecise Computational BlocksACM Transactions on Embedded Computing Systems10.1145/362555522:6(1-20)Online publication date: 9-Nov-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media