Designing efficient many-core parallel algorithms for all-pairs shortest-paths using CUDA

ITNG2010 - 7th International Conference on Information Technology: New Generations

Volumn , Issue , 2010, Pages 7-12

  Tran, Quoc Nam ^a  

^a LAMAR UNIVERSITY   (United States)

Author keywords

Graph algorithms; Multi core; Multi threaded algorithms

Indexed keywords

DESKTOP COMPUTER; FINE-GRAINED PARALLELISM; FUNDAMENTAL PROBLEM; GLOBAL COMMUNICATION; GRAPH ALGORITHMS; INTERNET NODES; LARGE GRAPHS; MANY-CORE; MULTI CORE; MULTI-THREADED ALGORITHMS; ON CHIPS; PERFORMANCE BENEFITS; SHARED MEMORIES; SPEED-UPS;

BIOINFORMATICS; COMMUNICATION; FLOCCULATION; INFORMATION TECHNOLOGY; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

PROGRAM PROCESSORS;

EID: 77955283421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITNG.2010.230     Document Type: Conference Paper

References (16)

1. G. J. Katz and J. T. Kider, "All-pairs shortest-paths for large graphs on the gpu," in Graphics Hardware (D. Luebke and J. D. Owens, eds.), 2008.
2. U. BONDHUGULA, A. DEVULAPALLI, J. FERNANDO, P. WYCKOFF, and P. SADAYAPPAN, "Parallel fpga - based all-pairs shortest-paths in a directed graph," in Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium, 2006.
3. S.-C. HAN, F. FRANCHETTI, and M. PUESCHEL, "Program generation for the all-pairs shortest path problem," 2006.
4. S.-C. Han and S.-C. Kang, "Optimizing all pairs shortest path algorithm using vector instructions," 2005.
5. P. Harish and P. J. Narayanan, "Accelerating large graph algorithms on the gpu using cuda," in High Performance Computing (2007), vol. 4873 of Lecture Notes in Computer Science, Springer.
6. S. SUBRAMANIAN, R. TAMASSIA, and S. J. VITTER, "An efficient parallel algorithm for shortest paths in planar layered digraphs." Tech. rep., Durham, NC, USA, 1993.
7. G. VENKATARAMAN, S. SAHNI, and S. MUKHOPADHYAYA, "A blocked all-pairs shortest-paths algorithm," J. Exp. Algorithmics, 2003.
8. E. Lawler, Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, 1976.
9. E. Lindholm, J. Nickolls, S. Oberman, and J. Montrym, "Nvidia tesla: A unified graphics and computing architecture," IEEE Micro, vol. 28, no. 2, 2008.
10. J. Nickolls, I. Buck, M. Garland, and K. Skadron, "Scalable parallel programming with cuda," Queue, vol. 6, no. 2, pp. 40-53.
11. NVIDIA Corporation, NVIDIA CUDA Programming Guide, June 2008. version 2.0.
12. J. Krüger and R. Westermann, "Linear algebra operators for gpu implementation of numerical algorithms," ACM Transactions on Graphics, vol. 22, no. 3, pp. 908-916, 2003.
13. Y. Zhao, Y. Han, Z. Fan, F. Qiu, Y.-C. Kuo, A. E. Kaufman, and K. Mueller, "Visual simulation of heat shimmering and mirage," IEEE Transactions on Visualization and Computer Graphics, vol. 13, no. 1, pp. 179-189, 2007.
14. Z. Fan, F. Qiu, A. Kaufman, and S. Yoakum-Stover, "Gpu cluster for high performance computing," in Proceedings of the 2004 ACM/IEEE conference on Supercomputing SC'04, IEEE, 2004.
15. S. Warshall, "A theorem on boolean matrices," Journal of the ACM, vol. 9, no. 1, pp. 11-12, 1962.
16. R. Floyd, "Algorithm 97 (shortest path)," Communications of the ACM, vol. 5, no. 6, p. 345, 1962.