DBScholar

Back to papers

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)

Paper ID
12219
Venue
VLDB
Year
2020
Pagerank
9.2454783e-05
Overall Rank
2,060 | 85.87%
DOI
10.14778/3384345.3384358

Incoming Non-self Citations Over Time

Authors

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.

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
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
1,511 Speedup Graph Processing by Graph Ordering 2016 SIGMOD 0.00010538011
2,112 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1514258e-05
Previous Page 1 / 1 Next

Semantically Similar Papers