Kepler 架构上的并行分布式广度优先搜索
分布式、并行与集群计算
2014-12-24 v2
摘要
我们展示了基于 CUDA 的解决方案的演进版本在通过广度优先搜索探索大型图方面所获得的结果。该最新版本充分利用了 Kepler 架构的特性，并依赖于多种技术的组合，以减少 GPU 之间的通信次数和交换的数据量。最终结果是，在使用配备 4096 块 Tesla K20X GPU 的集群时，该代码每秒能够访问超过 8000 亿条边。
引用
@article{arxiv.1408.1605,
title = {Parallel Distributed Breadth First Search on the Kepler Architecture},
author = {Mauro Bisson and Massimo Bernaschi and Enrico Mastrostefano},
journal= {arXiv preprint arXiv:1408.1605},
year = {2014}
}
备注
In this revision we adopt a technique to reduce the size of exchanged messages that relies on the use of a bitmap. This change halves, by itself, the total execution time. Now the code reaches 800 GTEPS on 4096 Kepler GPUs. We also made some modifications to the Introduction and to the performance section. Added new references