Year: 2013
Type: article
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.
Source: Scientific Programming
DOI: 10.1155/2013/702694
Authors: Scott Beamer, Krste Asanović, David Patterson
Institution: University of California, Berkeley
Language: English
Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,000
Awards: G1432640103, G1438692918, G1548290836, G1718716571, G1774612391, G2201851983, G2854725079, G3097756225, G4106444755, G4265195855, G4356405740, G4516064663, G4681881679, G5241095268, G5546740229, G5616020913, G5706129643, G6128679436, G6418351505, G6564841137, G6629330525, G6852785104, G7662048646, G7869868410, G8045692143, G8325766496, G8591053924, G8840554483
OpenAlex ID: W3013652274
