GPU Parallelization of All-Pairs-Shortest-Path Algorithm in Low-Degree Unweighted Regular Graph

Johnson’s all pairs shortest path algorithm application in an edge weighted, directed graph is considered. Its formalization in terms of Glushkov’s modified systems of algorithmic algebras was made. The expediency of using GPGPU technology to accelerate the algorithm is proved. A number of schemas of parallel algorithm optimized for using in GPGPU were obtained. Suggested approach to the implementation of the schemes obtained using computing architecture NVIDIA CUDA. An experimental study of improved performance by using GPU for computations was made.

Download Full-text

GPU implementation of all pairs shortest path algorithm for graphs using triangular matrix method

2016 Eighth International Conference on Advanced Computing (ICoAC) ◽

10.1109/icoac.2017.7951773 ◽

2017 ◽

Cited By ~ 1

Author(s):

S. Umamaheswari ◽

G. Abisheik

Keyword(s):

Shortest Path ◽

Matrix Method ◽

Triangular Matrix ◽

Shortest Path Algorithm ◽

All Pairs Shortest Path ◽

Gpu Implementation

Download Full-text

A supernodal all-pairs shortest path algorithm

Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming ◽

10.1145/3332466.3374533 ◽

2020 ◽

Author(s):

Piyush Sao ◽

Ramakrishnan Kannan ◽

Prasun Gera ◽

Richard Vuduc

Keyword(s):

Shortest Path ◽

Shortest Path Algorithm ◽

All Pairs Shortest Path

Download Full-text

An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$

SIAM Journal on Computing ◽

10.1137/0216065 ◽

1987 ◽

Vol 16 (6) ◽

pp. 1023-1031 ◽

Cited By ~ 43

Author(s):

Alistair Moffat ◽

Tadao Takaoka

Keyword(s):

Shortest Path ◽

Shortest Path Algorithm ◽

Expected Time ◽

All Pairs Shortest Path

Download Full-text

Sentinel-1 TOPS co-registration over low-coherence areas and its application to velocity estimation using the all pairs shortest path algorithm

Journal of Geodesy ◽

10.1007/s00190-020-01432-1 ◽

2020 ◽

Vol 94 (10) ◽

Author(s):

Mi Jiang

Keyword(s):

Shortest Path ◽

Velocity Estimation ◽

Shortest Path Algorithm ◽

Low Coherence ◽

All Pairs Shortest Path

Download Full-text

An all-pairs shortest path algorithm for bipartite graphs

Open Computer Science ◽

10.2478/s13537-013-0110-4 ◽

2013 ◽

Vol 3 (4) ◽

Author(s):

Svetlana Torgasin ◽

Karl-Heinz Zimmermann

Keyword(s):

Shortest Path ◽

Time Complexity ◽

Shortest Paths ◽

Distance Matrix ◽

Bipartite Graphs ◽

Matrix Product ◽

Complex Structures ◽

Shortest Path Algorithm ◽

Order Of Magnitude ◽

All Pairs Shortest Path

AbstractBipartite graphs are widely used for modeling of complex structures in biology, engineering, and computer science. The search for shortest paths in such structures is a highly demanded procedure that requires optimization. This paper presents a variant of the all-pairs shortest path algorithm for bipartite graphs. The method is based on the distance matrix product and improves the general algorithm by exploiting the graph topology. The space complexity is reduced by a factor of at least four and the time complexity decreased by almost an order of magnitude when compared with the basic APSP algorithm.

Download Full-text