Parallel All-Pairs Shortest Path Algorithm: Network Decomposition Approach

2016 ◽  
Vol 2567 (1) ◽  
pp. 95-104 ◽  
Author(s):  
Khaled Abdelghany ◽  
Hossein Hashemi ◽  
Ala Alnawaiseh
Keyword(s):  
Shortest Path ◽  
Shortest Path Algorithm ◽  
Network Decomposition ◽  
Decomposition Approach ◽  
All Pairs Shortest Path

A Parallel Calculation System for the Shortest Path in Traffic Network

2010 ◽  
Vol 143-144 ◽  
pp. 1240-1244 ◽  
Author(s):  
Lin Zhang ◽  
Zhao Sheng Yang ◽  
Hong Mei Jia ◽  
Bin Wang
Keyword(s):  
Shortest Path ◽  
Execution Time ◽  
Traffic Assignment ◽  
Dynamic Traffic Assignment ◽  
Traffic Network ◽  
Dynamic Traffic ◽  
Parallel Calculation ◽  
Network Decomposition ◽  
Decomposition Approach ◽  
Calculation System

The execution time of shortest path computing determines the efficiency and quality of dynamic traffic assignment. This paper focuses on the design of a parallel calculation system for the shortest path in traffic network aims to reduce the execution time of shortest path computing in dynamic traffic assignment. Here we mainly focus on the process of algorithm parallelization and network decomposition. As the core of the system, a two-queue parallel algorithm is designed for the shortest path in the traffic network which the recursive spectral bisection decomposition approach is employed to separate the network into several parts and the algorithm acts on every sub-network on each processor. The proposed system are experimented on real traffic network and a set of policies are employed that the number of processors is designed in each policy in the study case, and the performances of the parallel calculation system are discussed, the proposed algorithm is proved to be the efficient and effective.

Research and development of Johnson's algorithm parallel schemes in GPGPU technology

2016 ◽  
pp. 105-112
Author(s):  
S.D. Pogorilyy ◽  
◽  
M.S. Slynko ◽  
Keyword(s):  
Experimental Study ◽  
Research And Development ◽  
Shortest Path ◽  
Shortest Path Algorithm ◽  
Suggested Approach ◽  
Nvidia Cuda ◽  
Weighted Directed Graph ◽  
Improved Performance ◽  
Systems Of Algorithmic Algebras ◽  
All Pairs Shortest Path

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.

scholarly journals An all-pairs shortest path algorithm for bipartite graphs

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.

Sign in / Sign up

Export Citation Format

Share Document