Traversing Large Graphs on GPUs with Unified Memory
Summary: Evaluates BFS on large graphs with unified memory, pinpointing slowdowns from host-memory access and irregular data patterns. Proposes HALO (Harmonic Locality Ordering), an offline pre-processing step for static graphs that yields 1.5x-1.9x speedups and ties locality ordering to graph compression via recursive bisection. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Prasun Gera (Georgia Institute of Technology)
- 2. Hyojong Kim (Georgia Institute of Technology)
- 3. Piyush Sao (Oak Ridge National Laboratory)
- 4. Hyesoon Kim (Georgia Institute of Technology)
- 5. David Bader (New Jersey Institute of Technology)
BibTeX Citation
@article{gera_vldb20,
title = {{Traversing Large Graphs on GPUs with Unified Memory}},
author = {Gera, Prasun and Kim, Hyojong and Sao, Piyush and Kim, Hyesoon and Bader, David},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {7},
pages = {1119--1133},
doi = {10.14778/3384345.3384358},
url = {https://doi.org/10.14778/3384345.3384358},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,224 | Large Graph Convolutional Network Training with GPU-Oriented Data Communication Architecture | 2021 | VLDB | 0.000114497 |
| 5,172 | CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor | 2024 | VLDB | 6.2439642e-05 |
| 5,521 | EMOGI: Efficient Memory-access for Out-of-memory Graph-traversal in GPUs | 2021 | VLDB | 6.0959947e-05 |
| 5,734 | Cache-Efficient Fork-Processing Patterns on Large Graphs | 2021 | SIGMOD | 6.0137932e-05 |
| 6,249 | Self-adaptive Graph Traversal on GPUs | 2021 | SIGMOD | 5.8358127e-05 |
| 6,526 | CompressGraph: Efficient Parallel Graph Analytics with Rule-Based Compression | 2023 | SIGMOD | 5.7559739e-05 |
| 6,669 | Efficient Training of Graph Neural Networks on Large Graphs | 2024 | VLDB | 5.7147311e-05 |
| 8,400 | TOD: GPU-accelerated Outlier Detection via Tensor Operations | 2023 | VLDB | 5.3395906e-05 |
| 11,338 | Efficient Graph Data Access for Out-of-Memory GPU Streaming Graph Processing | 2025 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 208 | EmptyHeaded: A Relational Engine for Graph Processing | 2016 | SIGMOD | 0.00024884544 |
| 1,440 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD | 0.00010641888 |
| 2,019 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.1750421e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,440 | Speedup Graph Processing by Graph Ordering | 2016 | SIGMOD |
| 2 | 4,237 | Accelerating Dynamic Graph Analytics on GPUs | 2018 | VLDB |
| 3 | 5,172 | CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor | 2024 | VLDB |
| 4 | 1,963 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 5 | 2,468 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD |
| 6 | 10,882 | Efficient GPU-Accelerated Local Subgraph Counting | 2026 | VLDB |
| 7 | 2,789 | iBFS: Concurrent Breadth-First Search on GPUs | 2016 | SIGMOD |
| 8 | 5,521 | EMOGI: Efficient Memory-access for Out-of-memory Graph-traversal in GPUs | 2021 | VLDB |
| 9 | 6,249 | Self-adaptive Graph Traversal on GPUs | 2021 | SIGMOD |
| 10 | 4,207 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD |