A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
PHAST: Hardware-Accelerated Shortest Path Trees
2011
2011 IEEE International Parallel & Distributed Processing Symposium
We present a novel algorithm to solve the non-negative single-source shortest path problem on road networks and graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from a given source in the graph with essentially a linear sweep over all vertices. Because this sweep is independent of the source, we are able to reorder vertices in advance to exploit locality. Moreover, our algorithm takes advantage of features of modern CPU architectures, such as
doi:10.1109/ipdps.2011.89
dblp:conf/ipps/DellingGNW11
fatcat:63iaqz3ulzalza2m42nuct27me