Concurrent threads and optimal parallel minimum spanning trees algorithm

Journal of the ACM

Volumn 48, Issue 2, 2001, Pages 297-323

  Chong, K A Wong ^a   Han, Yijie ^b   Lam, Tak Wah ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b UNIVERSITY OF MISSOURI KANSAS CITY   (United States)

Author keywords

Connected components; EREW PRAM; Minimum spanning trees; Parallel algorithms

Indexed keywords

CONNECTED COMPONENTS; EDGES; MINIMUM SPANNING TREES (MST); PARALLEL RANDOM ACCESS MACHINE (PRAM);

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; PROGRAM PROCESSORS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

PARALLEL ALGORITHMS;

EID: 0000523923     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/375827.375847     Document Type: Article

References (36)

1. 4/3. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing (El Paso, Tex., May 4-5) ACM, New York, pp. 230-239.
2. AWERBUCH, B., AND SHILOACH, Y. 1987. New connectivity and MSF algorithms for shuffle-exchange network and PRAM. IEEE Trans. Comput. 36, 1258-1263.
3. CHAZELLE, B. 1997. A faster deterministic algorithm for minimum spanning trees. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 22-31.
4. CHAZELLE, B. 2000. A minimum spanning tree algorithm with inverse-ackermann type complexity. J. ACM 47, 6 (Nov.), 1028-1047.
5. CHIN, F. Y., LAM, J., AND CHEN, I.-N. 1982. Efficient parallel algorithms for some graph problems. Commun. ACM 25, 659-665.
6. CHONG, K. W. 1996. Finding minimum spanning trees on the EREW PRAM. In Proceedings of the International Computer Symposium (Taiwan, China), pp. 7-14.
7. CHONG, K. W., AND LAM, T. W. 1993. Finding connected components in O(log n loglog n) time on the EREW PRAM. In Proceedings of the 4th Annual ACM-SLAM Symposium on Discrete Algorithms (Austin, Tex., Jan. 25-27). ACM, New York, pp. 11-20.
8. COLE, R. 1988. Parallel Merge Sort. SIAM J. Comput. 17, 770-785.
9. COLE, R., KLEIN, P. N., AND TARJAN, R. E. 1996. Finding minimum spanning forests in logarithmic time and linear work using random sampling. In Proceedings of the 8th Annual ACM Symposium on Parallel Architectures and Algorithms (Padua, Italy, June 24-26). ACM, New York, pp. 243-250.
10. COLE, R., AND VISHKIN, U. 1986. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 478-491.
11. COOK, S. A., DWORK, C., AND REISCHUK, R. 1986. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput. 15, 1, 87-97.
12. FREDMAN, M. L., AND TARJAN, R. E. 1987. Fibonacci heaps and their use in improved network optimization algorithms. J. ACM 34, 3 (July), 596-615.
13. GABOW, H., GALIL, Z., SPENCER, T., AND TARJAN, R. E. 1986. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 2, 109-122.
14. GAZIT, H. 1986. An optimal randomized parallel algorithm for finding connected components in a graph. In Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 492-501.
15. GIBBONS, P. B., MATIAS, Y., AND RAMACHANDRAN, V. 1997. Can a shared-memory model serve as a bridging model for parallel computation? In Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures (Newport, R.I., June 22-25). ACM, New York, pp. 72-83.
16. HALPERIN, S., AND ZWICK, U. 1996. Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 438-447.
17. HAN, Y., AND WAGNER, R. A. 1990. A fast and efficient parallel-connected component algorithm. J. ACM 37, 3 (July), 626-642.
18. HIRSCHBERG, D. S., CHANDRA, A. K., AND SARWATE, D. V. 1979. Computing connected components on parallel computers. Commun. ACM 22, 461-464.
19. JÁJÁ, J. 1992. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, Mass.
20. 3/2 |V|) parallel time for the CREW PRAM. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 688-697.
21. JOHNSON, D. B., AND METAXAS, P. 1992. A parallel algorithm for computing minimum spanning trees. In Proceedings of the 4th Annual ACM Symposium on Parallel Architectures and Algorithms (San Diego, Calif., June 29-July 1). ACM, New York, pp. 363-372.
22. KARGER, D. R. 1995. Random sampling in graph optimization problems. Ph.D. dissertation. Department of Computer Science, Stanford University, Stanford, Calif.
23. KARGER, D. R., KLEIN, P. N., AND TARJAN, R. E. 1995. A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42, 2 (Mar.), 321-328.
24. KARGER, D., NISAN, N., AND PARNAS, M. 1992. Fast connected components algorithms for the EREW PRAM. In Proceedings of the 4th Annual ACM Symposium on Parallel Architectures and Algorithms (San Diego, Calif., June 29-July 1). ACM, New York, pp. 373-381.
25. KARP, R. M., AND RAMACHANDRAN, V. 1990. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science vol A., van Leeuwen, J., Ed. MIT Press, Cambridge, Mass.
26. MAON, Y., SCHIEBER, B., AND VISHKIN, U. 1986. Parallel ear decomposition search (EDS) and s-t numbering in graphs. Theoret. Comput. Sci. 47, 277-298.
27. MILLER, G. L., AND RAMACHANDRAN, V. 1986. Efficient parallel ear decomposition with applications. Manuscript. MSRI, Berkeley, Calif.
28. 1.5 n) space. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 24-29.
29. PETTIE, S. 1999. Finding minimum spanning trees in O(n α(m, n)) time. UTCS Tech. Rep. TR99-23. Dept. Computer Sciences, The University of Texas at Austin, Austin, Tex.
30. PETTIE, S., AND RAMACHANDRAN, V. 1999. A randomized time-work optimal parallel algorithm for finding a minimum spanning forest. In Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science. Lecture Notes in Computer Science, vol. 1671. Springer-Verlag, New York, pp. 233-244.
31. PETTIE, S., AND RAMACHANDRAN, V. 2000. An optimal minimum spanning tree algorithm. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, New York, pp. 49-60.
32. POON, C. K., AND RAMACHANDRAN, V. 1997. A randomized linear work EREW PRAM algorithm to find a minimum spanning forest. In Proceedings of the 8th Annual International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 1350. Springer-Verlag, New York, pp. 212-222.
33. TARJAN, R. E. 1983. Structures and Network Algorithms. SIAM, Philadelphia, Pa.
34. TARJAN, R. E., AND VISHKIN, U. 1985. An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14, 862-874.
35. VALIANT, L. G. 1990. A bridging model for parallel computation. Commun. ACM 33, 8 (Aug.), 103-111.
36. VISHKIN, U. 1985. On efficient parallel strong orientation. Inf. Proc. Lett. 20, 235-240.