arrow
返回

Neural Acceleration for General-Purpose Approximate Programs

delete2014-12-23
delete31
delete
OA
AI
H
Hadi Esmaeilzadeh *
A
Adrian Sampson
L
Luís Ceze
D
Doug Burger
DOI:10.1145/2589750delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
As improvements in per-transistor speed and energy efficiency diminish, radical departures from conventional approaches are needed to continue improvements in the performance and energy efficiency of general-purpose processors. One such departure is approximate computing, where error in computation is acceptable and the traditional robust digital abstraction of near-perfect accuracy is relaxed. Conventional techniques in energy-efficient computing navigate a design space defined by the two dimensions of performance and energy, and traditionally trade one for the other. General-purpose approximate computing explores a third dimension-error-and trades the accuracy of computation for gains in both energy and performance. Techniques to harvest large savings from small errors have proven elusive. This paper describes a new approach that uses machine learning-based transformations to accelerate approximation-tolerant programs. The core idea is to train a learning model how an approximable region of code-code that can produce imprecise but acceptable results-behaves and replace the original code region with an efficient computation of the learned model. We use neural networks to learn code behavior and approximate it. We describe the Parrot algorithmic transformation, which leverages a simple programmer annotation (approximable) to transform a code region from a von Neumann model to a neural model. After the learning phase, the compiler replaces the original code with an invocation of a low-power accelerator called a neural processing unit (NPU). The NPU is tightly coupled to the processor pipeline to permit profitable acceleration even when small regions of code are transformed. Offloading approximable code regions to NPUs is faster and more energy efficient than executing the original code. For a set of diverse applications, NPU acceleration provides whole-application speedup of 2.3x and energy savings of 3.0x on average with average quality loss of at most 9.6%. NPUs form a new class of accelerators and show that significant gains in both performance and efficiency are achievable when the traditional abstraction of near-perfect accuracy is relaxed in general-purpose computing.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Communications of the ACM 封面图
Communications of the ACM
IF:
12.2
论文数:
1.2W
被引数:
3.7W

机构

G
Georgia Institute of Technology
学者数:
1.8W
论文数: 1.4W
被引数: 5.9W
U
University of Washington
学者数:
8.0W
论文数: 7.0W
被引数: 12.5W
U
university system of georgia
学者数:
7.3W
论文数: 6.5W
被引数: 101
学者 查看更多机构
引用论文

引用论文

Machine Learning for Personalized Medicine: Predicting Primary Myocardial Infarction from Electronic Health Records
err2012-12-01
err0
errOAAI
errJeremy C. Weiss; Sriraam Natarajan; Peggy L. Peissig; Catherine A. McCarty; David Page
err分享
err收藏
Binding Studies on Modified Vancomycin
err1997-01-01
err0
PREAI
errSiau-Gek Ang; Yoke-Keow Peh
err分享
err收藏
Mechanistic aspects of the role of coupling agents in silica–rubber composites
err2003-06-01
err0
PREAI
errJ.W.ten Brinke; S.C. Debnath; L.A.E.M. Reuvekamp; J.W.M. Noordermeer
err分享
err收藏
Energy-Efficient Floating-Point Unit Design
err2011-07-01
err100
PREAI
errGalal, Sameh; Horowitz, Mark
err分享
err收藏
err分享
err收藏
Conversion Coating Used in Bipolar Plates in PEMFCs
err2014-11-01
err0
errOAAI
errTe-Yuan Chiang; Ay-Su; Lin-Chang Tsai; Hung-Hua Sheu; Chen-En Lu
err分享
err收藏
Resource-efficient wireless monitoring based on mobile agent migration
err2011-03-24
err0
errOAAI
errKay Smarsly; Kincho H. Law; Markus König
err分享
err收藏
err分享
err收藏
学者 查看更多内容