Fast minimum spanning tree for large graphs on the GPU

Proceedings of the HPG 2009: Conference on High-Performance Graphics 2009

Volumn , Issue , 2009, Pages 167-172

  Vineet, Vibhav ^a   Harish, Pawan ^a   Patidar, Suryakant ^a   Narayanan, P J ^a  

^a INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PARALLEL; DISCRETE STRUCTURE; EDGE WEIGHTS; GENERAL PURPOSE; GPU IMPLEMENTATION; GRAPH CONSTRUCTION; GRAPHICS PROCESSOR UNITS; LARGE GRAPHS; MINIMUM SPANNING TREES; RECURSIVE FORMULATION; SIMD ARCHITECTURE; UNDIRECTED GRAPH;

COMPUTER GRAPHICS EQUIPMENT; PARALLEL ALGORITHMS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS;

GRAPH THEORY;

EID: 70450194802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1572769.1572796     Document Type: Conference Paper

References (16)

1. BADER, D. A., AND CONG, G. 2005. A fast, parallel spanning tree algorithmfor symmetricmultiprocessors (SMPs). J. Parallel Distrib. Comput. 65, 9, 994-1006.
2. BADER, D. A., AND MADDURI, K., 2006. GTgraph: A synthetic graph generator suite, http://www.cc.gatech.edu/~kamesh/gtgraph/.
3. BLELLOCH, G. E. 1989. Scans as Primitive Parallel Operations. IEEE Trans. Computers 38, 11, 1526-1538.
4. BORUVKA, O. 1926. O Jistém Problému Minimální m (About a Certain Minimal Problem) (in Czech, German summary). Práce Mor. Prírodoved. Spol. v Brne III 3.
5. CHAZELLE, B. 2000. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47, 6, 1028-1047.
6. CHONG, K. W., HAN, Y., AND LAM, T. W. 2001. Concurrent threads and optimal parallel minimum spanning trees algorithm. J. ACM 48, 2, 297-323.
7. CHUNG, S., AND CONDON, A. Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm. In IPPS 1996.
8. DEHNE, F., AND GÖTZ, S. 1998. Practical Parallel Algorithms for Minimum Spanning Trees. In SRDS '98: Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems, 366.
9. DIMACS, 2006. The Ninth DIMACS challange on shortest paths http://www.dis.uniroma1.it/challenge9/.
10. DOTSENKO, Y., GOVINDARAJU, N. K., SLOAN, P.-P. J., BOYD, C., AND MANFERDELLI, J. 2008. Fast scan algorithms on graphics processors. In ICS, ACM, 205-213.
11. HARISH, P., VINEET, V., AND NARAYANAN, P. J. 2009. Large Graph Algorithms for Massively Multithreaded Architectures. Tech. Rep. IIIT/TR/2009/74.
12. KING, V., POON, C. K., RAMACHANDRAN, V., AND SINHA, S. 1997. An optimal EREW PRAM algorithm for minimum spanning tree verification. Inf. Process. Lett. 62, 3, 153-159. (Pubitemid 127416908)
13. MUNSHI, A. 2008. OpenCL: Parallel computing o the GPU and CPU. In SIGGRAPH, Tutorial.
14. PATIDAR, S., AND NARAYANAN, P. J. 2009. Scalable Split and Gather Primitives for the GPU. Tech. Rep. IIIT/TR/2009/99.
15. SENGUPTA, S., HARRIS, M., ZHANG, Y., AND OWENS, J. D. 2007. Scan primitives for gpu computing. In Graphics Hardware, 97-106.
16. SINTORN, E., AND ASSARSSON, U. 2008. Fast parallel gpusorting using a hybrid algorithm. J. Parallel Distrib. Comput. 68, 10, 1381-1388.