Morphling: Fast, Fused, and Flexible GNN Training at Scale
Anubhab, Rupesh Nasre

TL;DR
Morphling is a domain-specific code synthesizer that significantly accelerates GNN training by optimizing execution across hardware platforms, reducing memory usage, and dynamically adapting to data sparsity.
Contribution
It introduces Morphling, a novel framework that compiles high-level GNN specifications into optimized, architecture-aware implementations with dynamic sparsity-aware execution.
Findings
Achieves up to 66X speedup over existing frameworks.
Reduces peak memory consumption by up to 15X.
Improves training throughput by an average of 20X on CPUs and 19X on GPUs.
Abstract
Graph Neural Networks (GNNs) present a fundamental hardware challenge by fusing irregular, memory-bound graph traversals with regular, compute-intensive dense matrix operations. While frameworks such as PyTorch Geometric (PyG) and Deep Graph Library (DGL) prioritize high-level usability, they fail to address these divergent execution characteristics. As a result, they rely on generic kernels that suffer from poor cache locality, excessive memory movement, and substantial intermediate allocations. To address these limitations, we present Morphling, a domain-specific code synthesizer designed to bridge this gap. Morphling compiles high-level GNN specifications into portable, backend-specialized implementations targeting OpenMP, CUDA, and MPI. It achieves this by instantiating a library of optimized, architecture-aware primitives tailored to each execution environment. Morphling also…
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 · Graph Theory and Algorithms · Machine Learning in Materials Science
