Skip to content

Taurus: Accelerating Out-of-Core Graph Neural Network Inference on Billion-Scale Graphs

Jul 2026 · arXiv.org · Vol abs/2607.17374 · 0 citations · 39 references
Computer Science

TL;DR

Taurus is presented, a single-machine system for GNN inference on graphs that do not fit in RAM, supporting both full-graph inference and fanout-sampled inference, and outperforms the strongest layer-wise baseline, DGI.

Abstract

Graph Neural Network (GNN) inference on billion-scale graphs is challenging due to the large memory footprint of features and embeddings and high disk I/O costs in out-of-core settings. Existing distributed GNN systems incur high communication times and infrastructure costs, while disk-based GNN systems are primarily tailored to training and experience massive wasted reads during inference on the entire graph. We present Taurus, a single-machine system for GNN inference on graphs that do not fit in RAM, supporting both \textit{exact} full-graph inference and fanout-sampled inference. To avoid random and repeated feature gathers, Taurus reformulates layer-wise inference as source-centric broadcasts over sequential SSD scans, backed by a pipelined GPU-CPU-SSD hierarchy, topology-aware reordering, pending-message eviction, and a GPU-resident store for high-degree vertices. It further uses non-buffered sequential reads and GPU-backed writes to reduce page-cache pollution, host-memory pressure, and write overheads. On out-of-core graphs with up to $269M$ vertices, $4B$ edges, and $514$ GiB of features, Taurus outperforms the strongest layer-wise baseline, DGI, by $7$-$25\times$, and vertex-wise baselines by $40$-$140\times$.

View source

Similar papers

#graph neural networks Preprint Jul 2026

FAST: A Holistic Framework for Optimizing Memory-I/O, Computation, and Sampling in Temporal GNN Training

FAST is presented, a holistic framework that accelerates end-to-end TGNN training by jointly optimizing sampling, memory I/O, and computation and designs thread-efficient graph operators tailored to sparse temporal subgraphs, improving GPU cache locality and reducing the latency of aggregation and edge softmax.

Yu Cai, Qingrui Zhu, Lei Liu et al. · 0 citations
Book Open access Jul 2026

ExCC: External Memory Connected Components on Large Graphs

ExCC is presented, an external-memory CC algorithm that keeps the full graph in host-pinned RAM and streams edge batches to the GPU through a three-phase pipeline of union-find merging and achieves predictable sequential I/O behavior across all phases.

Prajjwal Nijhara, D. Banerjee · 0 citations
Review Open access 2026

GPU-Accelerated Sparse Matrix-Dense Matrix Multiplication for Graph Neural Networks: A Comprehensive Survey

It is found that no single kernel dominates across all graph structures and that effective Tensor Core utilization reaches only 5–20% on irregular GNN matrices, while graph reordering is broadly beneficial, yielding gains of up to $43\times $ when it enables Sparse Tensor Core execution.

Tariq Habib Afridi, Muhammad Numan Khan, Young-Koo Lee · 0 citations
#graph neural networks Preprint Aug 2026

CoRe-GNN: Multilevel Message passing on Coarsened graphs

CoRe-GNN is proposed, which performs both propagations in parallel at each layer: a coarsened inter-cluster term capturing long-range structure, and a local intra-cluster term preserving per-node discriminability.

Antonin Joly, Nicolas Keriven, Aline Roumy · 0 citations
Conference Open access May 2026

SNI-GNN: SmartNIC-Assisted Full-Graph GNN Training with In-Network Embedding Prediction

SmartNIC-based in-network prediction is a practical complement to partitioning and compression techniques for communicationefficient full-graph GNN training at scale, and results indicate SmartNIC-based in-network prediction is a practical complement to partitioning and compression techniques for communicationefficient...

Guofan Yu, Si-Tian Chen, Zhenheng Tang et al. · 0 citations
Book Open access Aug 2026

Turbo: Efficiently Serving Long-Context Large Language Models with In-Network Aggregation

This work proposes Turbo, a first-of-its-kind in-network aggregation system that accelerates long-context inference by offloading query broadcast and attention aggregation to switches and introduces a rolling forward scheme that propagates states to enable cross-stage updates.

Ying Wan, Yuchen Xu, Chuwen Zhang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.