Solving path problems on the GPU

Parallel Computing

Volumn 36, Issue 5-6, 2010, Pages 241-253

  Buluç, Aydin ^a   Gilbert, John R ^a   Budak, Ceren ^a  

^a University of California   (United States)

Author keywords

All pairs shortest paths; Gaussian elimination; Graph algorithm; Graphical processing unit; Linear algebra; Matrix multiplication; Semiring; Shortest path

Indexed keywords

GAUSSIAN ELIMINATION; GRAPH ALGORITHM; GRAPH ALGORITHMS; GRAPHICAL PROCESSING UNITS; MATRIX MULTIPLICATION; SEMI-RING; SHORTEST PATH;

ALGEBRA; ALGORITHMS; COMPUTATION THEORY; COMPUTER GRAPHICS EQUIPMENT; GRAPH THEORY; IMAGE CODING; OPTIMIZATION; PROGRAM PROCESSORS; TELECOMMUNICATION SYSTEMS; WIRELESS SENSOR NETWORKS;

MATRIX ALGEBRA;

EID: 77953134566     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2009.12.002     Document Type: Article

References (39)

1. Bolz J., Farmer I., Grinspun E., and Schrder P. Sparse matrix solvers on the GPU: conjugate gradients and multigrid. ACM Transactions on Graphics 22 3 (2003) 917-924
2. Sengupta S., Harris M., Zhang Y., and Owens J.D. Scan primitives for GPU computing. Graphics Hardware 2007 (2007), ACM 97-106
3. Lindholm E., Nickolls J., Oberman S.F., and Montrym J. Nvidia Tesla: a unified graphics and computing architecture. IEEE Micro 28 2 (2008) 39-55
4. S. Ryoo, C.I. Rodrigues, S.S. Baghsorkhi, S.S. Stone, D.B. Kirk, W.-M.W. Hwu, Optimization principles and application performance evaluation of a multithreaded GPU using CUDA, in: PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, New York, NY, USA, 2008, pp. 73-82.
5. V. Volkov, J. Demmel, LU, QR and Cholesky Factorizations using Vector Capabilities of GPUs, Tech. Rep. UCB/EECS-2008-49, EECS Department, University of California, Berkeley, May 2008.
6. R.A. Chowdhury, V. Ramachandran, Cache-oblivious dynamic programming, in: SODA '06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm, ACM, New York, NY, USA, 2006, pp. 591-600.
7. Golub G.H., and Van Loan C.F. Matrix Computations (1996), The Johns Hopkins University Press
8. W.J. Dally, Keynote address: "Stream programming: Parallel processing made simple", in: ICPP '08: Proceedings of the International Confress on Parallel Processing, IEEE Computer Society, 2008.
9. Dongarra J.J., Du Croz J., Hammarling S., and Duff I.S. A set of level 3 basic linear algebra subprograms. ACM Transactions on Mathematical Software 16 1 (1990) 1-17
10. Elmroth E., Gustavson F., Jonsson I., and Kågström B. Recursive blocked algorithms and hybrid data structures for dense matrix library software. SIAM Review 46 1 (2004) 3-45
11. Toledo S. Locality of reference in LU decomposition with partial pivoting. SIAM Journal of Matrix Analysis and Applications 18 4 (1997) 1065-1081
12. Aho A.V., Hopcroft J.E., and Ullman J.D. The Design and Analysis of Computer Algorithms (1974), Addison-Wesley Longman, Boston, MA, USA
13. Tarjan R.E. A unified approach to path problems. Journal of the ACM 28 3 (1981) 577-593
14. Strassen V. Gaussian elimination is not optimal. Numerical Mathematics 13 (1969) 354-356
15. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, in: STOC '87: Proceedings of the 19th Annual ACM Conference on Theory of Computing, ACM Press, New York, NY, USA, 1987, pp. 1-6.
16. Fletcher J.G. A more general algorithm for computing closed semiring costs between vertices of a directed graph. Communications of the ACM 23 6 (1980) 350-351
17. S.-C. Han, F. Franchetti, M. Püschel, Program generation for the all-pairs shortest path problem, in: PACT '06: Proceedings of the 15th International Conference on Parallel Architectures and Compilation Techniques, ACM, New York, 2006, pp. 222-232.
18. Johnson D.B. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24 1 (1977) 1-13
19. Seidel R. On the all-pairs-shortest-path problem in unweighted undirected graphs. Journal of Computer and System Sciences 51 3 (1995) 400-403
20. U. Zwick, Exact and approximate distances in graphs - a survey, in: ESA '01: Proceedings of the 9th Annual European Symposium on Algorithms, Springer-Verlag, 2001, pp. 33-48.
21. D'Alberto P., and Nicolau A. R-Kleene: a high-performance divide-and-conquer algorithm for the all-pair shortest path for densely connected networks. Algorithmica 47 2 (2007) 203-213
22. Park J.-S., Penner M., and Prasanna V.K. Optimizing graph algorithms for improved cache performance. IEEE Transactions on Parallel and Distributed Systems 15 9 (2004) 769-782
23. A. Tiskin, Synchronisation-efficient parallel all-pairs shortest paths computation (work in progress), , 2004.
24. Hopcroft J.E., Motwani R., and Ullman J.D. Introduction to Automata Theory, Languages, and Computation. second ed. (2000), Addison-Wesley
25. Ullman J.D., and Yannakakis M. The input/output complexity of transitive closure. Annals of Mathematics and Artificial Intelligence 3 2-4 (1991) 331-360
26. AMD Stream Computing, .
27. NVIDIA CUDA, .
28. Gustavson F.G. Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM Journal of Research and Development 41 6 (1997) 737-756
29. NVIDIA, CUDA Programming Guide 1.1, , 2007.
30. Harris M., Sengupta S., and Owens J.D. Parallel prefix sum (scan) with CUDA. In: Nguyen H. (Ed). GPU Gems 3 (2007), Addison-Wesley
31. K. Fatahalian, J. Sugerman, P. Hanrahan, Understanding the efficiency of GPU algorithms for matrix-matrix multiplication, in: HWWS '04: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware, ACM, New York, 2004, pp. 133-137.
32. J. Jenq, S. Sahni, All pairs shortest paths on a hypercube multiprocessor, in: ICPP '87: Proceedings of the International Conference on Parallel Processing, 1987, pp. 713-716.
33. Cilk Arts, Inc., Burlington, MA, Cilk++ Programmer's Guide, available from , 2009.
34. P. Harish, P.J. Narayanan, Accelerating large graph algorithms on the GPU using CUDA, in: International Conference on High Performance Computing (HiPC 2007), 2007.
35. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34 3 (1987) 596-615
36. Feng W., Feng X., and Ge R. Green supercomputing comes of age. IT Professional 10 1 (2008) 17-23
37. A. Buluç, J.R. Gilbert, Challenges and advances in parallel sparse matrix-matrix multiplication, in: ICPP '08: Proceedings of the International Conference on Parallel Processing, Portland, Oregon, USA, 2008, pp. 503-510.
38. A. Buluç, J.R. Gilbert, On the representation and multiplication of hypersparse matrices, in: IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), 2008.
39. Siek J.G., Lee L.-Q., and Lumsdaine A. The Boost Graph Library User Guide and Reference Manual (With CD-ROM) (2001), Addison-Wesley Professional