A novel ReRAM-based processing-in-memory architecture for graph computing
Authors:
- 1 August 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Abstract
Graph algorithms such as breadth-first search (BFS) have been gaining ever-increasing importance in the era of Big Data. However, the memory bandwidth remains the key performance bottleneck for graph processing. To address this problem, we utilize processing-in-memory (PIM), combined with non-volatile metal-oxide resistive random access memory (ReRAM), to improve the performance of both computation and I/O. The idea is to integrate the computation logic into the memory in which the data accesses are located. We propose and implement a new ReRAM-based processing-in-memory architecture called RPBFS, in which graphs can be processed and persistently stored. We also design an efficient graph traversal scheme. Benefited from low data movement overhead and bank-level parallel computation, RPBFS shows a significant performance improvement compared with both the CPU-based and GPU-based BFS implementations. On a suite of real world graphs, our architecture yields up to 33.8× speedup.Keywords
This publication has 11 references indexed in Scilit:
- GraphBIG2015
- Enterprise2015
- Locality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server2015
- A scalable processing-in-memory accelerator for parallel graph processing2015
- Overcoming the challenges of crossbar resistive memory architectures2015
- NVSim: A Circuit-Level Performance, Energy, and Area Model for Emerging Non-volatile Memory2013
- Direction-Optimizing Breadth-First SearchScientific Programming, 2013
- High precision tuning of state for memristive devices by adaptable variation-tolerant algorithmNanotechnology, 2012
- An effective GPU implementation of breadth-first search2010
- Accelerating Large Graph Algorithms on the GPU Using CUDA2008