Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

Journal of Parallel and Distributed Computing

Volumn 66, Issue 11, 2006, Pages 1366-1378

  Bader, David A ^a   Cong, Guojing ^b  

^a Georgia Institute of Technology   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Connectivity; High performance algorithm engineering; Parallel graph algorithms

Indexed keywords

CONNECTIVITY; HIGH-PERFORMANCE ALGORITHM ENGINEERING; PARALLEL GRAPH ALGORITHMS;

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; GRAPH THEORY; MEDICAL IMAGING; PARALLEL ALGORITHMS; PROBLEM SOLVING;

STORAGE ALLOCATION (COMPUTER);

EID: 33749508859     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2006.06.001     Document Type: Article

References (38)

1. Adler M., Dittrich W., Juurlink B., Kutylowski M., and Rieping I. Communication-optimal parallel minimum spanning tree algorithms. Proceedings of the 10th Annual Symposium on Parallel Algorithms and Architectures (SPAA-98). Newport, RI (June 1998), ACM, New York 27-36
2. An L., Xiang Q.S., and Chavez S. A fast implementation of the minimum spanning tree method for phase unwrapping. IEEE Trans. Med. Imaging 19 8 (2000) 805-808
3. Bader D.A., and Cong G. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. Proceedings of International Parallel and Distributed Processing Symposium (IPDPS 2004). Santa Fe, NM (April 2004)
4. Bader D.A., and JáJá J. SIMPLE: a methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs). J. Parallel and Distributed Comput. 58 1 (1999) 92-108
5. Brinkhuis M., Meijer G.A., van Diest P.J., Schuurmans L.T., and Baak J.P. Minimum spanning tree analysis in advanced ovarian carcinoma. Anal. Quant. Cytol. Histol. 19 3 (1997) 194-201
6. C. Chen, S. Morris, Visualizing evolving networks: minimum spanning trees versus Pathfinder networks, in: IEEE Symposium on Information Visualization, Seattle, WA, October 2003, 8 pp. http://doi.ieeecomputersociety.org/10.1109/INFVIS.2003.1249010.
7. Chong K.W., Han Y., and Lam T.W. Concurrent threads and optimal parallel minimum spanning tree algorithm. J. ACM 48 (2001) 297-323
8. Chung S., and Condon A. Parallel implementation of Borůvka's minimum spanning tree algorithm. Proceedings of the 10th International Parallel Processing Symposium (IPPS'96) (April 1996) 302-315
9. Cole R., Klein P.N., and Tarjan R.E. A linear-work parallel algorithm for finding minimum spanning trees. Proceedings of the Sixth Annual Symposium on Parallel Algorithms and Architectures (SPAA-94). Newport, RI (June 1994), ACM, New York 11-15
10. Cole R., Klein P.N., and Tarjan R.E. Finding minimum spanning forests in logarithmic time and linear work using random sampling. Proceedings of the Eighth Annual Symposium on Parallel Algorithms and Architectures (SPAA-96). Newport, RI (June 1996), ACM, New York 243-250
11. F. Dehne, S. Götz, Practical parallel algorithms for minimum spanning trees, in: Workshop on Advances in Parallel and Distributed Systems, West Lafayette, IN, October 1998, pp. 366-371.
12. Dore J.C., Gilbert J., Bignon E., Crastes de Paulet A., Ojasoo T., Pons M., Raynaud J.P., and Miquel J.F. Multivariate analysis by the minimum spanning tree method of the structural determinants of diphenylethylenes and triphenylacrylonitriles implicated in estrogen receptor binding, protein kinase C activity, and MCF7 cell proliferation. J. Med. Chem. 35 3 (1992) 573-583
13. Gibbons P.B., Matias Y., and Ramachandran V. Can shared-memory model serve as a bridging model for parallel computation?. Proceedings of the Ninth Annual Symposium on Parallel Algorithms and Architectures (SPAA-97). Newport, RI (June 1997), ACM, New York 72-83
14. S. Goddard, S. Kumar, J.F. Prins, Connected components algorithms for mesh-connected parallel computers, in: S.N. Bhatt (Ed.), Parallel Algorithms: Third DIMACS Implementation Challenge, October 17-19, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, American Mathematical Society, Providence, RI, 1997, pp. 43-58.
15. Greiner J. A comparison of data-parallel algorithms for connected components. Proceedings of the Sixth Annual Symposium on Parallel Algorithms and Architectures (SPAA-94). Cape May, NJ (June 1994) 16-25
16. D.R. Helman, J. JáJá, Designing practical efficient algorithms for symmetric multiprocessors, in: Algorithm Engineering and Experimentation (ALENEX'99), Lecture Notes in Computer Science, vol. 1619, Baltimore, MD, Springer, Berlin, January 1999, pp. 37-56.
17. T.-S. Hsu, V. Ramachandran, N. Dean, Parallel implementation of algorithms for finding connected components in graphs, in: S.N. Bhatt (Ed.), Parallel Algorithms: Third DIMACS Implementation Challenge, October 17-19, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, American Mathematical Society, Providence, RI, 1997, pp. 23-41.
18. JáJá J. An Introduction to Parallel Algorithms (1992), Addison-Wesley, New York
19. Johnson D.B., and Metaxas P. A parallel algorithm for computing minimum spanning trees. Proceedings of the Fourth Annual Symposium on Parallel Algorithms and Architectures (SPAA-92). San Diego, CA (1992) 363-372
20. I. Katriel, P. Sanders, J. L. Träff, A practical minimum spanning tree algorithm using the cycle property, in: 11th Annual European Symposium on Algorithms (ESA 2003), Lecture Notes in Computer Science, vol. 2832, Budapest, Hungary, Springer, Berlin, September 2003, pp. 679-690.
21. Kayser K., Jacinto S.D., Bohm G., Frits P., Kunze W.P., Nehrlich A., and Gabius H.J. Application of computer-assisted morphometry to the analysis of prenatal development of human lung. Anat. Histol. Embryol. 26 2 (1997) 135-139
22. Kayser K., Stute H., and Tacke M. Minimum spanning tree, integrated optical density and lymph node metastasis in bronchial carcinoma. Anal. Cell Pathol. 5 4 (1993) 225-234
23. A. Krishnamurthy, S.S. Lumetta, D.E. Culler, K. Yelick, Connected components on distributed memory machines, in: S.N. Bhatt (Ed.), Parallel Algorithms: Third DIMACS Implementation Challenge, October 17-19, 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 30, American Mathematical Society, Providence, RI, 1997, pp. 1-21.
24. Maon Y., Schieber B., and Vishkin U. Parallel ear decomposition search (EDS) and st-numbering in graphs. Theoret. Comput. Sci. 47 3 (1986) 277-296
25. Matos M., Raby B.N., Zahm J.M., Polette M., Birembaut P., and Bonnet N. Cell migration and proliferation are not discriminatory factors in the in vitro sociologic behavior of bronchial epithelial cell lines. Cell Motility and the Cytoskeleton 53 1 (2002) 53-65
26. Meguerdichian S., Koushanfar F., Potkonjak M., and Srivastava M. Coverage problems in wireless ad-hoc sensor networks. Proceedings of the INFOCOM '01. Anchorage, AK (April 2001), IEEE Press, New York 1380-1387
27. Mehlhorn K., and Näher S. The LEDA Platform of Combinatorial and Geometric Computing (1999), Cambridge University Press, Cambridge
28. G.L. Miller, V. Ramachandran, Efficient parallel ear decomposition with applications, Manuscript, UC Berkeley, MSRI, January 1986.
29. B.M.E. Moret, H.D. Shapiro, An empirical assessment of algorithms for constructing a minimal spanning tree, in: DIMACS Monographs in Discrete Mathematics and Theoretical Computer Science: Computational Support for Discrete Mathematics, vol. 15, American Mathematical Society, Providence, RI, 1994, pp. 99-117.
30. Olman V., Xu D., and Xu Y. Identification of regulatory binding sites using minimum spanning trees. Proceedings of the Eighth Pacific Symposium on Biocomputing (PSB 2003). Hawaii (2003), World Scientific, Singapore 327-338
31. Park J., Penner M., and Prasanna V.K. Optimizing graph algorithms for improved cache performance. Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2002). Fort Lauderdale, FL (April 2002)
32. Pettie S., and Ramachandran V. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. SIAM J. Comput. 31 6 (2002) 1879-1895
33. C.K. Poon, V. Ramachandran, A randomized linear work EREW PRAM algorithm to find a minimum spanning forest, in: Proceedings of the Eighth International Symposium on Algorithms and Computation (ISAAC'97), Lecture Notes in Computer Science, vol. 1350, Springer, Berlin, 1997, pp. 212-222.
34. Sanders P. Random permutations on distributed, external and hierarchical memory. Inform. Process. Lett. 67 6 (1998) 305-309
35. Tarjan R.E., and Vishkin U. An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14 4 (1985) 862-874
36. Tseng Y.-C., Juang T.T.-Y., and Du M.-C. Building a multicasting tree in a high-speed network. IEEE Concurrency 6 4 (1998) 57-67
37. Vishkin U. On efficient parallel strong orientation. Inform. Process. Lett. 20 5 (1985) 235-240
38. Zheng S.Q., Lim J.S., and Iyengar S.S. Routing using implicit connection graphs. Ninth International Conference on VLSI Design: VLSI in Mobile Communication. Bangalore, India (January 1996), IEEE Computer Society Press, Silver Spring, MD