Computing with Near Data

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 213
  • Download : 0
One cost that plays a significant role in shaping the overall performance of both single-threaded and multi-thread applications in modern computing systems is the cost of moving data between compute elements and storage elements. Traditional approaches to address this cost are code and data layout reorganizations and various hardware enhancements. More recently, an alternative paradigm, called Near Data Computing (NDC) or Near Data Processing (NDP), has been shown to be effective in reducing the data movements costs, by moving computation to data, instead of the traditional approach of moving data to computation. Unfortunately, the existing Near Data Computing proposals require significant modifications to hardware and are yet to be widely adopted.
Publisher
ACM
Issue Date
2018-12
Language
English
Citation

Journal Proceedings of the ACM on Measurement and Analysis of Computing Systems , v.2, no.3

ISSN
2476-1249
DOI
10.1145/3287321
URI
http://hdl.handle.net/10203/268727
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0