mlsanityData to 14 Oct 2026

Quiver: Supporting GPUs for Low-Latency, High-Throughput GNN Serving with Workload Awareness

arXiv 2305.10863 ↗First posted 18 May 2023cs.DC cs.AI cs.LGcited by 11

Not on the map. Why?

Abstract (arXiv)

Systems for serving inference requests on graph neural networks (GNN) must combine low latency with high throughout, but they face irregular computation due to skew in the number of sampled graph nodes and aggregated GNN features. This makes it challenging to exploit GPUs effectively: using GPUs to sample only a few graph nodes yields lower performance than CPU-based sampling; and aggregating many features exhibits high data movement costs between GPUs and CPUs. Therefore, current GNN serving systems use CPUs for graph sampling and feature aggregation, limiting throughput. We describe Quiver, a distributed GPU-based GNN serving system with low-latency and high-throughput. Quiver's key idea is to exploit workload metrics for predicting the irregular computation of GNN requests, and governing the use of GPUs for graph sampling and feature aggregation: (1) for graph sampling, Quiver calculates the probabilistic sampled graph size, a metric that predicts the degree of parallelism in graph sampling. Quiver uses this metric to assign sampling tasks to GPUs only when the performance gains surpass CPU-based sampling; and (2) for feature aggregation, Quiver relies on the feature access probability to decide which features to partition and replicate across a distributed GPU NUMA topology. We show that Quiver achieves up to 35 times lower latency with an 8 times higher throughput compared to state-of-the-art GNN approaches (DGL and PyG).

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 27 of its 45 references that are in the map. First posted on arXiv 18 May 2023.

Builds on

27 of 45 references.

References · 27

  1. 2017Graph Attention Networkscited by 8,923
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  4. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,138
  7. 2020Learning to Simulate Complex Physics with Graph Networkscited by 880
  8. 2019Graph Neural Networks for Social Recommendationcited by 714
  9. 2019GraphSAINT: Graph Sampling Based Inductive Learning Methodcited by 618
  10. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
  11. 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
  12. 2020Graph Neural Networks in Recommender Systems: A Surveycited by 494
15 more
  1. 2018Deep Learning on Graphs: A Surveycited by 393
  2. 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 329
  3. 2020GNNGuard: Defending Graph Neural Networks against Adversarial Attackscited by 195
  4. 2016Clipper: A Low-Latency Online Prediction Serving Systemcited by 191
  5. 2019AliGraph: A Comprehensive Graph Neural Network Platformcited by 153
  6. 2020DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphscited by 139
  7. 2020Serving DNNs like Clockwork: Performance Predictability from the Bottom Upcited by 120
  8. 2021BGL: GPU-Efficient GNN Training by Optimizing Graph Data I/O and Preprocessingcited by 50
  9. 2020Accelerating Graph Sampling for Graph Machine Learning using GPUscited by 29
  10. 2021Large-scale graph representation learning with very deep GNNs and self-supervisioncited by 18
  11. 2022BRIGHT -- Graph Neural Networks in Real-Time Fraud Detectioncited by 15
  12. 2018A Deep Learning Approach for Multimodal Deception Detectioncited by 14
  13. 2019CROSSBOW: Scaling Deep Learning with Small Batch Sizes on Multi-GPU Serverscited by 14
  14. 2021PyTorch-Direct: Enabling GPU Centric Data Access for Very Large Graph Neural Network Training with Irregular Accessescited by 12
  15. 2020Move Fast and Meet Deadlines: Fine-grained Real-time Stream Processing with Cameocited by 3

Built on by

Cited by year

Citing papers per year: 2023: 4; 2024: 4; 2025: 3.

11 papers.