Pith. sign in

REVIEW 2 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.10863 v1 pith:XS24CUQS submitted 2023-05-18 cs.DC cs.AIcs.LGcs.OS

classification cs.DCcs.AIcs.LGcs.OS
keywords graphquiversamplinggpusfeatureservingaggregationfeatures
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. OMEGA: A Low-Latency GNN Serving System for Large Graphs

    cs.DC 2025-01 conditional novelty 6.0 of 10

    A distributed GNN serving system combines selective recomputation of precomputed embeddings with computation graph parallelism to achieve orders-of-magnitude lower serving latency with small accuracy loss.

  2. PyG 2.0: Scalable Learning on Real World Graphs

    cs.LG 2025-07 conditional novelty 4.0 of 10

    PyG 2.0 is presented as a modular, scalable graph-learning framework with heterogeneous and temporal graph support, compilation-based speedups, and explainability.

Pith tools