PHAST: Hardware-accelerated shortest path trees

Journal of Parallel and Distributed Computing

Volumn 73, Issue 7, 2013, Pages 940-952

  Delling, Daniel ^a   Goldberg, Andrew V ^a   Nowatzyk, Andreas ^a   Werneck, Renato F ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

GPU; High performance computing; Route planning; Shortest paths

Indexed keywords

DIJKSTRA'S ALGORITHMS; GPU; HARDWARE-ACCELERATED; HIGH PERFORMANCE COMPUTING; ROUTE PLANNING; SHORTEST PATH; SINGLE-SOURCE SHORTEST PATHS; THREE ORDERS OF MAGNITUDE;

ALGORITHMS;

GRAPH THEORY;

EID: 84879125071     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2012.02.007     Document Type: Article

References (39)

1. I. Abraham, D. Delling, A. Fiat, A.V. Goldberg, and R.F. Werneck VC-dimension and shortest path algorithms Proceedings of the 38th International Colloquium on Automata, Languages, and Programming ICALP'11 Lecture Notes in Computer Science vol. 6755 2011 Springer 690 699
2. I. Abraham, D. Delling, A.V. Goldberg, and R.F. Werneck A hub-based labeling algorithm for shortest paths on road networks P.M. Pardalos, S. Rebennack, Proceedings of the 10th International Symposium on Experimental Algorithms SEA'11 Lecture Notes in Computer Science vol. 6630 2011 Springer 230 241
3. I. Abraham, A. Fiat, A.V. Goldberg, R.F. Werneck, Highway dimension, shortest paths, and provably efficient algorithms, in: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'10, pp. 782-793.
4. J.M. Anthonisse, The rush in a directed graph, Technical Report BN 9/71, Stichting Mathematisch Centrum, 2e Boerhaavestraat 49 Amsterdam, 1971.
5. H. Bast, S. Funke, D. Matijevic, P. Sanders, and D. Schultes In transit to constant shortest-path queries in road networks Proceedings of the 9th Workshop on Algorithm Engineering and Experiments ALENEX'07 2007 SIAM 46 59 (Pubitemid 47267202)
6. R. Bauer, and D. Delling SHARC: fast and robust unidirectional routing ACM Journal of Experimental Algorithmics 14 2009 1 29 Special Section on Selected Papers from ALENEX 2008
7. R. Bauer, D. Delling, P. Sanders, D. Schieferdecker, D. Schultes, and D. Wagner Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm ACM Journal of Experimental Algorithmics 15 2010 1 31 Special Section devoted to WEA'08
8. U. Brandes A faster algorithm for betweenness centrality Journal of Mathematical Sociology 25 2001 163 177 (Pubitemid 33398479)
9. G.B. Dantzig Linear Programming and Extensions 1962 Princeton University Press
10. D. Delling, A.V. Goldberg, A. Nowatzyk, and R.F. Werneck PHAST: hardware-accelerated shortest path trees 25th International Parallel and Distributed Processing Symposium IPDPS'11 2011 IEEE Computer Society 921 931
11. D. Delling, A.V. Goldberg, T. Pajor, and R.F. Werneck Customizable route planning P.M. Pardalos, S. Rebennack, Proceedings of the 10th International Symposium on Experimental Algorithms SEA'11 Lecture Notes in Computer Science vol. 6630 2011 Springer 376 387
12. D. Delling, A.V. Goldberg, I. Razenshteyn, and R.F. Werneck Graph partitioning with natural cuts 25th International Parallel and Distributed Processing Symposium IPDPS'11 2011 IEEE Computer Society 1135 1146
13. D. Delling, A.V. Goldberg, and R.F. Werneck Faster batched shortest paths in road networks Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, ATMOS'11 OpenAccess Series in Informatics (OASIcs) vol. 20 2011 52 63
14. D. Delling, P. Sanders, D. Schultes, and D. Wagner Engineering route planning algorithms J. Lerner, D. Wagner, K. Zweig, Algorithmics of Large and Complex Networks vol. 5515 2009 Springer 117 139
15. C. Demetrescu, A.V. Goldberg, and D.S. Johnson The Shortest Path Problem: Ninth DIMACS Implementation Challenge DIMACS Book vol. 74 2009 American Mathematical Society
16. E.V. Denardo, and B.L. Fox Shortest-route methods: 1. Reaching, pruning, and buckets Operations Research 27 1979 161 186
17. R.B. Dial Algorithm 360: shortest-path forest with topological ordering [H] Communications of the ACM 12 1969 632 633
18. E.W. Dijkstra A note on two problems in connexion with graphs Numerische Mathematik 1 1959 269 271
19. M.L. Fredman, and R.E. Tarjan Fibonacci heaps and their uses in improved network optimization algorithms Journal of the ACM 34 1987 596 615
20. L.C. Freeman A set of measures of centrality based upon betweeness Sociometry 40 1977 35 41
21. R. Geisberger, P. Sanders, and D. Schultes Better approximation of betweenness centrality I. Munro, D. Wagner, Proceedings of the 10th Workshop on Algorithm Engineering and Experiments ALENEX'08 2008 SIAM 90 100
22. R. Geisberger, P. Sanders, D. Schultes, and D. Delling Contraction hierarchies: faster and simpler hierarchical routing in road networks C.C. McGeoch, Proceedings of the 7th International Workshop on Experimental Algorithms WEA'08 2008 Springer 319 333 vol. 5038
23. A.V. Goldberg A practical shortest path algorithm with linear expected time SIAM Journal on Computing 37 2008 1637 1655
24. A.V. Goldberg, H. Kaplan, and R.F. Werneck Reach for A*: shortest path algorithms with preprocessing C. Demetrescu, A.V. Goldberg, D.S. Johnson, The Shortest Path Problem: Ninth DIMACS Implementation Challenge DIMACS Book vol. 74 2009 American Mathematical Society 93 139
25. R.J. Gutman Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks 2004 SIAM pp. 100-111
26. M. Hilger, E. Köhler, R.H. Möhring, and H. Schilling Fast point-to-point shortest path computations with arc-flags C. Demetrescu, A.V. Goldberg, D.S. Johnson, The Shortest Path Problem: Ninth DIMACS Implementation Challenge DIMACS Book vol. 74 2009 American Mathematical Society 41 72
27. J. JaJa Introduction to Parallel Algorithms 1992 Addison-Wesley
28. D.B. Johnson Efficient algorithms for shortest paths in sparse networks Journal of the ACM 24 1977 1 13
29. G. Karypis, and G. Kumar A fast and highly quality multilevel scheme for partitioning irregular graphs SIAM Journal on Scientific Computing 20 1999 359 392 (Pubitemid 128689516)
30. U. Lauther An experimental evaluation of point-to-point shortest path calculation on roadnetworks with precalculated edge-flags C. Demetrescu, A.V. Goldberg, D.S. Johnson, The Shortest Path Problem: Ninth DIMACS Implementation Challenge DIMACS Book vol. 74 2009 American Mathematical Society 19 40
31. K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak Parallel shortest path algorithms for solving large-scale instances C. Demetrescu, A.V. Goldberg, D.S. Johnson, The Shortest Path Problem: Ninth DIMACS Implementation Challenge DIMACS Book vol. 74 2009 American Mathematical Society 249 290
32. U. Meyer, and P. Sanders Δ-stepping: a parallelizable shortest path algorithm Journal of Algorithms 49 2003 114 152
33. V. Osipov, and P. Sanders n-level graph partitioning Proceedings of the 18th Annual European Symposium on Algorithms ESA'10 Lecture Notes in Computer Science vol. 6346 2010 Springer 278 289
34. J.D. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Krüger, A. Lefohn, and T.J. Purcell A survey of general-purpose computation on graphics hardware Computer Graphics Forum 26 2007 80 113 (Pubitemid 46481097)
35. F. Pellegrini, and J. Roman SCOTCH: a software package for static mapping by dual recursive bipartitioning of process and architecture graphs High-Performance Computing and Networking Lecture Notes in Computer Science vol. 1067 1996 Springer 493 498 (Pubitemid 126064089)
36. PTV AG - planung transport verkehr, 1979. http://www.ptv.de.
37. P. Sanders, D. Schultes, and C. Vetter Mobile route planning Proceedings of the 16th Annual European Symposium on Algorithms ESA'08 Lecture Notes in Computer Science vol. 5193 2008 Springer 732 743
38. US Census Bureau, UA census 2000 TIGER/Line files, 2002.
39. H. Yanagisawa A multi-source label-correcting algorithm for the all-pairs shortest paths problem 24th International Parallel and Distributed Processing Symposium IPDPS'10 2010 IEEE Computer Society 1 10.