mlsanityData to 7 Oct 2026

VersaGNN: a Versatile accelerator for Graph neural networks

arXiv 2105.01280 ↗First posted 4 May 2021cs.LG cs.AI cs.ARcited by 3

Not on the map. Why?

Abstract (arXiv)

textitGraph Neural Network (GNN) is a promising approach for analyzing graph-structured data that tactfully captures their dependency information via node-level message passing. It has achieved state-of-the-art performances in many tasks, such as node classification, graph matching, clustering, and graph generation. As GNNs operate on non-Euclidean data, their irregular data access patterns cause considerable computational costs and overhead on conventional architectures, such as GPU and CPU. Our analysis shows that GNN adopts a hybrid computing model. The textitAggregation (or textitMessage Passing) phase performs vector additions where vectors are fetched with irregular strides. The textitTransformation (or textitNode Embedding) phase can be either dense or sparse-dense matrix multiplication. In this work, We propose textitVersaGNN, an ultra-efficient, systolic-array-based versatile hardware accelerator that unifies dense and sparse matrix multiplication. By applying this single optimized systolic array to both aggregation and transformation phases, we have significantly reduced chip sizes and energy consumption. We then divide the computing engine into blocked systolic arrays to support the textitStrassen's algorithm for dense matrix multiplication, dramatically scaling down the number of multiplications and enabling high-throughput computation of GNNs. To balance the workload of sparse-dense matrix multiplication, we also introduced a greedy algorithm to combine sparse sub-matrices of compressed format into condensed ones to reduce computational cycles. Compared with current state-of-the-art GNN software frameworks, textitVersaGNN achieves on average 3712× speedup with 1301.25× energy reduction on CPU, and 35.4× speedup with 17.66× energy reduction on GPU.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 49 references that are in the map. First posted on arXiv 4 May 2021.

Builds on

24 of 49 references.

References · 24

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2018How Powerful are Graph Neural Networks?cited by 4,355
  6. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  7. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  8. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  9. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  10. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  11. 2016Variational Graph Auto-Encoderscited by 1,373
  12. 2018Link Prediction Based on Graph Neural Networkscited by 829
12 more
  1. 2018Hierarchical Graph Representation Learning with Differentiable Poolingcited by 786
  2. 2016Learning Convolutional Neural Networks for Graphscited by 314
  3. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
  4. 2015Diffusion-Convolutional Neural Networkscited by 268
  5. 2015Deep Convolutional Networks on Graph-Structured Datacited by 246
  6. 2017SCNN: An Accelerator for Compressed-sparse Convolutional Neural Networkscited by 132
  7. 2017GraphGAN: Graph Representation Learning with Generative Adversarial Netscited by 121
  8. 2020HyGCN: A GCN Accelerator with Hybrid Architecturecited by 73
  9. 2019GraphZoom: A multi-level spectral approach for accurate and scalable graph embeddingcited by 58
  10. 2019EnGN: A High-Throughput and Energy-Efficient Accelerator for Large Graph Neural Networkscited by 42
  11. 2019GraphACT: Accelerating GCN Training on CPU-FPGA Heterogeneous Platformscited by 29
  12. 2018Packing Sparse Convolutional Neural Networks for Efficient Systolic Array Implementations: Column Combining Under Joint Optimizationcited by 15

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2.

3 papers.