论文标题
对平行呼吸的优化首先在分布式内存上搜索
Optimizations to the Parallel Breath First Search on Distributed Memory
论文作者
论文摘要
图形及其遍历变得越来越重要，因为它适用于数学，科学和技术的各个领域。可以将各种问题（基因组学），电气工程（通信网络），计算机科学（算法和计算）等各种问题进行建模。可以使用图表研究现实世界中的场景，包括社区的互连和相关属性。这么快，可扩展，低成本的并行图算法执行非常重要。在实现平行广度的第一次搜索图中，我们通过[2]中所述的1-D分区实现了并行的BFS算法，并通过优化本地缓冲区的通信来减少执行时间。
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.
