Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor

• Published in: IEEE transactions on computers Vol. 41; no. 6; pp. 699 - 709
• Main Authors: Belkhale, K.P., Banerjee, P.
• Format: Journal Article
• Language: English
• Published: Legacy CDMS IEEE 01.06.1992; Institute of Electrical and Electronics Engineers
• Subjects: Algorithm design and analysis; Applied sciences; Circuits; Computer Programming And Software; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Exact sciences and technology; Hypercubes; Labeling; Merging; Message passing; NASA; Parallel algorithms; Partitioning algorithms; Software; Very large scale integration; Multiprocessor; Parallel algorithm; Partition method; Hypercube; Labelling; Computer system; Algorithm analysis
• ISSN: 0018-9340
• DOI: 10.1109/12.144622

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.< >