Quality programmable vector processors for approximate computing

MICRO 2013 - Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture

Volumn , Issue , 2013, Pages 1-12

  Venkataramani, Swagath ^a   Chippa, Vinay K ^a   Chakradhar, Srimat T ^b   Roy, Kaushik ^a   Raghunathan, Anand ^a  

^a Purdue University   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

approximate computing; energy efficient architecture; intrinsic application resilience; quality programmable processors

Indexed keywords

APPROXIMATE COMPUTING; ENERGY-EFFICIENT ARCHITECTURES; HARDWARE MECHANISM; INTRINSIC APPLICATION RESILIENCE; MICRO ARCHITECTURES; PROCESSING ELEMENTS; PROGRAMMABLE PROCESSORS; QUALITY SPECIFICATIONS;

ECONOMIC AND SOCIAL EFFECTS; ENERGY EFFICIENCY; HARDWARE; SIGNAL ENCODING;

COMPUTER ARCHITECTURE;

EID: 84892524324     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2540708.2540710     Document Type: Conference Paper

References (27)

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.