Publications

Detailed Information

A Case for In-Memory Random Scatter-Gather for Fast Graph Processing

Cited 0 time in Web of Science Cited 0 time in Scopus
Authors

Shin, Changmin; Kwon, Taehee; Song, Jaeyong; Ju, Jae Hyung; Liu, Frank; Choi, Yeonkyu; Lee, Jinho

Issue Date
2024-01
Publisher
Institute of Electrical and Electronics Engineers Inc.
Citation
IEEE Computer Architecture Letters, Vol.23 No.1, pp.73-77
Abstract
Because of the widely recognized memory wall issue, modern DRAMs are increasingly being assigned innovative functionalities beyond the basic read and write operations. Often referred to as “function-inmemory”, these techniques are crafted to leverage the abundant internal bandwidth available within the DRAM. However, these techniques face several challenges, including requiring large areas for arithmetic units and the necessity of splitting a single word into multiple pieces. These challenges severely limit the practical application of these functionin- memory techniques. In this paper, we present Piccolo, an efficient design of random scatter-gather memory. Our method achieves significant improvements with minimal overhead. By demonstrating our technique on a graph processing accelerator, we show that Piccolo and the proposed accelerator achieves $1.2-3.1 \times$ speedup compared to the prior art.
ISSN
1556-6056
URI
https://hdl.handle.net/10371/200362
DOI
https://doi.org/10.1109/LCA.2024.3376680
Files in This Item:
There are no files associated with this item.
Appears in Collections:

Related Researcher

  • College of Engineering
  • Department of Electrical and Computer Engineering
Research Area AI Accelerators, Distributed Deep Learning, Neural Architecture Search

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share