A Low Communication Overhead Breadth-First Search Based on Global Bitmap

• Published in: Algorithms and Architectures for Parallel Processing Vol. 11335; pp. 114 - 129
• Main Authors: Peng, Ziwei, Lu, Yutong, Cheng, Zhiguang, Du, Yunfei
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2018; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Breadth-First Search; Global bitmap; Graph500; Hybrid approach
• ISBN: 9783030050535; 303005053X
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-05054-2_9

Breadth-First Search (BFS) is the underlying kernel algorithm for many graph applications such as social networks, medical informatics, transport systems, etc. Therefore, it has been absorbed as a core of Graph500, used to evaluate the capability of supercomputers in terms of big data processing. In this paper, we introduce into a global bitmap which is used to accelerate two approaches: the top-down and bottom-up. Specifically, the new top-down approach uses the global bitmap to indicate whether the vertices are visited or not, while the new bottom-up approach changes the frontier queue to the global bitmap to indicate whether the vertices are on the frontier. With the help of the global bitmap, the total number of communication messages produced by the BFS will be reduced significantly, and consequentially the BFS is accelerated. Meanwhile, our algorithm is optimized for storage on Knights Landing (KNL). We evaluate our proposal on both the KNL platform and the Tianhe-2 supercomputer. Experimental results demonstrate that the communication was time reduced to roughly 1/4 of the original. We obtain speedups of 2.2–3.1 compared to the top-down approach.