DocumentCode
503817
Title
OpenMP Parallel Optimal Path Algorithm and its Performance Analysis
Author
Cao, Han ; Wang, Fei ; Fang, Xin ; Tu, Hong-lei ; Shi, Jun
Author_Institution
Dept. of Comput. Sci., Shaanxi Normal Univ., Xi´´an, China
Volume
1
fYear
2009
fDate
19-21 May 2009
Firstpage
61
Lastpage
66
Abstract
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.
Keywords
application program interfaces; automated highways; graph theory; multi-threading; optimisation; parallel algorithms; transportation; Dijkstra algorithm; OpenMP parallel optimal path algorithm; Xi´an road network; dual-core processor; intelligent transportation system; large scale transportation network; multithreading; performance analysis; speed-up ratio; Algorithm design and analysis; Application software; Concurrent computing; Distributed computing; Dynamic scheduling; Intelligent transportation systems; Parallel algorithms; Performance analysis; Processor scheduling; Yarn; A* algorithm; Dijkstra algorithm; multi-core; openMP; parallel algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Software Engineering, 2009. WCSE '09. WRI World Congress on
Conference_Location
Xiamen
Print_ISBN
978-0-7695-3570-8
Type
conf
DOI
10.1109/WCSE.2009.107
Filename
5318935
Link To Document