TY  - CHAP
U1  - Konferenzveröffentlichung
A1  - Berrendorf, Rudolf
A1  - Makulla, Mathias
T1  - Level-Synchronous Parallel Breadth-First Search Algorithms For Multicore and Multiprocessor Systems
T2  - Nygard, Tamir (Eds.): Future Computing 2014, The Sixth International Conference on Future Computational Technologies and Applications. Venice, Italy, May 25-29, 2014
N2  - Breadth-First Search (BFS) is a graph traversal technique used in many applications as a building block, e.g.,~to systematically explore a search space. For modern multicore processors and as application graphs get larger, well-performing parallel algorithms are favourable. In this paper, we systematically evaluate an important class of parallel BFS algorithms and discuss programming optimization techniques for their implementation. We concentrate our discussion on level-synchronous algorithms for larger multicore and multiprocessor systems. In our results, we show that for small core counts many of these algorithms show rather similar behaviour. But, for large core counts and large graphs, there are considerable differences in performance and scalability influenced by several factors. This paper gives advice, which algorithm should be used under which circumstances.
KW  - memory bandwidth
KW  - parallel breadth-first search
KW  - data locality
KW  - BFS
KW  - NUMA
UR  - https://www.thinkmind.org/index.php?view=article&articleid=future_computing_2014_2_20_30037
SN  - 978-1-61208-339-1
SB  - 978-1-61208-339-1
SP  - 26
EP  - 31
PB  - ThinkMind
ER  -