Parallel Breadth First Search on GPU clusters

@article{Fu2014ParallelBF,
  title={Parallel Breadth First Search on GPU clusters},
  author={Zhisong Fu and Harish Kumar Dasari and Bradley R. Bebee and Martin Berzins and Bryan B. Thompson},
  journal={2014 IEEE International Conference on Big Data (Big Data)},
  year={2014},
  pages={110-118}
}
Fast, scalable, low-cost, and low-power execution of parallel graph algorithms is important for a wide variety of commercial and public sector applications. Breadth First Search (BFS) imposes an extreme burden on memory bandwidth and network communications and has been proposed as a benchmark that may be used to evaluate current and future parallel computers. Hardware trends and manufacturing limits strongly imply that many-core devices, such as NVIDIA® GPUs and the Intel® Xeon Phi®, will… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

Topics

Statistics

01020201620172018
Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.