Scientific Programming

Scientific Programming / 2013 / Article
Special Issue

Selected Papers from Super Computing 2012

View this Special Issue

Open Access

Volume 21 |Article ID 702694 | https://doi.org/10.3233/SPR-130370

Scott Beamer, Krste Asanović, David Patterson, "Direction-Optimizing Breadth-First Search", Scientific Programming, vol. 21, Article ID 702694, 12 pages, 2013. https://doi.org/10.3233/SPR-130370

Direction-Optimizing Breadth-First Search

Abstract

Breadth-First Search is an important kernel used by many graph-processing applications. In many of these emerging applications of BFS, such as analyzing social networks, the input graphs are low-diameter and scale-free. We propose a hybrid approach that is advantageous for low-diameter graphs, which combines a conventional top-down algorithm along with a novel bottom-up algorithm. The bottom-up algorithm can dramatically reduce the number of edges examined, which in turn accelerates the search as a whole. On a multi-socket server, our hybrid approach demonstrates speedups of 3.3–7.8 on a range of standard synthetic graphs and speedups of 2.4–4.6 on graphs from real social networks when compared to a strong baseline. We also typically double the performance of prior leading shared memory (multicore and GPU) implementations.

Copyright © 2013 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

 PDF Download Citation Citation
 Order printed copiesOrder
Views1135
Downloads2788
Citations

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.