An experimental study of parallel biconnected components algorithms on symmetric multiprocessors (SMPs)

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages

  Cong, Guojing ^a   Bader, David A ^b  

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

^b University of New Mexico   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT-TOLERANT NETWORK DESIGN; GRAPH PLANARITY TESTING; SPANNING TREE; SYMMETRIC MULTIPROCESSOR (SMP);

ASYMPTOTIC STABILITY; COMPUTATION THEORY; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; PARALLEL ALGORITHMS; PROBLEM SOLVING; SORTING; SUBROUTINES; TREES (MATHEMATICS);

MULTIPROCESSING SYSTEMS;

EID: 33746279468     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.100     Document Type: Conference Paper

References (22)

1. B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for shuffle-exchange network and PRAM. IEEE Transactions on Computers, C-36(10): 1258-1263, 1987.
2. 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.
3. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, Apr. 2004.
4. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, Apr. 2004.
5. K. Chong and T. Lam. Approximating biconnectivity in parallel. Algorithmica, 21:395-410, 1998.
6. G. Cong and D. A. Bader. The Euler tour technique and parallel rooted spanning tree. In Proc. Int'l Conf. on Parallel Processing (ICPP), pages 448-457, Montreal, Canada, Aug. 2004.
7. D. Eckstein. BFS and biconnectivity. Technical Report 79-11, Dept. of Computer Science, Iowa State Univ. of Science and Technology, Ames, Iowa, 1979.
8. 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.
9. D. R. Helman and J. JáJá. Prefix computations on symmetric multiprocessors. Journal of Parallel and Distributed Computing, 61(2):265-278, 2001.
10. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate. Computing connected components on parallel computers. Commununications of the ACM, 22(8):461-464, 1979.
11. T. Hsu and V. Ramachandran. On finding a smallest augmentation tobiconnect a graph. SIAM J. Computing, 22(5):889-912, 1993.
12. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York, 1992.
13. S. Khuller and U. Vishkin. Biconnectivity approximations and graph carvings. Journal of the ACM, 41(2):214-235, 1994.
14. Y. Liang, S. Dhall, and S. Lakshmivarahan. Efficient parallel algorithms for finding biconnected components of some intersection graphs. In Proc. of the 19th Annual Conf. on Computer Science, pages 48-52, San Antonio, TX, 1991.
15. E. Palmer. Graphical Evolution: An Introduction to the Theory of Random Graphs. John Wiley & Sons, New York, 1985.
16. R. Read. Teaching graph theory to a computer. In W. Tutte, editor, Proc. 3rd Waterloo Conf. on Combinatorics, pages 161-173, Waterloo, Canada, May 1969.
17. C. Savage and J. JáJá. Fast, efficient parallel algorithms for some graph problems. SIAM J. Computing, 10(4):682-691, 1981.
18. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algs., 3(1):57-67, 1982.
19. R. Tarjan. Depth-first search and linear graph algorithms. SIAM J. Comput., 1(2):146-160, 1972.
20. R. Tarjan and U. Vishkin. An efficient parallel biconnectivityalgorithm. SIAM J. Computing, 14(4):862-874, 1985.
21. Y. Tsin and F. Chin. Efficient parallel algorithms for a class of graph theoretic problems. SIAM J. on Comput., 13(3):580-599, 1984.
22. J. Woo and S. Sahni. Load balancing on a hypercube. In Proc. 5th Int'l Parallel Processing Symp., pages 525-530, Anaheim, CA, Apr. 1991. IEEE Computer Society Press.