Paper Info
Title
Scalable Graph Exploration on Multicore Processors
Abstract
Many important problems in computational sciences, social network analysis, security, and business analytics, are data-intensive and lend themselves to graph-theoretical analyses. In this paper we investigate the challenges involved in exploring very large graphs by designing a breadth-first search (BFS) algorithm for advanced multi-core processors that are likely to become the building blocks of future exascale systems. Our new methodology for large-scale graph analytics combines a highlevel algorithmic design that captures the machine-independent aspects, to guarantee portability with performance to future processors, with an implementation that embeds processorspecific optimizations. We present an experimental study that uses state-of-the-art Intel Nehalem EP and EX processors and up to 64 threads in a single system. Our performance on several benchmark problems representative of the power-law graphs found in real-world problems reaches processing rates that are competitive with supercomputing results in the recent literature. In the experimental evaluation we prove that our graph exploration algorithm running on a 4-socket Nehalem EX is (1) 2.4 times faster than a Cray XMT with 128 processors when exploring a random graph with 64 million vertices and 512 millions edges, (2) capable of processing 550 million edges per second with an R-MAT graph with 200 million vertices and 1 billion edges, comparable to the performance of a similar graph on a Cray MTA-2 with 40 processors and (3) 5 times faster than 256 BlueGene/L processors on a graph with average degree 50.
Year
DOI
Venue
2010
10.1109/SC.2010.46
High Performance Computing, Networking, Storage and Analysis
Keywords
Field
DocType
random graph,scalable graph exploration,multicore processors,power-law graph,similar graph,benchmark problems representative,large-scale graph analytics,r-mat graph,million vertex,million edge,graph exploration algorithm,large graph,graph theory,multicore processing,social network analysis,computational sciences,multi core processor,algorithm design and analysis,breadth first search algorithm,synchronization,breadth first search,instruction sets,power law,algorithm design,business analytics
Graph theory,Random graph,Supercomputer,Computer science,Cray XMT,Breadth-first search,Parallel computing,Software portability,Graph500,Multi-core processor,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4244-7558-2
117
5.21
References 
Authors
13
4
Search Limit
100117
Name
Order
Citations
PageRank
Virat Agarwal124816.61
Fabrizio Petrini22050165.82
Davide Pasetto316311.77
Bader, David A.42507219.90