iBFS: Concurrent Breadth-First Search on GPUs
Summary: iBFS is a GPU-based framework for concurrent BFS from multiple sources, with a single joint-traversal kernel, outdegree-based GroupBy to maximize frontier sharing, and bitwise per-vertex checks across BFS instances. Evaluations show up to 30x single-GPU speedup and near-linear scaling to 112 GPUs, achieving peak TEPS in the tens of trillions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hang Liu
- 2. H. Howie Huang
- 3. Yang Hu
Incoming Citations (Sorted by Pagerank)
Showing 10 of 10 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,775 | CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching | 2019 | SIGMOD | 0.00010602927 |
| 4,522 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD | 6.1146374e-05 |
| 4,577 | Accelerating Dynamic Graph Analytics on GPUs | 2018 | VLDB | 6.0709631e-05 |
| 4,671 | Realtime Top-k Personalized PageRank over Large Graphs on GPUs | 2020 | VLDB | 6.0085645e-05 |
| 5,680 | Parallel Personalized PageRank on Dynamic Graphs | 2018 | VLDB | 5.3734643e-05 |
| 6,059 | Cache-Efficient Fork-Processing Patterns on Large Graphs | 2021 | SIGMOD | 5.2307519e-05 |
| 7,158 | GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection | 2021 | SIGMOD | 4.8143783e-05 |
| 7,225 | Self-adaptive Graph Traversal on GPUs | 2021 | SIGMOD | 4.7956162e-05 |
| 9,793 | uBlade: Efficient Batch Processing for Uncertain Graph Queries | 2024 | SIGMOD | 4.2818172e-05 |
| 10,146 | CANDOR-Bench: Benchmarking In-Memory Continuous ANNS under Dynamic Open-World Streams [Experiments & Analysis] | 2026 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 279 | 3-HOP: A High-Compression Indexing Scheme for Reachability Query | 2009 | SIGMOD | 0.00029113513 |
| 733 | GRAIL: Scalable Reachability Index for Large Graphs | 2010 | VLDB | 0.00017460741 |
| 1,665 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.00010967716 |
| 2,756 | K-Reach: Who is in Your Small World | 2012 | VLDB | 8.1682536e-05 |
| 5,485 | Neighborhood-Privacy Protected Shortest Distance Computing in Cloud | 2011 | SIGMOD | 5.4813218e-05 |
| 7,192 | Parallel Graph Processing on Graphics Processors Made Easy | 2013 | VLDB | 4.804655e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,968 | Efficient GPU-Accelerated Subgraph Matching | 2023 | SIGMOD | 5.7956205e-05 |
| 1,973 | Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions | 2018 | SIGMOD | 9.8913631e-05 |
| 10,079 | Fast Optimal Group Steiner Tree Search using GPUs | 2026 | SIGMOD | 4.1945683e-05 |
| 3,641 | GPU-Accelerated Subgraph Enumeration on Partitioned Graphs | 2020 | SIGMOD | 6.8884895e-05 |
| 5,799 | CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor | 2024 | VLDB | 5.3219334e-05 |
| 2,521 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6065919e-05 |
| 1,138 | Traversing Large Graphs on GPUs with Unified Memory | 2020 | VLDB | 0.00013727765 |
| 4,522 | GPU-based Graph Traversal on Compressed Graphs | 2019 | SIGMOD | 6.1146374e-05 |
| 5,474 | Efficient Load-Balanced Butterfly Counting on GPU | 2022 | VLDB | 5.4881807e-05 |
| 1,665 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.00010967716 |