skip to main content
10.1145/2742060.2743759acmconferencesArticle/Chapter ViewAbstractPublication PagesglsvlsiConference Proceedingsconference-collections
research-article

ApproxMA: Approximate Memory Access for Dynamic Precision Scaling

Authors Info & Claims
Published:20 May 2015Publication History

ABSTRACT

Motivated by the inherent error-resilience of emerging recognition, mining, and synthesis (RMS) applications, approximate computing techniques such as precision scaling has been advocated for achieving energy-efficiency gains at the cost of small accuracy loss. Most existing solutions, however, focus on the approximation of on-chip computations without considering that of off-chip data accesses, whose energy consumption may contribute to a significant portion of the total energy. In this work, we propose a novel approximate memory access technique for dynamic precision scaling, namely ApproxMA. To be specific, by taking both runtime data precision constraints and error-resilient capabilities of the application into consideration, ApproxMA determines the precision of data accesses and loads scaled data from off-chip memory for computation. Experimental results with mixture model-based clustering algorithms demonstrate the efficacy of the proposed methodology.

References

  1. V. Gupta, D. Mohapatra, S. P. Park, A. Raghunathan, and K. Roy, "Impact: imprecise adders for low-power approximate computing," in Proceedings of the 17th IEEE/ACM international symposium on Low-power electronics and design, pp. 409--414, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. J. Han and M. Orshansky, "Approximate computing: An emerging paradigm for energy-efficient design," in Proceedings of the 18th IEEE European Test Symposium (ETS), pp. 1--6, 2013.Google ScholarGoogle Scholar
  3. V. K. Chippa, S. T. Chakradhar, K. Roy, and A. Raghunathan, "Analysis and characterization of inherent application resilience for approximate computing," in Proceedings of the 50th Annual Design Automation Conference, p. 113, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Q. Zhang, F. Yuan, R. Ye, and Q. Xu, "Approxit: An approximate computing framework for iterative methods," in Proceedings of the 51st Annual Design Automation Conference, pp. 97:1--97:6, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Q. Zhang, T. Wang, Y. Tian, F. Yuan and Q. Xu, "ApproxANN: An Approximate Computing Framework for Artificial Neural Network," Proceedings IEEE/ACM Design, Automation, and Test in Europe (DATE), to appear, 2015. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Venkataramani, V. K. Chippa, S. T. Chakradhar, K. Roy, and A. Raghunathan, "Quality programmable vector processors for approximate computing," in Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture, pp. 1--12, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. O. Sarbishei and K. Radecka, "Analysis of precision for scaling the intermediate variables in fixed-point arithmetic circuits," in Proceedings of the International Conference on Computer-Aided Design, pp. 739--745, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Yoshizawa and Y. Miyanaga, "Tunable wordlength architecture for a low power wireless OFDM demodulator," IEICE Transactions on fundamentals of electronics, communications and computer sciences, vol. 89, no. 10, pp. 2866--2873, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Lee and A. Gerstlauer, "Fine grain word length optimization for dynamic precision scaling in dsp systems," in 2013 IFIP/IEEE 21st International Conference on Very Large Scale Integration (VLSI-SoC), pp. 266--271, 2013.Google ScholarGoogle Scholar
  10. R. Ye, T. Wang, F. Yuan, R. Kumar, and Q. Xu, "On reconfiguration-oriented approximate adder design and its application," in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pp. 48--54, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. V. Melnykov, R. Maitra, "Finite mixture models and model-based clustering," Statistics Surveys, vol. 4, pp. 80--116, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  12. C. M. Bishop et al., Pattern recognition and machine learning, vol. 1. springer New York, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H.-N. Nguyen, D. Menard, and O. Sentieys, "Dynamic precision scaling for low power WCDMA receiver," in IEEE International Symposium on Circuits and Systems, pp. 205--208, 2009.Google ScholarGoogle Scholar
  14. Y. Lee, Y. Choi, S.-B. Ko, and M. H. Lee, "Performance analysis of bit-width reduced floating-point arithmetic units in FPGAs: a case study of neural network-based face detector," EURASIP Journal on Embedded Systems, vol. 2009, p. 4, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. N. Luehr, I. S. Ufimtsev, and T. J. Martínez, "Dynamic precision for electron repulsion integral evaluation on graphical processing units (GPUs)," Journal of Chemical Theory and Computation, vol. 7, no. 4, pp. 949--954, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  16. H. Sangki, "3D super-via for memory applications," in Micro-Systems Packaging Initiative Packaging Workshop (WSPI), 2007.Google ScholarGoogle Scholar
  17. V. Sathish, M. J. Schulte, and N. S. Kim, "Lossless and lossy memory I/O link compression for improving performance of GPGPU workloads," in Proceedings of ACM International Conference on Parallel Architectures and Compilation Techniques, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. "CACTI," http://www.hpl.hp.com/research/cacti/.Google ScholarGoogle Scholar
  19. http://www.csie.ntu.edu.tw/~cjlin/libsvm/Google ScholarGoogle Scholar
  20. http://scikit-learn.org/stable/modules/classes.html#module-sklearn.datasetsGoogle ScholarGoogle Scholar
  21. T. K. Ho and E. M. Kleinberg, "Building projectable classifiers of arbitrary complexity," in Proceedings of the 13th IEEE International Conference on Pattern Recognition, vol. 2, pp. 880--885, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. ApproxMA: Approximate Memory Access for Dynamic Precision Scaling

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GLSVLSI '15: Proceedings of the 25th edition on Great Lakes Symposium on VLSI
      May 2015
      418 pages
      ISBN:9781450334747
      DOI:10.1145/2742060

      Copyright © 2015 ACM

      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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 May 2015

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      GLSVLSI '15 Paper Acceptance Rate41of148submissions,28%Overall Acceptance Rate312of1,156submissions,27%

      Upcoming Conference

      GLSVLSI '24
      Great Lakes Symposium on VLSI 2024
      June 12 - 14, 2024
      Clearwater , FL , USA

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader