EMEURO: A framework for generating multi-purpose accelerators via deep learning

Proceedings of the 2015 IEEE/ACM International Symposium on Code Generation and Optimization, CGO 2015

Volumn , Issue , 2015, Pages 125-135

  McAfee, Lawrence ^a   Olukotun, Kunle ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FAULT TOLERANCE;

APPROXIMATE COMPUTING; APPROXIMATION ERRORS; FINE-GRAIN CONTROLS; NEURAL NETWORK (NN); OPTIMIZED APPLICATION; ORIGINAL ALGORITHMS; PROGRAMMING MODELS; RESTRUCTURING ALGORITHMS;

DEEP LEARNING;

EID: 84926041511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2015.7054193     Document Type: Conference Paper

References (31)

1. Nehe game development tutorials. URL http://nehe. gamedev.net.
2. Santa barbara corpus of spoken american english. URL http://www.linguistics.ucsb.edu/research/santa-barbara-corpus.
3. A. Agarwal, M. Rinard, S. Sidiroglou, S. Misailovic, and H. Hoffmann. Using code perforation to improve performance, reduce energy consumption, and respond to failures. Technical report, Mass. Inst. Technology, 2009.
4. J. Ansel, C. Chan, Y. L. Wong, M. Olszewski, Q. Zhao, A. Edelman, and S. Amarasinghe. Petabricks: a language and compiler for algorithmic choice. In PLDI, 2009.
5. J. Ansel, Y. L. Wong, C. Chan, M. Olszewski, A. Edelman, and S. Amarasinghe. Language and compiler support for autotuning variable-accuracy algorithms. In CGO, 2011.
6. W. Baek and T. Chilimbi. Green: a framework for supporting energy-conscious programming using controlled approximation. In PLDI, 2010.
7. S. Borkar and A. Chien. The future of microprocessors. In Communications of the ACM, 2011.
8. L. N. Chakrapani, B. E. Akgul, S. Cheemalavagu, P. Korkmaz, K. V. Palem, and B. Seshasayee. Ultra-efficient (embedded) soc architectures based on probabilistic cmos (pcmos) technology. In DATE, 2006.
9. T. Chen, Y. Chen, M. Duranton, Q. Guo, A. Hashmi, M. Lipasti, A. Nere, S. Qiu, M. Sebag, and O. Temam. Benchnn: On the broad potential application scope of hardware neural network accelerators. In IISWC, 2012.
10. J. W. Cooley and J. W. Tukey. An algorithm for the machine calculation of complex fourier series. Mathematics of computation, 19(90):297-301, 1965.
11. H. Esmaeilzadeh, E. Blem, R. St. Amant, K. Sankaralingam, and D. Burger. Dark silicon and the end of multicore scaling. In ISCA, 2011.
12. H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger. Architecture support for disciplined approximate programming. In ASPLOS, 2012.
13. H. Esmaeilzadeh, A. Sampson, L. Ceze, and D. Burger. Neural acceleration for general-purpose approximate programs. In MICRO, 2012.
14. A. Guzhva, S. Dolenko, and I. Persiantsev. Multifold acceleration of neural network computations using gpu. In ICANN, 2009.
15. R. Hameed,W. Qadeer, M.Wachs, O. Azizi, A. Solomatnikov, B. Lee, S. Richardson, C. Kozyrakis, and M. Horowitz. Understanding sources of inefficiency in general-purpose chips. In ISCA, 2010.
16. J. Han and M. Orshansky. Approximate computing: An emerging paradigm for energy-efficient design. In Test Symposium (ETS), 2013 18th IEEE European, pages 1-6. IEEE, 2013.
17. H. Hoffmann, S. Sidiroglou, M. Carbin, S. Misailovic, A. Agarwal, and M. Rinard. Dynamic knobs for responsive power-aware computing. In ASPLOS, 2011.
18. S. Kim, L. McAfee, P. McMahon, and K. Olukotun. A highly scalable restricted boltzmann machine fpga implementation. In FPL, 2009.
19. T. Moreau, J. Nelson, A. Sampson, H. Esmaeilzadeh, and L. Ceze. Approximate computing on programmable socs via neural acceleration. Technical report, 2014.
20. M. Rinard. Probabilistic accuracy bounds for fault-tolerant computations that discard tasks. In ICS, 2006.
21. M. Rinard. Using early phase termination to eliminate load imbalances at barrier synchronization points. In OOPSLA, 2007.
22. D. E. Rumelhart, G. E. Hintont, and R. J. Williams. Learning representations by back-propagating errors. Nature, 323 (6088):533-536, 1986.
23. M. Samadi, J. Lee, D. A. Jamshidi, A. Hormati, and S. Mahlke. Sage: Self-tuning approximation for graphics engines. In MICRO, 2013.
24. M. Samadi, D. A. Jamshidi, J. Lee, and S. Mahlke. Paraprox: pattern-based approximation for data parallel applications. In ASPLOS, 2014.
25. A. Sampson, W. Dietl, E. Fortuna, D. Gnanapragasam, L. Ceze, and D. Grossman. Enerj: Approximate data types for safe and general low-power computation. In PLDI, 2011.
26. A. Sampson, J. Nelson, K. Strauss, and L. Ceze. Approximate storage in solid-state memories. In MICRO, 2013.
27. J. Schemmel, J. Fieres, and K. Meier. Wafer-scale integration of analog neural networks. In IEEE International Joint Conference on Neural Networks, pages 431-438. IEEE, 2008.
28. S. Sidiroglou-Douskos, S. Misailovic, H. Hoffmann, and M. Rinard. Managing performance vs. accuracy trade-offs with loop perforation. In ESEC/FSE, 2011.
29. E. Tchernev, R. Mulvaney, and D. Phatak. Investigating the fault tolerance of neural networks. In Neural Computation, 2005.
30. O. Temam. A defect-tolerant accelerator for emerging highperformance applications. In ISCA, 2012.
31. P. Vincent, H. Larochelle, Y. Bengio, and P.-A. Manzagol. Extracting and composing robust features with denoising autoencoders. In ICML, 2008.