An effective GPU implementation of breadth-first search

Breadth-first search (BFS) has wide applications in electronic design automation (EDA) as well as in other fields. Researchers have tried to accelerate BFS on the GPU, but the two published works are both asymptotically slower than the fastest CPU implementation. In this paper, we present a new GPU...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Design Automation Conference s. 52 - 55
Hlavní autoři: Lijuan Luo, Wong, Martin, Wen-mei Hwu
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 13.06.2010
Témata:
Acceleration
Application software
BFS
Central Processing Unit
Compaction
Computational complexity
CUDA
Electronic design automation and methodology
GPU computing
Kernel
Mathematical programming
Mathematics
Permission
ISBN:9781424466771, 1424466776
ISSN:0738-100X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Breadth-first search (BFS) has wide applications in electronic design automation (EDA) as well as in other fields. Researchers have tried to accelerate BFS on the GPU, but the two published works are both asymptotically slower than the fastest CPU implementation. In this paper, we present a new GPU implementation of BFS that uses a hierarchical queue management technique and a three-layer kernel arrangement strategy. It guarantees the same computational complexity as the fastest sequential version and can achieve up to 10 times speedup.
ISBN:9781424466771
1424466776
ISSN:0738-100X
DOI:10.1145/1837274.1837289