scholarly journals Parallel implementation of bisector epsilon-approximation shortest path algorithm for concurrent queries

2005 ◽  
Author(s):  
Hua Ye
Keyword(s):  
Shortest Path ◽  
Parallel Implementation ◽  
Shortest Path Algorithm

Parallel Implementation of the Shortest Path Algorithm on FPGA

2008 ◽  
Author(s):  
Ivan Fernandez ◽  
Javier Castillo ◽  
Cesar Pedraza ◽  
Carlos Sanchez ◽  
Jose Ignacio Martinez
Keyword(s):  
Shortest Path ◽  
Parallel Implementation ◽  
Shortest Path Algorithm

Parallel Implementation of Single-Source Shortest Path Algorithm Based on Haloop

2012 ◽  
Vol 220-223 ◽  
pp. 2428-2432 ◽  
Author(s):  
Yuan Sheng Lou ◽  
Wen Yuan Zhang ◽  
Feng Xu ◽  
Yu Wang ◽  
Sheng Chen
Keyword(s):  
Shortest Path ◽  
Parallel Implementation ◽  
Program Execution ◽  
Single Source ◽  
Shortest Path Algorithm ◽  
Typical Problem ◽  
Mapreduce Framework ◽  
Programming Framework ◽  
Wide Range ◽  
Hadoop Framework

As a typical problem of graph theory, Single-Source Shortest Path(SSSP) has a wide range of applications and research. The traditional MapReduce framework such as Hadoop has been applied to SSSP problem. However, in this way, it may need writing and reading the disk frequently, transmitting data largely, beacuse of SSSP’s iterative. Haloop is a parallel programming framework which makes an improvement based on Hadoop framework, and adapts itself to iterative programming. Hence, this article represents the SSSP problem with an iterative way firstly, and then we put forward the implementation mechanism of SSSP algorithm based on Haloop. Though testing and analyzing, the implementation based on Haloop obviously improves the efficiency of program execution, compared with the traditional realization mechanism.

scholarly journals A Review: Parallel Implementation of Shortest path Algorithm on GPGPU

IJARCCE ◽  
2017 ◽  
Vol 6 (5) ◽  
pp. 345-348
Author(s):  
Avadhoot K. Katkar ◽  
Dr. Kulkarni D. B.
Keyword(s):  
Shortest Path ◽  
Parallel Implementation ◽  
Shortest Path Algorithm

Algorithm 1015

2021 ◽  
Vol 47 (2) ◽  
pp. 1-27
Author(s):  
Stefan Guthe ◽  
Daniel Thuerck
Keyword(s):  
Shortest Path ◽  
Assignment Problem ◽  
Parallel Implementation ◽  
Shortest Path Algorithm ◽  
Cost Matrix ◽  
The Past ◽  
Path Search ◽  
Dual Variables ◽  
The Cost ◽  
Real World Problems

We present a new algorithm for solving the dense linear (sum) assignment problem and an efficient, parallel implementation that is based on the successive shortest path algorithm. More specifically, we introduce the well-known epsilon scaling approach used in the Auction algorithm to approximate the dual variables of the successive shortest path algorithm prior to solving the assignment problem to limit the complexity of the path search. This improves the runtime by several orders of magnitude for hard-to-solve real-world problems, making the runtime virtually independent of how hard the assignment is to find. In addition, our approach allows for using accelerators and/or external compute resources to calculate individual rows of the cost matrix. This enables us to solve problems that are larger than what has been reported in the past, including the ability to efficiently solve problems whose cost matrix exceeds the available systems memory. To our knowledge, this is the first implementation that is able to solve problems with more than one trillion arcs in less than 100 hours on a single machine.

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