Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor
- 1 June 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (6) , 699-709
- https://doi.org/10.1109/12.144622
Abstract
Parallel algorithms for the geometric connected component labeling (GCCL) problem on a hypercube multiprocessor can be designed by dividing the domain, consisting of a number of rectangles, into regions using a slice or rectangular partitioning scheme. Each processor in the hypercube is assigned one partition. The processor determines the connected sets of rectangles in its partition. The connected sets at different processors have to then be combined across processors into globally connected sets. This merging problem is defined as the GCCL problem. Different algorithms for the GCCL problem are presented. Each of the algorithms involves d stages of message passing, for a d-dimensional hypercube. The basic idea in these algorithms is that in each stage a processor increases its knowledge of the domain. The algorithms described in this paper differ in their run time, memory requirements, and message complexity. These algorithms have been implemented on an Intel iPSC2/D4/MX hypercube.Keywords
This publication has 9 references indexed in Scilit:
- Component Labeling Algorithms on an Intel iPSC/2 HypercubePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Parallel algorithms for geometric connected component labeling on a hypercube multiprocessorIEEE Transactions on Computers, 1992
- Parallel algorithms for VLSI circuit extractionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Hypercube and shuffle-exchange algorithms for image component labelingJournal of Algorithms, 1989
- Multigrid Algorithms on the Hypercube MultiprocessorIEEE Transactions on Computers, 1986
- Optimal BPC Permutations on a Cube Connected SIMD ComputerIEEE Transactions on Computers, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerSIAM Journal on Computing, 1980
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975