Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2540708.2540710acmconferencesArticle/Chapter ViewAbstractPublication PagesmicroConference Proceedingsconference-collections
research-article

Quality programmable vector processors for approximate computing

Published: 07 December 2013 Publication History

Abstract

Approximate computing leverages the intrinsic resilience of applications to inexactness in their computations, to achieve a desirable trade-off between efficiency (performance or energy) and acceptable quality of results. To broaden the applicability of approximate computing, we propose quality programmable processors, in which the notion of quality is explicitly codified in the HW/SW interface, i.e., the instruction set. The ISA of a quality programmable processor contains instructions associated with quality fields to specify the accuracy level that must be met during their execution. We show that this ability to control the accuracy of instruction execution greatly enhances the scope of approximate computing, allowing it to be applied to larger parts of programs. The micro-architecture of a quality programmable processor contains hardware mechanisms that translate the instruction-level quality specifications into energy savings. Additionally, it may expose the actual error incurred during the execution of each instruction (which may be less than the specified limit) back to software.
As a first embodiment of quality programmable processors, we present the design of Quora, an energy efficient, quality programmable vector processor. Quora utilizes a 3-tiered hierarchy of processing elements that provide distinctly different energy vs. quality trade-offs, and uses hardware mechanisms based on precision scaling with error monitoring and compensation to facilitate quality programmable execution. We evaluate an implementation of Quora with 289 processing elements in 45nm technology. The results demonstrate that leveraging quality-programmability leads to 1.05X-1.7X savings in energy for virtually no loss (< 0.5%) in application output quality, and 1.18X-2.1X energy savings for modest impact (<2.5%) on output quality. Our work suggests that quality programmable processors are a significant step towards bringing approximate computing to the mainstream.

References

[1]
M. A. Breuer. Multi-media applications and imprecise computation. In Proc. Euromicro Conf. on Digital System Design, pages 2--7, 2005.
[2]
Y. K. Chen et. al. Convergence of recognition, mining, and synthesis workloads and its implications. Proc. IEEE, 96(5): 790--807, May 2008.
[3]
S. Chakradhar and A. Raghunathan. Best-effort computing: Re-thinking parallel software and hardware. In Proc. DAC '10, pages 865--870, 2010.
[4]
R. Hegde et. al. Energy-efficient signal processing via algorithmic noise-tolerance. In Proc. ISLPED '99, pages 30--35.
[5]
D. Mohapatra et. al. Significance driven computation: A voltage-scalable, variation-aware, quality-tuning motion estimator. In Proc. ISLPED '09, pages 195--200, 2009.
[6]
K. Palem et. al. Sustaining moore's law in embedded computing through probabilistic and approximate design: Retrospects and prospects. In Proc. CASES, pages 1--10, 2009.
[7]
V. K. Chippa et. al. Scalable effort hardware design: Exploiting algorithmic resilience for energy efficiency. In Proc. DAC '10, pages 555--560, June 2010.
[8]
V. K. Chippa et. al. Dynamic effort scaling: Managing the quality-efficiency tradeoff. In Proc. DAC '11, pages 603--608.
[9]
W. Baek and T. M. Chilimbi. Green: A framework for supporting energy-conscious programming using controlled approximation. In Proc. PLDI, pages 198--209, 2010.
[10]
S. Sidiroglou-Douskos et. al. Managing performance vs. accuracy trade-offs with loop perforation. In Proc. ACM SIGSOFT symposium '11, pages 124--134.
[11]
J. Meng et. al. Best-effort parallel execution framework for recognition and mining applications. In Proc. IPDPS '09, pages 1--12.
[12]
H. Esmaeilzadeh et. al. Neural acceleration for general-purpose approximate programs. In MICRO '12, pages 449--460.
[13]
S. Narayanan et. al. Scalable stochastic processors. In Proc. DATE '10, pages 335--338, 2010.
[14]
H. Esmaeilzadeh et. al. Architecture support for disciplined approximate programming. In Proc. ASPLOS '12, pages 301--312.
[15]
A. Sampson et. al. EnerJ: Approximate data types for safe and general low-power computation. SIGPLAN Not., 46(6):164--174, June 2011.
[16]
L. Leem et. al. ERSA: Error resilient system architecture for probabilistic applications. In Proc. DATE '10, pages 1560--1565.
[17]
S. Venkataramani et. al. SALSA: systematic logic synthesis of approximate circuits. In Proc. DAC '12, pages 796--801.
[18]
S. Venkataramani et. al. Substitute-and-simplify: A unified design paradigm for approximate and quality configurable circuits. In Proc. DATE '13, pages 1367--1372.
[19]
Doochul Shin and S. K. Gupta. Approximate logic synthesis for error tolerant applications. In Proc. DATE '10, pages 957--960.
[20]
A. Kahng et. al. Accuracy-configurable adder for approximate arithmetic designs. In Proc. DAC '12, pages 820--825.
[21]
P. Kulkarni et. al. Trading accuracy for power with an underdesigned multiplier architecture. In Proc. VLSID '11, pages 346--351.
[22]
V. K. Chippa et. al. Analysis and characterization of inherent application resilience for approximate computing. In Proc. DAC '13, pages 1--9, 2013.
[23]
M. Carbin et. al. Verified integrity properties for safe approximate program transformations. In Proc. PEPM '13, PEPM '13, pages 63--66, 2013.
[24]
M. Carbin et. al. Proving acceptability properties of relaxed nondeterministic approximate programs. In Proc. PLDI '12, PLDI '12, pages 169--180, 2012.
[25]
J. Cong et. al. Assuring application-level correctness against soft errors. In ICCAD '11, pages 150--157.
[26]
Design Compiler Ultra, Synopsys Inc.
[27]
ModelSim, Mentor Graphics Inc.

Cited By

View all
  • (2024)Efficient Tensor Offloading for Large Deep-Learning Model Training based on Compute Express LinkProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC41406.2024.00100(1-18)Online publication date: 17-Nov-2024
  • (2024)High-End Approximate Multiplier Using Brent Kung Razor FlipFlop2024 5th International Conference for Emerging Technology (INCET)10.1109/INCET61516.2024.10592958(1-6)Online publication date: 24-May-2024
  • (2024)High-Speed and Low-Power Recursive Rounding Based Approximate Multipliers for Error-Resilience ApplicationsWireless Personal Communications10.1007/s11277-024-11283-0136:2(773-791)Online publication date: 25-Jun-2024
  • Show More Cited By

Index Terms

  1. Quality programmable vector processors for approximate computing

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MICRO-46: Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture
    December 2013
    498 pages
    ISBN:9781450326384
    DOI:10.1145/2540708
    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 December 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. approximate computing
    2. energy-efficient architecture
    3. intrinsic application resilience
    4. quality programmable processors

    Qualifiers

    • Research-article

    Conference

    MICRO-46
    Sponsor:

    Acceptance Rates

    MICRO-46 Paper Acceptance Rate 39 of 239 submissions, 16%;
    Overall Acceptance Rate 484 of 2,242 submissions, 22%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)30
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 25 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Efficient Tensor Offloading for Large Deep-Learning Model Training based on Compute Express LinkProceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis10.1109/SC41406.2024.00100(1-18)Online publication date: 17-Nov-2024
    • (2024)High-End Approximate Multiplier Using Brent Kung Razor FlipFlop2024 5th International Conference for Emerging Technology (INCET)10.1109/INCET61516.2024.10592958(1-6)Online publication date: 24-May-2024
    • (2024)High-Speed and Low-Power Recursive Rounding Based Approximate Multipliers for Error-Resilience ApplicationsWireless Personal Communications10.1007/s11277-024-11283-0136:2(773-791)Online publication date: 25-Jun-2024
    • (2023)A Survey on Approximate Multiplier Designs for Energy Efficiency: From Algorithms to CircuitsACM Transactions on Design Automation of Electronic Systems10.1145/361029129:1(1-37)Online publication date: 24-Jul-2023
    • (2023)Approximation Opportunities in Edge Computing Hardware: A Systematic Literature ReviewACM Computing Surveys10.1145/357277255:12(1-49)Online publication date: 3-Mar-2023
    • (2023)Approximate Computing: Hardware and Software Techniques, Tools and Their ApplicationsJournal of Circuits, Systems and Computers10.1142/S021812662430001033:04Online publication date: 20-Sep-2023
    • (2023)Xel-FPGAs: An End-to-End Automated Exploration Framework for Approximate Accelerators in FPGA-Based Systems2023 IEEE/ACM International Conference on Computer Aided Design (ICCAD)10.1109/ICCAD57390.2023.10323678(1-9)Online publication date: 28-Oct-2023
    • (2023)LMM: A Fixed-Point Linear Mapping Based Approximate Multiplier for IoTJournal of Computer Science and Technology10.1007/s11390-023-2572-838:2(298-308)Online publication date: 30-Mar-2023
    • (2023)Estimated Computing for Effective Configurable AdderProceedings of Fourth International Conference on Communication, Computing and Electronics Systems10.1007/978-981-19-7753-4_9(103-110)Online publication date: 15-Mar-2023
    • (2023)Design and evaluation of ultra‐fast 8‐bit approximate multipliers using novel multicolumn inexact compressorsInternational Journal of Circuit Theory and Applications10.1002/cta.3613Online publication date: 3-Apr-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