SCV-GNN: Sparse Compressed Vector-based Graph Neural Network Aggregation
Nanda K. Unnikrishnan, Joe Gould, Keshab K.Parhi

TL;DR
SCV-GNN introduces a novel sparse compressed vectors format optimized for GNN aggregation, significantly improving speed and reducing memory traffic, thereby enhancing GNN inference efficiency on specialized hardware.
Contribution
The paper proposes the SCV-GNN format with Z-Morton ordering for better data locality, demonstrating scalability and substantial performance gains over traditional sparse formats.
Findings
Achieves nearly 8x speedup over CSC and CSR methods.
Reduces memory traffic by over 3x and 4x respectively.
Enhances GNN inference latency and memory efficiency.
Abstract
Graph neural networks (GNNs) have emerged as a powerful tool to process graph-based data in fields like communication networks, molecular interactions, chemistry, social networks, and neuroscience. GNNs are characterized by the ultra-sparse nature of their adjacency matrix that necessitates the development of dedicated hardware beyond general-purpose sparse matrix multipliers. While there has been extensive research on designing dedicated hardware accelerators for GNNs, few have extensively explored the impact of the sparse storage format on the efficiency of the GNN accelerators. This paper proposes SCV-GNN with the novel sparse compressed vectors (SCV) format optimized for the aggregation operation. We use Z-Morton ordering to derive a data-locality-based computation ordering and partitioning scheme. The paper also presents how the proposed SCV-GNN is scalable on a vector processing…
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.
Taxonomy
TopicsAdvanced Graph Neural Networks · Machine Learning and ELM · Graph Theory and Algorithms
