@article{MakullaBerrendorf2014,
  author    = {Matthias Makulla and Rudolf Berrendorf},
  title     = {Evaluating Parallel Breadth-First Search Algorithms for Multiprocessor Systems},
  series   = {Soft (International Journal on Advances in Software)},
  volume    = {7},
  number    = {3\&4},
  publisher = {ThinkMind},
  issn      = {1942-2628},
  pages     = {740 -- 751},
  year      = {2014},
  abstract  = {Breadth-First Search is a graph traversal technique used in many applications as a building block, e.g., to systematically explore a search space or to determine single source shortest paths in unweighted graphs. For modern multicore processors and as application graphs get larger, well-performing parallel algorithms are favorable. In this paper, we systematically evaluate an important class of parallel algorithms for this problem and discuss programming optimization techniques for their implementation on parallel systems with shared memory. 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 performance behavior. But, for large core counts and large graphs, there are considerable differences in performance and scalability influenced by several factors, including graph topology. This paper gives advice, which algorithm should be used under which circumstances.},
  language  = {en}
}