文件名称：High-Performance and Scalable GPU Graph Traversal
文件大小：3.72MB
文件格式：PDF
更新时间：2021-07-27 04:16:47
gpu BFS
graph processing， 高性能计算。 Breadth-First Search (BFS) is a core primitive for graph traversal and a basis for many higher-level graph analysis algorithms. It is also representative of a class of parallel computations whose memory accesses and work distribution are both irregular and data dependent. Recent work has demonstrated the plausibility of GPU sparse graph traversal, but has tended to focus on asymptotically inefficient algorithms that perform poorly on graphs with nontrivial diameter.