A complete discussion on fully reconfigurable, digital, scalable, graph and sparsity-aware near-memory accelerator for graph neural networks
Siddhartha Raman Sundara Raman, Lizy John, Jaydeep P. Kulkarni

TL;DR
This paper introduces NEM-GNN, a scalable, energy-efficient, reconfigurable near-memory accelerator for GNNs that handles heterogeneous memory behaviors effectively.
Contribution
It proposes a novel PIM architecture with early termination, pre-computation, and sparsity-aware aggregation, overcoming scalability and energy limitations of prior approaches.
Findings
Achieves 80-230x higher performance than prior methods.
Demonstrates 80-300x higher throughput.
Provides 850-1134x better energy efficiency.
Abstract
Graph neural networks (GNNs) have gained significant interest for applications such as citation network analysis and drug discovery due to their ability to apply machine learning techniques on graph-structured data. GNNs typically employ a two-stage execution pipeline consisting of combination and aggregation kernels. The combination stage performs data-intensive convolution operations with relatively regular memory access patterns, whereas the aggregation stage operates on sparse graph data with highly irregular accesses. These heterogeneous memory behaviors make conventional CPU- and GPU-based execution energy inefficient due to substantial data movement overheads. Existing accelerators attempt to mitigate these challenges using specialized architectures and processing-in-memory (PIM) techniques. However, prior approaches often suffer from scalability limitations, area overheads,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
