Issue No. 06 - June (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.144622
<p>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.</p>
parallel algorithms; hypercube multiprocessor; geometric connected component labeling; merging problem; run time; memory requirements; complexity; computational geometry; hypercube networks; parallel algorithms.
P. Banerjee and K. Belkhale, "Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor," in IEEE Transactions on Computers, vol. 41, no. , pp. 699-709, 1992.