Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs (Extended Abstract)

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

Volumn 18, Issue , 2004, Pages 521-530

  Bader, David A ^a   Cong, Guojing ^a  

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED GRAPHS; MINIMUM SPANNING TREE (MST); SHARED MEMORY; SPARSE GRAPHS;

COMPUTATIONAL METHODS; COMPUTER NETWORKS; DATA STORAGE EQUIPMENT; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; INTEGRATED CIRCUIT LAYOUT; MEDICAL IMAGING; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES; SERVERS; TREES (MATHEMATICS); VLSI CIRCUITS; WIRELESS TELECOMMUNICATION SYSTEMS;

PARALLEL ALGORITHMS;

EID: 12444298999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

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