A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

Journal of Parallel and Distributed Computing

Volumn 65, Issue 9, 2005, Pages 994-1006

  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; Shared memory

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; TREES (MATHEMATICS);

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

ALGORITHMS;

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

References (40)

1. B. Awerbuch, and Y. Shiloach New connectivity and MSF algorithms for shuffle-exchange network and PRAM IEEE Trans. Comput. C-36 10 1987 1258 1263
2. D.A. Bader, G. Cong, A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs), in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, NM, April 2004.
3. D.A. Bader, A.K. Illendula, B.M.E. Moret, N. Weisse-Bernstein, Using PRAM algorithms on a uniform-memory-access shared-memory architecture, in: G.S. Brodal, D. Frigioni, A. Marchetti-Spaccamela (Eds.), Proceedings of the Fifth International Workshop on Algorithm Engineering (WAE 2001), Århus, Denmark, Lecture Notes in Computer Science, vol. 2141, Springer, Berlin, 2001, pp. 129-144.
4. D.A. Bader, and J. JáJá SIMPLE: a methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs) J. Parallel Distrib. Comput. 58 1 1999 92 108
5. D.A. Bader, S. Sreshta, N. Weisse-Bernstein, Evaluating arithmetic expressions using tree contraction: a fast and scalable parallel implementation for symmetric multiprocessors (SMPs), in: S. Sahni, V.K. Prasanna, U. Shukla (Eds.), Proceedings of the Ninth International Conference on High Performance Computing (HiPC 2002), Bangalore, India, Lecture Notes in Computer Science, vol. 2552, Springer, Berlin, December 2002, pp. 63-75.
6. K.L. Calvert, M.B. Doar, and E.W. Zegura Modeling internet topology IEEE Comm. 35 6 1997 160 163
7. A. Charlesworth Starfire: extending the SMP envelope IEEE Micro 18 1 1998 39 49
8. A. Charlesworth, The Sun Fireplane system interconnect, in: Proceedings of the Supercomputing (SC 2001), Denver, CO, November 2001, pp. 1-14.
9. F.Y. Chin, J. Lam, and I.-N. Chen Efficient parallel algorithms for some graph problems Comm. ACM 25 9 1982 659 665
10. K.W. Chong, and T.W. Lam Finding connected components in O (log n log log n ) time on the EREW PRAM J. Algorithms 18 1995 378 402
11. S. Chung, and A. Condon Parallel implementation of Borůvka's minimum spanning tree algorithm Proceedings of the 10th International Parallel Processing Symposium (IPPS'96) April 1996 302 315
12. R. Cole, and U. Vishkin Approximate parallel scheduling. Part II: applications to logarithmic-time optimal graph algorithms Inform. Comput. 92 1991 1 47
13. F. Dehne, and S. Götz Practical parallel algorithms for minimum spanning trees Workshop on Advances in Parallel and Distributed Systems West Lafayette, IN October 1998 366 371
14. H. Gazit An optimal randomized parallel algorithm for finding connected components in a graph SIAM J. Comput. 20 6 1991 1046 1067
15. S. Goddard, S. Kumar, and J.F. Prins Connected components algorithms for mesh-connected parallel computers S.N. Bhatt Parallel Algorithms: Third DIMACS Implementation Challenge, 17-19 October 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 30 1997 American Mathematical Society RI 43 58
16. J. Greiner 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 1994 16 25
17. S. Halperin, and U. Zwick An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM Proceedings of the Seventh Annual Symposium on Discrete Algorithms (SODA-96) 1996 438 447 Also published in J. Comput. Syst. Sci. 53(3) (1996) 395-416.
18. Y. Han, and R.A. Wagner An efficient and fast parallel-connected component algorithm J. ACM 37 3 1990 626 642
19. D.R. Helman, J. JáJá, Designing practical efficient algorithms for symmetric multiprocessors, in: Algorithm Engineering and Experimentation (ALENEX'99), Baltimore, MD, Lecture Notes in Computer Science, vol. 1619, Springer, Berlin, January 1999, pp. 37-56.
20. D.R. Helman, and J. JáJá Prefix computations on symmetric multiprocessors J. Parallel Distrib. Comput. 61 2 2001 265 278
21. D.S. Hirschberg, A.K. Chandra, and D.V. Sarwate Computing connected components on parallel computers Comm. ACM 22 8 1979 461 464
22. T.-S. Hsu, V. Ramachandran, and N. Dean Parallel implementation of algorithms for finding connected components in graphs S.N. Bhatt Parallel Algorithms: Third DIMACS Implementation Challenge, 17-19 October 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 30 1997 American Mathematical Society Providence, RI 23 41
23. K. Iwama, and Y. Kambayashi A simpler parallel algorithm for graph connectivity J. Algorithms 16 2 1994 190 217
24. J. JáJá An Introduction to Parallel Algorithms 1992 Addison-Wesley Publishing Company New York
25. 3/2|=v|) parallel time for the CREW PRAM Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science San Juan, Puerto Rico 1991 688 697
26. D.B. Johnson, and P. Metaxas 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
27. D.R. Karger, P.N. Klein, and R.E. Tarjan A randomized linear-time algorithm to find minimum spanning trees J. ACM 42 2 1995 321 328
28. P.N. Klein, and J.H. Reif An efficient parallel algorithm for planarity J. Comput. Syst. Sci. 37 2 1988 190 246
29. A. Krishnamurthy, S.S. Lumetta, D.E. Culler, and K. Yelick Connected components on distributed memory machines S.N. Bhatt Parallel Algorithms: Third DIMACS Implementation Challenge, 17-19 October 1994, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 30 1997 American Mathematical Society Providence, RI 1 21
30. C.P. Kruskal, L. Rudolph, and M. Snir Efficient parallel algorithms for graph problems Algorithmica 5 1 1990 43 64
31. K. Mehlhorn, and S. Näher The LEDA Platform of Combinatorial and Geometric Computing 1999 Cambridge University Press Cambridge
32. G.L. Miller, and V. Ramachandran Efficient parallel ear decomposition with applications January 1986 Manuscript UC Berkeley, MSRI
33. B.M.E. Moret, and 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 1994 American Mathematical Society Providence, RI 99 117
34. D. Nash, and S.N. Maheshwari Parallel algorithms for the connected components and minimal spanning trees Inform. Process. Lett. 14 1 1982 7 11
35. E. Palmer Graphical Evolution: An Introduction to the Theory of Random Graphs 1985 Wiley New York
36. C.A. Phillips Parallel graph contraction Proceedings of the First Annual Symposium on Parallel Algorithms and Architectures (SPAA-89) ACM, New York 1989 148 157
37. J.H. Reif Depth-first search is inherently sequential Inform. Process. Lett. 20 5 1985 229 234
38. J.H. Reif (Ed.), Synthesis of Parallel Algorithms, Morgan Kaufmann Publishers, Los Altos, CA, 1993.
39. J.H. Reif, Optimal parallel algorithms for integer sorting and graph connectivity, Technical Report TR-08-85, Harvard University, Boston, MA, March 1985.
40. Y. Shiloach, and U. Vishkin An O (log n ) parallel connectivity algorithm J. Algorithms 3 1 1982 57 67