17117

Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches

Julian Romera
Ruprecht-Karls-Universitat Heidelberg
arXiv:1704.00513 [cs.DC], (3 Apr 2017)

@article{romera2017optimizing,

   title={Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches},

   author={Romera, Julian},

   year={2017},

   month={apr},

   archivePrefix={"arXiv"},

   primaryClass={cs.DC}

}

Download Download (PDF)   View View   Source Source   

610

views

The Breadth First Search (BFS) algorithm is the foundation and building block of many higher graph-based operations such as spanning trees, shortest paths and betweenness centrality. The importance of this algorithm increases each day due to it is a key requirement for many data structures which are becoming popular nowadays. When the BFS algorithm is parallelized by distributing the graph between several processors the interconnection network limits the performance. Hence, improvements on this area may benefit the overall performance of the algorithm. This work presents an alternative compression scheme for communications in distributed BFS processing. It focuses on BFS processors using General-Purpose Graphics Processing Units.
Rating: 2.5. From 2 votes.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: