Scalable parallel minimum spanning forest computation

ACM SIGPLAN Notices

Volumn 47, Issue 8, 2012, Pages 205-214

  Nobari, Sadegh ^a   Cao, Thanh Tung ^a   Karras, Panagiotis ^b   Bressan, Stéphane ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

GPU; Minimum spanning forest; Parallel graph algorithms

Indexed keywords

EXPERIMENTAL STUDIES; GPU; GRAPH ALGORITHMS; MINIMUM SPANNING FORESTS; PARALLEL GRAPH ALGORITHMS; PARALLEL PROCESSING; PRIM'S ALGORITHM; UNDIRECTED WEIGHTED GRAPHS;

PARALLEL PROCESSING SYSTEMS;

ALGORITHMS;

EID: 84878556805     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2370036.2145842     Document Type: Conference Paper

References (35)

1. Boost C++ graph library. http://www.boost.org.
2. CUDA Zone: Toolkit & SDK. http://developer.nvidia.com/what-cuda.
3. CUDPP. http://cudpp.googlecode.com.
4. The Ninth DIMACS challenge on shortest paths. http://www.dis.uniroma1.it/ ~challenge9/.
5. GTgraph - A suite of synthetic random graph generators. https://sdm.lbl.gov/kamesh/software/GTgraph/.
6. Stanford large network dataset collection. http://snap.stanford.edu/data.
7. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In IPDPS, 2004.
8. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. JPDC, 66(11):1366-1378, 2006.
9. O. Boruvka. O jistém problému minimálniḿ (about a certain minimal problem). Práce mor. prírodoved. spol. v Brne III, pages 37-58, 1926.
10. J. Carle and D. Simplot-Ryl. Energy-efficient area monitoring for sensor networks. Computer, 37(2):40-46, 2004.
11. S. Chung and A. Condon. Parallel implementation of boruvka's minimum spanning tree algorithm. Parallel Processing Symposium, International, 0:302, 1996.
12. J. Cong, L. He, C.-K. Koh, and P. H. Madden. Performance optimization of VLSI interconnect layout. 21(1-2):1-94, 1996.
13. T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson. Introduction to algorithms. MIT Press, third edition, 2009. ISBN 0070131511.
14. F. Dehne and S. Götz. Practical parallel algorithms for minimum spanning trees. In SRDS, 1998.
15. N. K. Govindaraju, B. Lloyd, W. Wang, M. Lin, and D. Manocha. Fast computation of database operations using graphics processors. In SIGMOD, 2004.
16. N. K. Govindaraju, J. Gray, R. Kumar, and D. Manocha. GPUTera-Sort: high performance graphics co-processor sorting for large database management. In SIGMOD, 2006.
17. E. Horowitz and S. Sahni. Fundamentals of computer algorithms. Potomac, Md., Computer Science Press, 1978.
18. J. Joseph B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., 7:48-50, 1956.
19. S. Kang and D. A. Bader. An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. In PPoPP, 2009.
20. J. Kleinberg and Éva Tardos. The minimum spanning tree problem. In Algorithm Design. Pearson/Addison-Wesley, Boston, 2006.
21. E. S. Larsen and D. McAllister. Fast matrix multiplies using graphics hardware. In Supercomputing, 2001.
22. X.-Y. Li, Y. Wang, and W.-Z. Song. Applications of k-local mst for topology control and broadcasting in wireless ad hoc networks. IEEE TPDS, 15(12):1057-1069, 2004.
23. W. B. March, P. Ram, and A. G. Gray. Fast euclidean minimum spanning tree: algorithm, analysis, and applications. In KDD, 2010.
24. B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimal spanning tree. In DIMACS Monographs, 1994.
25. S. Nobari, X. Lu, P. Karras, and S. Bressan. Fast random graph generation. In EDBT, 2011.
26. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
27. P.W. Rafael C. Gonzalez. Digital Image Processing. Addison-Wesley, 1987.
28. N. Satish, M. Harris, and M. Garland. Designing efficient sorting algorithms for manycore GPUs. In IPDPS, 2009.
29. S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens. Scan primitives for GPU computing. In Graphics Hardware, 2007.
30. R. E. Tarjan. Data structures and network algorithms. Society for Industrial and Applied Mathematics, Philadelphia, 1983.
31. V. Vineet, P. Harish, S. Patidar, and P. J. Narayanan. Fast minimum spanning tree for large graphs on the gpu. In HPG, 2009.
32. X. Wang, X. Wang, and D. Mitchell Wilkes. A divide-and-conquer approach for minimum spanning tree-based clustering. IEEE TKDE, 21 (7):945-958, 2009.
33. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, (393):440-442, 1998.
34. Y. Xu, V. Olman, and D. Xu. Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics, 18(4):536-545(10), 2002.
35. C. Zhong, D. Miao, and R. Wang. A graph-theoretical clustering method based on two rounds of minimum spanning trees. Pattern Recogn., 43(3):752-766, 2010.