.png){kind=icon}
返回
Solutions to the st-connectivity problem using a GPU-based distributed BFS
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2014.09.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The st-connectivity problem (ST-CON) is a decision problem that asks, for vertices s and t in a graph, if t is reachable from s. Although originally defined for directed graphs, it can also be studied on undirected graphs and used as a building block for solving more complex tasks on large scale graphs. We present solutions to ST-CON based on a high performance Breadth First Search (BFS) executed on clusters of Graphics Processing Units (GPUs) using the Nvidia CUDA platform. To measure performances, we use the number of ST-CONs per second. We present the results for two different implementations that highlight the impact of atomic operations in CUDA. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
GPU
CUDA
Graph algorithms
Distributed algorithms
Large graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容