Name
Abstract | ||
|---|---|---|
Large scale-free graphs are famously difficult to process efficiently: the skewed vertex degree distribution makes it difficult to obtain balanced partitioning. Our research instead aims to turn this into an advantage by partitioning the workload to match the strength of the individual computing elements in a Hybrid, GPU-accelerated architecture. As a proof of concept we focus on the direction-optimized breadth first search algorithm. We present the key graph partitioning, workload allocation, and communication strategies required for massive concurrency and good overall performance. We show that exploiting specialization enables gains as high as 2.4x in terms of time-to-solution and 2.0x in terms of energy efficiency by adding 2 GPUs to a 2 CPU-only baseline, for synthetic graphs with up to 16 Billion undirected edges as well as for large real-world graphs. We also show that, for a capped energy envelope, it is more efficient to add a GPU than an additional CPU. Finally, our performance would place us at the top of today's [Green] Graph500 challenges for Scale29 graphs. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-27308-2_20 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Computer science,Concurrency,Efficient energy use,Parallel computing,Breadth-first search,Theoretical computer science,Proof of concept,Degree (graph theory),Graph partition,Graph500,Bulk synchronous parallel,Distributed computing | Journal | 9523 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.42 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| scott sallinen | 1 | 41 | 3.01 |
| Abdullah Gharaibeh | 2 | 246 | 16.75 |
| Matei Ripeanu | 3 | 35 | 4.43 |