REVIEW 2 cited by
GRIP: A Graph Neural Network Accelerator Architecture
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present GRIP, a graph neural network accelerator architecture designed for low-latency inference. AcceleratingGNNs is challenging because they combine two distinct types of computation: arithmetic-intensive vertex-centric operations and memory-intensive edge-centric operations. GRIP splits GNN inference into a fixed set of edge- and vertex-centric execution phases that can be implemented in hardware. We then specialize each unit for the unique computational structure found in each phase.For vertex-centric phases, GRIP uses a high performance matrix multiply engine coupled with a dedicated memory subsystem for weights to improve reuse. For edge-centric phases, GRIP use multiple parallel prefetch and reduction engines to alleviate the irregularity in memory accesses. Finally, GRIP supports severalGNN optimizations, including a novel optimization called vertex-tiling which increases the reuse of weight data.We evaluate GRIP by performing synthesis and place and route for a 28nm implementation capable of executing inference for several widely-used GNN models (GCN, GraphSAGE, G-GCN, and GIN). Across several benchmark graphs, it reduces 99th percentile latency by a geometric mean of 17x and 23x compared to a CPU and GPU baseline, respectively, while drawing only 5W.
Forward citations
Cited by 2 Pith papers
-
ReInc: Scaling Training of Dynamic Graph Neural Networks
ReInc trains dynamic GNNs on large graphs up to 12.8x to 17.7x faster than DynaGraph and ESDGNN by reusing cached aggregations, incremental delta-based updates, and a communication-free snapshot placement.
-
MixGCN: Scalable GCN Training by Mixture of Parallelism and Mixture of Accelerators
MixGCN combines feature-level and node-level parallelism with a dedicated sparse accelerator and node reordering to speed up full-graph GCN training.
Discussion (0). Continue with ORCID to comment.