Scalable Single-Source Shortest Path Algorithms on Distributed Memory Systems

2018 ◽  
pp. 19-33
Author(s):  
Thap Panitanarak
Keyword(s):  
Shortest Path ◽  
Distributed Memory ◽  
Memory Systems ◽  
Single Source ◽  
Shortest Path Algorithms

scholarly journals Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems

2017 ◽  
Vol 28 (7) ◽  
pp. 2031-2045 ◽  
Author(s):  
Venkatesan T. Chakaravarthy ◽  
Fabio Checconi ◽  
Prakash Murali ◽  
Fabrizio Petrini ◽  
Yogish Sabharwal
Keyword(s):  
Shortest Path ◽  
Parallel Systems ◽  
Massively Parallel ◽  
Single Source ◽  
Massively Parallel Systems ◽  
Shortest Path Algorithms

Experimental Study of Dynamic Single-Source Shortest Path Algorithm

2011 ◽  
Vol 58-60 ◽  
pp. 1493-1498
Author(s):  
Qian Cai Xiao ◽  
Ming Qi Li ◽  
Wen Qiang Guo
Keyword(s):  
Shortest Path ◽  
Single Source ◽  
Shortest Path Algorithm ◽  
Time Efficiency ◽  
Dynamic Algorithms ◽  
Dynamic Topology ◽  
Shortest Path Algorithms ◽  
Relationship Of ◽  
The Relationship ◽  
Better Than

In this paper, software Inet 3.0 is applied to generate topology, which randomly generates dynamic topology nodes. Based on dynamic shortest path algorithms put forward by P.Narvaez, Xiaobin et al, we analyzed the time efficiency of dynamic and static shortest path algorithms, the different time efficiency inner dynamic shortest path algorithms, and the relationship of time efficiency between topology and dynamic shortest path algorithms. The result shows that Xiaobin algorithm is statistically better than Narvaez algorithm about 20-30 percent. Dynamic algorithms are not always better than static algorithms considering the amount of changed topology. Dynamic and static algorithms are roughly same when the amount of changed topology holds 10 percent. Dynamic algorithms perform better when less than 10 percent, otherwise static algorithms will be better. The time efficiency of dynamic algorithms is related to special topology.

Sign in / Sign up

Export Citation Format

Share Document