· 2012
Scalable GPU graph traversal
- 513citations
- 2012year
Short summary
A novel GPU-accelerated BFS algorithm achieves 1.7x speedup over prior methods on graphs with non-trivial diameter.
AI-generated from the title and abstract; the full text is not read.
Key points
- Introduces a new GPU algorithm for Breadth-First Search (BFS).
- Addresses limitations of prior GPU BFS methods on graphs with non-trivial diameter.
- Achieves 1.7x speedup compared to existing techniques.
- Handles irregular memory access and data-dependent work distribution.
AI-generated from the title and abstract; the full text is not read.
Abstract
Breadth-first search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms. It is also representative of a class of parallel computations whose memory accesses and work distribution are both irregular and data-dependent. Recent work has demonstrated the plausibility of GPU sparse graph traversal, but has tended to focus on asymptotically inefficient algorithms that perform poorly on graphs with non-trivial diameter.
The authors' abstract, as published at the source., 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Hardware and Architecture
Hardware and ArchitectureComputer Science