A comparison of parallel algorithms for connected components

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1994

Volumn , Issue , 1994, Pages 16-25

  Greiner, John ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

ASYMPTOTIC COMPLEXITY; CONNECTED COMPONENT; HYBRID ALGORITHMS; IMPROVE PERFORMANCE; PHILLIPS; RANDOMIZED CONTRACTION;

OPTIMIZATION;

EID: 0012999647     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181014.181021     Document Type: Conference Paper

References (27)

1. A. Agrawal, L. Nekludova, and W. Lim. A parallel O(log n) algorithm for finding connected components in planar images. Technical Report TMC-122, Thinking Machines Corporation, Feb. 1987.
2. B. Awerbuch and Y. Shiloach. New connectivity and MSF algorithms for Ultracomputer and PRAM. In Proceedings of the International Conference on Parallel Processing, pages 175-179, 1983.
3. G. E. Blelloch. Scans as primitive parallel operations. IEEE Transactions on Computers, C-38(1):1526-1538, Nov. 1989.
4. G. E. Blelloch. NESL: A nested data-parallel language (version 2.6). Technical Report CMU-CS-93-129, Carnegie Mellon University, Apr. 1993.
5. G. E. Blelloch and J. C. Hardwick. Class notes: Programming parallel algorithms cs 15-840b (fall 1992). Technical Report CMU-CS-93-115, Carnegie Mellon University, Feb. 1993.
6. K. W. Chong and T. W. Lam. Findings connected components in O(log n log log n) time on EREW PRAM. In 4th ACM-SIAM Symposium on Discrete Algorithms, pages 11-20, 1993.
7. P. D. Coddington and C. F. Baillie. Parallel cluster algorithms. Nuclear Physics B, Proceedings Supplements, 20:76-79, 1991.
8. H. G. Evertz. Vectorized cluster search. Nuclear Physics B, Proceedings Supplements, pages 620-622, 1992.
9. H. Gazit. An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J. Comput., 20(6), Dec. 1991.
10. J. Greiner. A comparison of data-parallel algorithms for connected components. Technical Report CMU-CS-93-191, Carnegie Mellon University, Aug. 1993.
11. J. Greiner and G. E. Blelloch. Data-parallel connected components algorithms. To appear in High Performance Computing, ed. Gary Sabot.
12. S. Hambrusch and L. TeWinkel. A study of connected component labeling algorithms on the MPP. In 3rd International Conference on Supercomputing, volume 1, pages 477-483, May 1988.
13. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate. Computing connected components on parallel computers. Commun. ACM, 22(8):461-464, 1979.
14. D. B. Johnson and P. Metaxas. Connected components in O(log3/2n) parallel time for the CREW PRAM. In 32nd IEEE Annual Symposium on Foundations of Computer Science, pages 688-697, 1991.
15. D. R. Karger, N. Nisan, and M. Parnas. Fast connected components algorithm for the EREW PRAM. In 4th Symposium on Parallel Algorithms and Architectures, pages 373-381, 1992.
16. W. Lim. Fast algorithms for labeling connected components in 2-D arrays. Technical Report TMC-125, Thinking Machines Corporation, Nov. 1987.
17. W. Lim, A. Agrawal, and L. Nekludova. A fast parallel algorithm for labeling connected components in image arrays. Technical Report TMC-124, Thinking Machines Corporation, Apr. 1987.
18. H. Mino. A vectorized algorithm for cluster formation in the Swendsen-Wang dynamics. Computer Physics Communications, 66:25-30, 1991.
19. P. M. Pardalos and C. S. Rentala. Computational aspects of a parallel algorithm to find the connected components of a graph. Technical Report CS-89-01, Pennsylvania State University Department of Computer Science, 1989.
20. C. A. Phillips. Parallel graph contraction. In Symposium on Parallel Algorithms and Architectures, pages 148-157, June 1989.
21. J. H. Reif. Optimal parallel algorithms for integer sorting and graph connectivity. Technical Report TR-08-85, Harvard University, Mar. 1985.
22. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. Journal of Algorithms, 3:57-67, 1982.
23. R. H. Swendsen and J.-S. Wang. Nonuniversal critical dynamics in Monte Carlo simulations. Physical Review Letters, 58(2):86-88, Jan. 1987.
24. D. Talmor. Personal communication. 1991.
25. J. Woo and S. Sahni. Hypercube computing: Connected components. Journal of Supercomputing, 3:209234, 1989.
26. X. D. Yang. An improved algorithm for labeling connected components in a binary image. Technical Report 89-981, Cornell University, Mar. 1989.
27. M. Zagha. Personal communication. Feb. 1994.