The Community for Technology Leaders
2013 IEEE International Conference on Cluster Computing (CLUSTER) (2012)
Beijing, China China
Sept. 24, 2012 to Sept. 28, 2012
ISBN: 978-1-4673-2422-9
pp: 438-448
Graph is widely used in many areas. Breadth-First Search (BFS), a key subroutine for many graph analysis algorithms, has become the primary benchmark for Graph500 ranking. Due to the high communication cost of BFS, multi-socket nodes with large memory capacity (NUMA) are supposed to reduce network pressure. However, the longer latency to remote memory may cause problem if not treated well. In this work, we first demonstrate that simply spawning and binding one MPI process for each socket can achieve the best performance for MPI/OpenMP hybrid programmed BFS algorithm, resulting in 1.53X of performance on 16 nodes. Nevertheless, we notice that one MPI process per socket may exacerbate the communication cost. We propose to share some communication data structure among the processes inside the same node, to eliminate most of the intra-node communication. To fully utilize the network bandwidth, we make all the processes in a node to perform communication simultaneously. We further adjust the granularity of a key bitmap for better cache locality to speed up the computation. With all the optimizations for NUMA, communication and computation together, 2.44X of performance is achieved on 16 nodes, which is 39.2 Billion Traversed Edges per Second for an R-MAT graph of scale 32 (4 billion vertices and 64 billion edges).
Sockets, Optimization, Bandwidth, Computer architecture, Clustering algorithms, Instruction sets, Algorithm design and analysis, Allgather, Graph, BFS, NUMA, MPI/OpenMP
Zehan Cui, Licheng Chen, Mingyu Chen, Yungang Bao, Yongbing Huang, Huiwei Lv, "Evaluation and Optimization of Breadth-First Search on NUMA Cluster", 2013 IEEE International Conference on Cluster Computing (CLUSTER), vol. 00, no. , pp. 438-448, 2012, doi:10.1109/CLUSTER.2012.29
81 ms
(Ver 3.3 (11022016))