Efficient parallel implementations to compute the diameter of a graph

Efficient parallel implementations to compute the diameter of a graph
复制标题

计算图直径的高效并行实现

DOI:
10.1002/cpe.5963
复制
发表时间:
2020
期刊:
Concurrency and Computation: Practice and Experience
影响因子:
--
通讯作者:
Yasuaki Ito
Yasuaki Ito
中科院分区:
--
文献类型:
--
作者:
Daisuke Takafuji;K. Nakano;Yasuaki Ito

文献摘要

参考文献

被引文献

相似文献

Floyd-Warshall算法是一种众所周知的算法,用于计算封闭的弗洛伊德·瓦尔沙尔算法的所有对节点的距离。图形处理单元(GPU)体系结构。同步。本文的主要贡献是呈现封闭的弗洛伊德 - 瓦尔肖尔算法的有效实现,该算法没有执行障碍同步,并仅调用一个内核呼叫。先前发布的SIMD功能的实现也比第二次运行的速度快有效的GPU实现了许多图表的封锁floyd -warshall算法,同时,我们的单个内核实现在使用SIMD功能方面,我们的单个内核实现的速度比多个内核快1.03-1.60倍。实现的运行速度比它快1.01-1.89倍。多层处理器上的Floyd-Warshall算法。
The Floyd‐Warshall algorithm is a well‐known algorithm to compute the distance of all pairs of nodes of a graph. The Blocked Floyd‐Warshall algorithm, a variant of the Floyd‐Warshall has been proposed to accelerate the Floyd‐Warshall algorithm by means of a graphics processing unit (GPU) architecture. The previously published GPU implementations for the Blocked Floyd‐Warshall algorithm perform many separated kernel calls for costly barrier synchronization. The main contribution of this article is to present efficient implementations of the Blocked Floyd‐Warshall algorithm, which performs no barrier synchronization and invokes only one kernel call. Experimental results using NVIDIA Tesla V100 show that our implementation runs 1.05‐1.31 times faster than the previously published one. Our implementation with SIMD functions also runs 1.00‐1.28 times faster than it. Second, we propose efficient GPU implementations to execute the Blocked Floyd‐Warshall algorithm for many graphs at the same time. From the experimental results, our single kernel implementation runs 1.03‐1.60 times faster than multiple kernel one. In terms of implementations with SIMD functions, our single kernel implementation runs 1.01‐1.89 times faster than it. We also propose the low‐latency implementations for many graphs. Finally, we implemented the parallel Floyd‐Warshall algorithm on the multicore processors.
C2CU:用于批量执行顺序算法的 CUDA C 程序生成器
DOI: 10.1002/cpe.4022
发表时间: 2017
期刊: Concurrency and Computation: Practice and Experience
影响因子: --
作者:
Daisuke Takafuji;Koji Nakano;Yasuaki Ito;Jacir Luiz Bordim
通讯作者: Jacir Luiz Bordim