An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances

2007 ◽  
pp. 23-35 ◽  
Author(s):  
Kamesh Madduri ◽  
David A. Bader ◽  
Jonathan W. Berry ◽  
Joseph R. Crobak
Keyword(s):  
Experimental Study ◽  
Shortest Path ◽  
Large Scale ◽  
Shortest Path Algorithm

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.

Experimental study of deformation processes in large-scale concrete structures under quasistatic loading

2020 ◽  
Vol 15 (5) ◽  
pp. 619-633
Author(s):  
Igor Shardakov ◽  
Irina Glot ◽  
Aleksey Shestakov ◽  
Roman Tsvetkov ◽  
Valeriy Yepin ◽  
...  
Keyword(s):  
Experimental Study ◽  
Large Scale ◽  
Concrete Structures ◽  
Deformation Processes ◽  
Quasistatic Loading

Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li
Keyword(s):  
Shortest Path ◽  
Operating Efficiency ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Research Focus ◽  
Network Information ◽  
The Core ◽  
Highway Network ◽  
Core Issue ◽  
Storage Structures

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.

Sign in / Sign up

Export Citation Format

Share Document