Work-efficient parallel GPU methods for single-source shortest paths

Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS

Volumn , Issue , 2014, Pages 349-359

  Davidson, Andrew ^a   Baxter, Sean ^b   Garland, Michael ^b   Owens, John D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NVIDIA   (United States)

Author keywords

GPU computing; graph traversal; single source shortest paths; sparse graphs

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS; GRAPHIC METHODS; PROGRAM PROCESSORS;

GPU COMPUTING; GRAPH ALGORITHMS; GRAPH TRAVERSALS; PARALLEL METHOD; PARALLEL WORKLOADS; SCALE FREE GRAPH; SINGLE-SOURCE SHORTEST PATHS; SPARSE GRAPHS;

GRAPH THEORY;

EID: 84906653380     PISSN: 15302075     EISSN: 23321237     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2014.45     Document Type: Conference Paper

References (22)

1. A. V. Goldberg, H. Kaplan, and R. F. Werneck, "Reach for A: Efficient point-to-point shortest path algorithms." in Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX), Jan. 2006, pp. 129-143.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Second Edition. The MIT Press, Sep. 2001.
3. "The Graph 500 list," http://www.graph500.org/, Jul. 2013.
4. M. Burtscher, R. Nasre, and K. Pingali, "A quantitative study of irregular programs on GPUs," in 2012 IEEE International Symposium on Workload Characterization (IISWC), Nov. 2012, pp. 141-151.
5. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959.
6. M. L. Fredman and R. E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms," Journal of the ACM, vol. 34, no. 3, pp. 596-615, Jul. 1987.
7. J. G. Siek, L.-Q. Lee, and A. Lumsdaine, The Boost Graph Library: User Guide and Reference Manual. Addison- Wesley, Dec. 2001.
8. D. Delling, A. V. Goldberg, A. Nowatzyk, and R. F. Werneck, "PHAST: Hardware-accelerated shortest path trees," Journal of Parallel and Distributed Computing, vol. 73, pp. 940-952, Sep. 2010.
9. R. Geisberger, P. Sanders, and D. Schultes, "Better approximation of betweenness centrality," in Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX), Jan. 2008, pp. 90-100.
10. M. Kulkarni, M. Burtscher, C. Casçaval, and K. Pingali, "Lonestar: A suite of parallel irregular programs," in IEEE International Symposium on Performance Analysis of Systems and Software, Apr. 2009, pp. 65-76.
11. U. Meyer and P. Sanders, "Delta;-stepping: a parallelizable shortest path algorithm," Journal of Algorithms, vol. 49, no. 1, pp. 114-152, Oct. 2003, 1998 European Symposium on Algorithms.
12. D. L. Baggio, "GPGPU based image segmentation livewire algorithm implementation," Master's thesis, Technological Institute of Aeronautics, São José dos Campos, Brazil, 2007.
13. N. Bell and M. Garland, "Implementing sparse matrix-vector multiplication on throughput-oriented processors," in SC '09: Proceedings of the 2009 ACM/IEEE Conference on Supercomputing, Nov. 2009, pp. 18:1-18:11.
14. D. Merrill, M. Garland, and A. Grimshaw, "Scalable GPU graph traversal," in Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ser. PPoPP '12. New York, NY, USA: ACM, Feb. 2012, pp. 117-128.
15. S. Baxter, "Modern GPU library," http://www.modernGPU. com/, 2013.
16. J. Shun and G. E. Blelloch, "Ligra: a lightweight graph processing framework for shared memory," in Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ser. PPoPP '13, Feb. 2013, pp. 135-146.
17. N. Bell and J. Hoberock, "Thrust: A productivity-oriented library for CUDA," in GPU Computing Gems, Oct. 2011, vol. 2, ch. 26, pp. 359-371.
18. T. A. Davis and Y. Hu, "The University of Florida sparse matrix collection," ACM Transactions on Mathematical Software, vol. 38, no. 1, pp. 1:1-1:25, Dec. 2011.
19. "DIMACS implementation challenge - shortest paths," http: //www.dis.uniroma1.it/challenge9/download.shtml, Jul. 2013.
20. "Yahoo labs dataset selections," http://webscope.sandbox. yahoo.com/, Jul. 2013.
21. D. Nguyen, A. Lenharth, and K. Pingali, "A lightweight infrastructure for graph analytics," in Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, ser. SOSP '13, Nov. 2013, pp. 456-471.
22. Q. Hou, X. Sun, K. Zhou, C. Lauterbach, and D. Manocha, "Memory-scalable GPU spatial hierarchy construction," IEEE Transactions on Visualization and Computer Graphics, vol. 17, no. 4, pp. 466-474, Apr. 2011.