Name
Abstract | ||
|---|---|---|
The explosion of digital data and the ever-growing need for fast data analysis have made in-memory big-data processing in computer systems increasingly important. In particular, large-scale graph processing is gaining attention due to its broad applicability from social science to machine learning. However, scalable hardware design that can efficiently process large graphs in main memory is still an open problem. Ideally, cost-effective and scalable graph processing systems can be realized by building a system whose performance increases proportionally with the sizes of graphs that can be stored in the system, which is extremely challenging in conventional systems due to severe memory bandwidth limitations. In this work, we argue that the conventional concept of processing-in-memory (PIM) can be a viable solution to achieve such an objective. The key modern enabler for PIM is the recent advancement of the 3D integration technology that facilitates stacking logic and memory dies in a single package, which was not available when the PIM concept was originally examined. In order to take advantage of such a new technology to enable memory-capacity-proportional performance, we design a programmable PIM accelerator for large-scale graph processing called Tesseract. Tesseract is composed of (1) a new hardware architecture that fully utilizes the available memory bandwidth, (2) an efficient method of communication between different memory partitions, and (3) a programming interface that reflects and exploits the unique hardware design. It also includes two hardware prefetchers specialized for memory access patterns of graph processing, which operate based on the hints provided by our programming model. Our comprehensive evaluations using five state-of-the-art graph processing workloads with large real-world graphs show that the proposed architecture improves average system performance by a factor of ten and achieves 87% average energy reduction over conventional systems. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2749469.2750386 | International Symposium on Computer Architecture |
Keywords | Field | DocType |
scalable processing-in-memory accelerator,parallel graph processing,data analysis,in-memory big-data processing,computer systems,graph processing systems,memory bandwidth limitations,3D integration technology,stacking logic,memory-capacity-proportional performance,programmable PIM accelerator,Tesseract,hardware architecture,programming interface,hardware prefetchers,memory access patterns | Graph theory,Computer architecture,System on a chip,Memory bandwidth,Programming paradigm,Hybrid Memory Cube,Computer science,Parallel computing,Real-time computing,Tesseract,Scalability,Hardware architecture | Conference |
Volume | Issue | ISSN |
43 | 3S | 0163-5964 |
Citations | PageRank | References |
177 | 3.81 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junwhan Ahn | 1 | 451 | 18.82 |
| Sungpack Hong | 2 | 864 | 33.20 |
| Sungjoo Yoo | 3 | 1398 | 96.56 |
| Onur Mutlu | 4 | 9446 | 357.40 |
| Kiyoung Choi | 5 | 1866 | 171.98 |