A fast GPU algorithm for graph connectivity

Proceedings of the 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum, IPDPSW 2010

Volumn , Issue , 2010, Pages

  Soman, Jyothish ^a   Kishore, Kothapalli ^a   Narayanan, P J ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

Connected components; GPGPU; GPU; Irregular algorithms

Indexed keywords

COMPUTATIONAL POWER; CONNECTED COMPONENT; CONNECTED COMPONENTS; DATA LEVEL; DATA PARALLEL ALGORITHMS; FUNCTIONAL LEVELS; GENERAL PURPOSE PROGRAMMING; GPU ALGORITHMS; GRAPH CONNECTIVITY; GRAPHICS PROCESSING UNIT; IRREGULAR DATA; OPTIMIZED IMPLEMENTATION; PRAM ALGORITHMS; RANDOM EDGES; SPEED-UPS;

DISTRIBUTED PARAMETER NETWORKS; PARALLEL ALGORITHMS; PROGRAM PROCESSORS;

COMPUTER GRAPHICS EQUIPMENT;

EID: 77954046544     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2010.5470817     Document Type: Conference Paper

References (27)

1. AWERBUCH, B., AND SHILOACH, Y. New connectivity and msf algorithms for ultracomputer and pram. In ICPP (1983), pp. 175-179.
2. BACKSTROM, L., HUTTENLOCHER, D., KLEINBERG, J., AND LAN, X. Group formation in large social networks: membership, growth, and evolution. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006), ACM, p. 54.
3. BADER, D., AND MADDURI, K. GTgraph: A suite of synthetic graph generators. url: http://wwwstatic. cc. gatech. edu/kamesh.
4. BADER, D. A., AND CONG, G. A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). Journal of Parallel and Distributed Computing 65, 9 (2005), 994-1006.
5. BUCK, I. GPU Computing with NVIDIA CUDA. In SIGGRAPH '07: ACM SIGGRAPH 2007 courses, 2007.
6. CHAKRABARTI, D., ZHAN, Y., AND FALOUTSOS, C. RMAT: A recursive model for graph mining. In SIAM Data Mining (2004), vol. 6.
7. CORMEN, T., LEISERSON, C., RIVEST, R., AND STEIN, C. Introduction to algorithms, 1990.
8. DOTSENKO, Y., GOVINDARAJU, N., SLOAN, P., BOYD, C., AND MANFERDELLI, J. Fast scan algorithms on graphics processors. In In Proceedings of ICS (2008), pp. 205-213.
9. GREGOR, D., AND LUMSDAINE, A. Lifting sequential graph algorithms for distributed-memory parallel computation. In Proceedings of the OOPSLA (2005), vol. 40, ACM New York, NY, USA, pp. 423-437.
10. GREINER, J. A comparison of parallel algorithms for connected components. In Symposium on Parallel Algorithms and Architectures (1994), Press, pp. 16-25.
11. HARISH, P., AND NARAYANAN, P. J. Accelerating Large Graph Algorithms on the GPU using CUDA. In Proc. of HiPC (2007).
12. HARRIS, M., OWENS, J., SENGUPTA, S., ZHANG, Y., AND DAVIDSON, A. Cudpp: Cuda data parallel primitives library. http://gpgpu.org/developer/cudpp, 2008.
13. HIRSCHBERG, D. S. Parallel algorithms for the transitive closure and the connected components problem. In Proc. of the ACM STOC (1976), pp. 55-57.
14. HIRSCHBERG, D. S., CHANDRA, A. K., AND SARWATE, D. V. Computing connected components in parallel computers. Communications of the ACM 22, 8 (1979), 461-464.
15. HSU, T., RAMACHANDRAN, V., AND DEAN, N. Parallel implementation of algorithms for finding connected components in graphs. Parallel algorithms: third DIMACS implementation challenge, October 17-19, 1994, 20.
16. JAJA, J. An Introduction to Parallel Algorithms. Addison Wesley, 1992.
17. LESKOVEC, J., KLEINBERG, J., AND FALOUTSOS, C. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proceedings of ACM SIGKDD (New York, NY, USA, 2005), ACM, pp. 177-187.
18. MÉNDEZ-LOJO, M., NGUYEN, D., PROUNTZOS, D., SUI, X., HASSAAN, M. A., KULKARNI, M., BURTSCHER, M., AND PINGALI, K. Structure-driven optimizations for amorphous data-parallel programs. In PPoPP '10: Proceedings of the 15th ACM SIGPLAN symposium on Principles and practice of parallel computing (2010), ACM, pp. 3-14.
19. MOUNT, D., AND ARYA, S. ANN: A library for approximate nearest neighbor searching. In CGC 2nd Annual Fall Workshop on Computational Geometry (1997).
20. NVIDIA, C. Cuda: Compute unified device architecture programming guide. Technical report, NVIDIA, 2007.
21. REHMAN, M. S., KOTHAPALLI, K., AND NARAYANAN, P. J. Fast and Scalable List Ranking on the GPU. In In Proceedings of ICS (2009), pp. 152-160.
22. SCARPAZZA, D. P., VILLA, O., AND PETRINI, F. Efficient breadth-first search on the cell/be processor. IEEE Transactions on Parallel and Distributed Systems 19, 10 (2008), 1381-1395.
23. SENGUPTA, S., HARRIS, M., ZHANG, Y., AND OWENS, J. D. Scan primitives for gpu computing. In Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS Symposium on Graphics Hardware (2007), pp. 97-106.
24. SHILOACH, Y., AND VISHKIN, U. An O(log n) parallel connectivity algorithm. Journal of Algorithms 3, 1 (1982), 57-67.
25. VINEET, V., HARISH, P. K., PATIDAR, S., AND NARAYANAN, P. J. Fast minimum spanning tree for large graphs on the gpu. In In Proc. of High Performance Graphics (2009).
26. VINEET, V., AND NARAYANAN, P. J. CUDA Cuts: Fast Graph Cuts on the GPU. In Proceedings of the CVPR Workshop on Visual Computer Vision on GPUs (2008).
27. YOO, A., CHOW, E., HENDERSON, K., MCLENDON, W., HENDRICKSON, B., AND CATALYUREK, U. A scalable distributed parallel breadth-first search algorithm on Blue-Gene/L. In Proceedings of ICS (2005), IEEE Computer Society, p. 25.