PruX: Communication Pruning of Parallel BFS in the Graph 500 Benchmark.
Menghan JiaYiming ZhangDongsheng LiSongzhu MeiPublished in: ICA3PP (1) (2018)
Keyphrases
- depth first search
- breadth first search
- search tree
- graph search
- graph structure
- parallel processing
- search space
- random walk
- graph theoretic
- directed graph
- graph representation
- communication channels
- search algorithm
- parallel computing
- bipartite graph
- communication cost
- graph model
- parallel implementation
- graph theory
- computer architecture
- distributed memory
- pruning algorithm
- decision trees
- interconnection networks
- communication overhead
- communication systems
- weighted graph
- graph matching
- connected components