Graphs and their traversal is becoming significant as it is applicable to various areas of mathematics, science and technology. Various problems in fields as varied as biochemistry (genomics), electrical engineering (communication networks), computer science (algorithms and computation) can be modeled as Graph problems. Real world scenarios including communities their interconnections and related properties can be studied using graphs. So fast, scalable, low-cost execution of parallel graph algorithms is very important. In this implementation of parallel breadth first search of graphs, we implemented Parallel BFS algorithm with 1-D partitioning of graph as described in [2] and have reduced execution time by optimizing communication for local buffers.
@article{arxiv.2003.04826,
title = {Optimizations to the Parallel Breath First Search on Distributed Memory},
author = {Anuj Sharma and Syed Mohammed Arshad Zaidi},
journal= {arXiv preprint arXiv:2003.04826},
year = {2020}
}