Graph Theory and Algorithms Open access Peer reviewed

LEO: Enabling Efficient Communication-Computation Pipeline for GNN via Hierarchical Caching

Jiaqi Si, Dezun Dong

ACM Transactions on Architecture and Code Optimization | Sep 24, 2026

Scollr summary

What this paper is about

The core of LEO lies in introducing hierarchical caching to construct a hybrid-grained software pipeline, enabling efficient computation-communication overlap both within and across GPU kernels.

Full abstract

Read the full abstract

Training large-scale graphs with GNNs on multi-GPU platforms faces substantial feature loading overhead, leading to low resource utilization and inefficient training. Overcoming such communication bottlenecks is crucial, and current solutions achieve this by overlapping computation and communication through pipelining. However, current designs often focus only on limited operation scheduling and overlook workload imbalance within the pipeline, restricting their performance optimization in heterogeneous environments. This article introduces LEO , a novel system to accelerate full-graph GNN training on multiple GPUs. The core of LEO lies in introducing hierarchical caching to construct a hybrid-grained software pipeline, enabling efficient computation-communication overlap both within and across GPU kernels. First, LEO introduces a hierarchical cache policy that effectively balances the workload between local and remote operations. Second, LEO tailors a cache-based pipeline and hybrid workload mapping to facilitate operation overlap. Extensive evaluations show that LEO outperforms state-of-the-art full-graph GNN systems in various settings: on averaged 7.50×, 11.90×, and 3.25× faster than DGL, LEO-UVM, and MGG, respectively.

Direct answer

What can I do from this paper page?

Use this page to scan "LEO: Enabling Efficient Communication-Computation Pipeline for GNN via Hierarchical Caching" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Graph Theory and Algorithms research, save the paper, or map adjacent work.

Authors

Researchers on this paper

Jiaqi Si

first | National University of Defense Technology | ORCID 0000-0002-9959-611X

Dezun Dong

last | National University of Defense Technology | ORCID 0000-0001-6243-8479

Research areas

Follow related topics

Citation

BibTeX

@article{Si2026Enabling,
  title = {LEO: Enabling Efficient Communication-Computation Pipeline for GNN via Hierarchical Caching},
  author = {Jiaqi Si and Dezun Dong},
  journal = {ACM Transactions on Architecture and Code Optimization},
  year = {2026},
  doi = {10.1145/3840397},
  url = {https://doi.org/10.1145/3840397}
}

FAQ

Using this paper in a discovery workflow

How do I find related work for this paper?

Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.

How can I keep up with new Graph Theory and Algorithms research papers?

Follow Graph Theory and Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.

Can I cite this paper from this page?

This page includes a static BibTeX block for LEO: Enabling Efficient Communication-Computation Pipeline for GNN via Hierarchical Caching. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.

Follow this research in Scollr

Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.

Get the app