John Greiner  Home/Search
Context Related
| cmu.edu/~scandal/p...MUCS93191.ps.gz cmu.edu/project/sc...CMUCS93191.ps.Z cmu.edu/usr/anon/199...CMUCS93191.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~scandal/papers/ (more) From: cmu.edu/People/clamen/repo...1993 Homepages: J.Greiner |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a pragmatic comparison of three parallel algorithms for finding connected components, together with optimizations on these algorithms. Those being compared are two similar algorithms by Awerbuch and Shiloach [2] and by Shiloach and Vishkin [19] and a randomized contraction algorithm by Blelloch [7], based on algorithms by Reif [18] and Phillips [17]. Major improvements are given for the first two which significantly reduces the super-linear component of their work... (Update)
Context of citations to this paper: More
...2.2. 4 SVM Algorithms Several CRCW PRAM connected components algorithms on the scan vector model have been designed for the SVM by Greiner [11]. Blelloch has described a randomised algorithm for the SVM [2] These algorithms require O(lg n) steps and O(m lg n) work. To the...
.... sample would include (Levialdi, 1972) Lim, 1987) Lim et al. 1987) Agrawal and Nekludova, 1987) Bader and JaJa, 1994) and (Johl, 1994) For a comparative survey, see (Greiner, 1993). Serial algorithms remain of interest for implementation on sequential hardware....
Cited by: More
User's Manual (For - Version Guy Blelloch (1995) (Correct)
Practical Parallel Divide-and-Conquer Algorithms - Hardwick (1997) (Correct)
A Parallel Algorithm for Connected Components On Distributed.. - Bus, Tvrdik (2001) (Correct)
Similar documents (at the sentence level):
9.8%: A Comparison of Parallel Algorithms for Connected Components - Greiner (1994) (Correct)
Active bibliography (related documents): More All
1.0: Connected Components in Binary Images - Foltz (1997) (Correct)
0.6: Connected Components Algorithms For Mesh-Connected.. - Goddard, Kumar, Prins (1995) (Correct)
0.3: Towards Modeling the Performance of a Fast Connected.. - Steven Lumetta (Correct)
Similar documents based on text: More All
0.1: Translating an Existing Scientific Application from C to.. - Chaney, Crowl (1993) (Correct)
0.1: Implementation of a Portable Nested Data-Parallel Language - Blelloch (1994) (Correct)
0.1: NESL User's Manual (For NESL Version 3.1) - Blelloch, Sipelstein, Hardwick, .. (1995) (Correct)
Related documents from co-citation: More All
9: Parallel algorithms for shared-memory machines (context) - Karp, Ramachandran - 1990
9: An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
8: A bridging model for parallel computation (context) - Valiant - 1990
BibTeX entry: (Update)
J. Greiner. A comparison of data-parallel algorithms for connected components. In Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pages 16--25, June 1994. http://citeseer.ist.psu.edu/article/greiner94comparison.html More
@inproceedings{ john94comparison,
author = "Greiner, John",
title = "{A} {C}omparison of {D}ata-{P}arallel {A}lgorithms for {C}onnected {C}omponents",
booktitle = "Proceedings Symposium on Parallel Algorithms and Architectures",
month = "June",
pages = "16--25",
year = "94",
url = "citeseer.ist.psu.edu/article/greiner94comparison.html" }
Citations (may not include all citations):206 Vector Models for Data-Parallel Computing (context) - Guy - 1990
166 NESL: A Nested Data-Parallel Language - Guy - 1992
77 Parallel Connectivity Algorithm (context) - Yossi, Uzi et al. - 1982
28 An Optimal Randomized Parallel Algorithm for Finding Connect.. (context) - Hillel - 1991
27 New Connectivity and MSF Algorithms for Ultracomputer and PR.. (context) - Awerbuch, Shiloach - 1983
16 Optimal parallel algorithms on planar graphs (context) - Hagerup - 1990
11 Linear-processor NC algorithms for planar directed graphs (context) - Ming-Ying, Gregory - 1990
10 Hypercube computing: Connected components - Jinwoon, Sartaj - 1988
9 Parallel Graph Contraction (context) - Cynthia - 1989
9 An efficient and fast parallel-connected component algorithm - Han, Wagner - 1990
6 A fast parallel algorithm for labeling connected components .. (context) - Willie, Ajit et al. - 1987
5 Optimal Parallel Algorithms for Integer Sorting and Graph Co.. (context) - John - 1985
4 Parallel graph algorithms for hypercube computers (context) - Das, Deo et al. - 1990
4 A study of connected component labeling algorithms on the MP.. (context) - Susanne, Lynn - 1988
4 algorithm for finding connected components in planar images (context) - Ajit, Lena et al. - 1987
3 Fast algorithms for labeling connected components in 2-D arr.. (context) - Willie - 1987
3 An improved algorithm for labeling connected components in a.. (context) - Xue - 1989
2 Computational aspects of a parallel algorithm to find the co.. (context) - Panos, Rentala - 1989
2 Data-Parallel Connected Components Algorithms (context) - John, Guy
2 Unpublished CVL code (context) - Guy - 1990
1 An efficient connected components algorithm on a mesh-connec.. (context) - Gopalakrishnan, Ramakrishnan et al. - 1987
1 Design of fast connected components hardware (context) - Xue - 1988
1 Jian-Sheng Nonuniversal Critical Dynamics in Monte Carlo Sim.. (context) - Robert, Wang - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~scandal/papers/): More
Collection-Oriented Languages - Sipelstein (1991) (Correct)
Cvl: A C Vector Library - Manual Version 2 - Blelloch, Chatterjee, Hardwick, .. (1993) (Correct)
A Provable Time and Space Efficient Implementation of NESL - Blelloch, Greiner (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC