2017/04/07 by Mireya Paredes, Paredes, Mireya, Graham Riley +3
Computer Science · #Algorithms and Data Compression #Distributed #FOS: Computer and information sciences #Graph Theory and Algorithms #Parallel #Parallel Computing and Optimization Techniques #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1704.02259
openalex publication_date 2017/04/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Breadth-First Search (BFS) algorithm is an important building block for graph analysis of large datasets. The BFS parallelisation has been shown to be challenging because of its inherent characteristics, including irregular memory access patterns, data dependencies and workload imbalance, that limit its scalability. We investigate the optimisation and vectorisation of the hybrid BFS (a combination of top-down and bottom-up approaches for BFS) on the Xeon Phi, which has advanced vector processing capabilities. The results show that our new implementation improves by 33%, for a one million vertices graph, compared to the state-of-the-art.