IEICE Electronics Express
Online ISSN : 1349-2543
LETTER
Fast bidirectional shortest path on GPU
Lalinthip TangjittaweechaiMongkol EkpanyapongThaisiri WatewaiKrit AthikulwongseSung Kyu LimAdriano Tavares
Author information
JOURNALS FREE ACCESS

2016 Volume 13 Issue 6 Pages 20160036

Details
Abstract

The bidirectional shortest path problem has important applications in VLSI floor planning and other areas. We introduce a new algorithm to solve bidirectional shortest path problems using parallel architectures provided by general purpose computing on graphics processing units. The algorithm performs parallel searches from the source and sink using Dijkstra’s classic approach modified with pruning and early termination. We achieve substantial speedup over a parallel method that performs a single parallel search on the GPGPU from the source to all other nodes but early terminates when the shortest path to the specified target node is found. Experimental results demonstrate a speedup of nearly 2× over the parallel method that performs a parallel search from the source with early termination on the GPGPU.

Information related to the author
© 2016 by The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top