Enhanced GPU-based distributed breadth first search
Open Access
- 6 May 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Abstract
There is growing interest in studying large scale graphs having millions of vertices and billions of edges, up to the point that a specific benchmark, called Graph500, has been defined to measure the performance of graph algorithms on modern computing architectures. At first glance, Graphics Processing Units (GPUs) are not an ideal platform for the execution of graph algorithms that are characterized by low arithmetic intensity and irregular memory access patterns. For studying really large graphs, multiple GPUs are required to overcome the memory size limitations of a single GPU. In the present paper, we propose several techniques to minimize the communication among GPUsKeywords
This publication has 17 references indexed in Scilit:
- Traversing Trillions of Edges in Real Time: Graph Exploration on Large-Scale Parallel Machines2014
- Parallel distributed breadth first search on GPU2013
- Efficient breadth first search on multi-GPU systemsJournal of Parallel and Distributed Computing, 2013
- Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search2013
- Large-scale energy-efficient graph traversal: A path to efficient data-intensive supercomputing2012
- Highly scalable graph search for the Graph500 benchmark2012
- Efficient Parallel Graph Exploration on Multi-Core CPU and GPU2011
- Accelerating CUDA graph algorithms at maximum warp2011
- Accelerating Large Graph Algorithms on the GPU Using CUDA2008
- A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L2005