Name
Abstract | ||
|---|---|---|
Graph algorithms such as graph traversal have been gaining ever-increasing importance in the era of big data. However, graph processing on traditional architectures issues many random and irregular memory accesses, leading to a huge number of data movements and the consumption of very large amounts of energy. To minimize the waste of memory bandwidth, we investigate utilizing processing-in-memory (PIM), combined with non-volatile metal-oxide resistive random access memory (ReRAM), to improve both computation and I/O performance.
We propose a new ReRAM-based processing-in-memory architecture called RPBFS, in which graph data can be persistently stored and processed in place. We study the problem of graph traversal, and we design an efficient graph traversal algorithm in RPBFS. Benefiting from low data movement overhead and high bank-level parallel computation, RPBFS shows a significant performance improvement compared with both the CPU-based and the GPU-based BFS implementations. On a suite of real-world graphs, our architecture yields a speedup in graph traversal performance of up to 33.8×, and achieves a reduction in energy over conventional systems of up to 142.8×.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1145/3177916 | TOS |
Keywords | Field | DocType |
BFS, ReRAM, architecture, processing-in-memory | Central processing unit,Memory bandwidth,Graph traversal,Computer science,Parallel computing,Memory architecture,Computation,Speedup,Resistive random-access memory,Performance improvement | Journal |
Volume | Issue | ISSN |
14 | 1 | 1553-3077 |
Citations | PageRank | References |
3 | 0.40 | 42 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lei Han | 1 | 45 | 11.52 |
| Zhaoyan Shen | 2 | 29 | 9.79 |
| Duo Liu | 3 | 477 | 26.83 |
| Zili Shao | 4 | 1618 | 134.03 |
| H. Howie Huang | 5 | 537 | 40.29 |
| Tao Li | 6 | 51 | 3.00 |