By Topic

OpenMP Parallel Optimal Path Algorithm and its Performance Analysis

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Han Cao ; Dept. of Comput. Sci., Shaanxi Normal Univ., Xi''an, China ; Fei Wang ; Xin Fang ; Hong-lei Tu
more authors

With the research and application of intelligent transportation system, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effective optimal path algorithms for the actual transportation networks, three optimal path algorithms are chosen to be parallelized. The parallel optimal path algorithms are then implemented based on dual-core processor and the speed-up ratio and efficiency of parallel algorithms are tested and analyzed in actual Xi'an road networks with 4525 nodes and 6616 paths. The experiment results show that the parallel algorithms devised in this paper are efficient and the speed-up ratio of the three parallel algorithms are satisfied in solving optimal path problems in large scale networks.

Published in:

Software Engineering, 2009. WCSE '09. WRI World Congress on  (Volume:1 )

Date of Conference:

19-21 May 2009