An effective GPU implementation of breadth-first search
University of Illinois at Urbana-Champaign
In Proceedings of the 47th Design Automation Conference (2010), pp. 52-55
@conference{luo2010effective,
title={An effective GPU implementation of breadth-first search},
author={Luo, L. and Wong, M. and Hwu, W.},
booktitle={Proceedings of the 47th Design Automation Conference},
pages={52–55},
year={2010},
organization={ACM}
}
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.
December 15, 2010 by hgpu
