Reducing Data Movement with Approximate Computing Techniques
Abstract
Data movement is the dominant factor that limits performance and efficiency in today’s architectures, and we do not expect that to change in future architectures. In this paper, we describe how approximate computing... [ view full abstract ]
Data movement is the dominant factor that limits performance and efficiency in today’s architectures, and we do not expect that to change in future architectures. In this paper, we describe how approximate computing techniques can be applied to communication at the algorithm level, in conventional computer architectures, and in the architectures being explored as we go beyond Moore’s Law. We present results that demonstrate potential performance gains and the effect of approximations in traditional computer architectures. We describe how these techniques may be applied to future architectures based on probabilistic, approximate, stochastic, and neuromorphic computing, as well as more conventional heterogeneous and 3D architectures.
Authors
-
Stephen Crago
(USC/ISI)
-
Donald Yeung
(University of Maryland)
Topic Areas
Topics: Neuromorphic, or “brain inspired”, computing , Topics: Extending Moore’s law and augmenting CMOS , Topics: Approximate and stochastic computing
Session
OS-01A » Approximate and Stochastic Computing (10:15 - Monday, 17th October, Del Mar Ballroom C)
Paper
ID104_ICRC2016_final.pdf
Presentation Files
The presenter has not uploaded any presentation files.