A fast, parallel spanning tree algorithm for symmetric multiprocessors SMPs

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

Volumn 18, Issue , 2004, Pages 501-510

  Bader, David A ^a   Cong, Guojing ^a  

^a University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SHARED MEMORY; SPANNING TREE ALGORITHM; SYMMETRIC MULTIPROCESSORS (SMP); UNIFORM MEMORY ACCESS (UMA);

CODES (SYMBOLS); COMPUTATIONAL METHODS; COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; PARALLEL ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; SUPERCOMPUTERS; TREES (MATHEMATICS);

PARALLEL PROCESSING SYSTEMS;

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

References (41)

1. B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for shuffle-exchange network and PRAM. IEEE Trans. Computers, C-36(10):1258-1263, 1987.
2. D. Bader, A. Illendula, B. M. Moret, and N. Weisse-Bernstein. Using PRAM algorithms on a uniform-memory-access shared-memory architecture. In G. Brodai, D. Frigioni, and A. Marchetti-Spaccamela, editors, Proc. 5th Int'l Workshop on Algorithm Engineering (WAE 2001), volume 2141 of Lecture Notes in Computer Science, pages 129-144, Arhus, Denmark, 2001. Springer-Verlag.
3. D. Bader, S. Sreshta, and N. Weisse-Bernstein. Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs). In S. Sahni, V. Prasanna, and U. Shukla, editors, Proc. 9th Int'l Conf. on High Performance Computing (HiPC 2002), volume 2552 of Lecture Notes in Computer Science, pages 63-75, Bangalore, India, Dec. 2002. Springer-Verlag.
4. D. A. Bader and G. Cong. A new, fast parallel spanning tree algorithm for symmetric multiprocessors (SMPs). Technical Report 03-001, Electrical and Computer Engineering Department, University of New Mexico, Mar. 2003.
5. 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.
6. K. Calvert, M. Doar, and E. Zegura. Modeling internet topology. IEEE Communications, 35(6): 160-163, 1997.
7. A. Charlesworth. Starfire: extending the SMP envelope. IEEE Micro, 18(1):39-49, 1998.
8. A. Charlesworth. The Sun Fireplane system interconnect. In Proc. Supercomputing (SC 2001), pages 1-14, Denver, CO, Nov. 2001.
9. F. Y. Chin, J. Lam, and I.-N. Chen. Efficient parallel algorithms for some graph problems. Commun. ACM, 25(9):659-665, 1982.
10. K. Chong and T. Lam. Finding connected components in O(log n log log n) time on the EREW PRAM. J. Algorithms, 18:378-402, 1995.
11. K. W. Chong, Y. Han, and T. W. Lam. Concurrent threads and optimal parallel minimum spanning tree algorithm. J. ACM, 48:297-323, 2001.
12. 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.
13. R. Cole and U. Vishkin. Approximate parallel scheduling, part II: applications to logarithmic-time optimal graph algorithms. Information and Computation, 92:1-47, 1991.
14. 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.
15. H. Gazit. An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J. Comput., 20(6):1046-1067, 1991.
16. S. Goddard, S. Kumar, and J. Prins. Connected components algorithms for mesh-connected parallel computers. 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 43-58. American Mathematical Society, 1997.
17. 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.
18. S. Halperin and U. Zwick. An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM. In Proc. 7th Ann. Symp. Discrete Algorithms (SODA-96), pages 438-447, 1996. Also published in J. Comput. Syst. Sci., 53(3):395-416, 1996.
19. S. Halperin and U. Zwick. An optimal randomised logarithmic time connectivity algorithm for the EREW PRAM. In Proc. 7th Ann. Symp. Discrete Algorithms (SODA-96), pages 438-447, 1996. Also published in J. Comput. Syst. Sci., 53(3):395-416, 1996.
20. Y. Han and R. A. Wagner. An efficient and fast parallel-connected component algorithm. J. ACM, 37(3):626-642, 1990.
21. 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.
22. D. R. Helman and J. JáJá. Prefix computations on symmetric multiprocessors. J. Parallel & Distributed Comput., 61(2):265-278, 2001.
23. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate. Computing connected components on parallel computers. Commun. ACM, 22(8):461-464, 1979.
24. 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.
25. K. Iwama and Y. Kambayashi. A simpler parallel algorithm for graph connectivity. J. Algorithms, 16(2): 190-217, 1994.
26. J. JáJá. An Introduction to Parallel Algorithms, Addison-Wesley Publishing Company, New York, 1992.
27. 3/2|v|) parallel time for the CREW PRAM. In Proc. of the 32nd Annual IEEE Symp. on Foundations of Computer Science, pages 688-697, San Juan, Puerto Rico, 1991.
28. 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.
29. D. Karger, P. Klein, and R. Tarjan. A randomized linear-time algorithm to find minimum spanning trees. J. ACM, 42(2):321-328, 1995.
30. 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.
31. C. Kruskal, L. Rudolph, and M. Snir. Efficient parallel algorithms for graph problems. Algorithmica, 5(1):43-64, 1990.
32. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
33. 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.
34. D. Nash and S. Maheshwari. Parallel algorithms for the connected components and minimal spanning trees. Information Processing Letters, 14(1):7-11, 1982.
35. E. Palmer. Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley & Sons, New York, 1985.
36. 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.
37. C. Phillips. Parallel graph contraction. In Proc. 1st Ann. Symp. Parallel Algorithms and Architectures (SPAA-89), pages 148-157. ACM, 1989.
38. J. Reif. Optimal parallel algorithms for integer sorting and graph connectivity. Technical Report TR-08-85, Harvard Univ., Boston, MA, Mar. 1985.
39. J. H. Reif. Depth-first search is inherently sequential. Information Processing Letters, 20(5):229-234, 1985.
40. J. H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann Publishers, 1993.
41. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algs., 3(1):57-67, 1982.