NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Parallel algorithms for geometric connected component labeling on a hypercube multiprocessorDifferent algorithms for the geometric connected component labeling (GCCL) problem are defined each of which involves d stages of message passing, for a d-dimensional hypercube. The major idea is that in each stage a hypercube multiprocessor increases its knowledge of domain. The algorithms under consideration include the QUAD algorithm for small number of processors and the Overlap Quad algorithm for large number of processors, subject to the locality of the connected sets. These algorithms differ in their run time, memory requirements, and message complexity. They were implemented on an Intel iPSC2/D4/MX hypercube.
Document ID
19920068483
Document Type
Reprint (Version printed in journal)
External Source(s)
Authors
Belkhale, K. P. (IBM Corp. East Fishkill Facility, Hopwell Junction, NY, United States)
Banerjee, P. (Illinois, University Urbana, United States)
Date Acquired
August 15, 2013
Publication Date
June 1, 1992
Publication Information
Publication: IEEE Transactions on Computers
Volume: 41
Issue: 6 Ju
ISSN: 0018-9340
Subject Category
COMPUTER PROGRAMMING AND SOFTWARE
Funding Number(s)
CONTRACT_GRANT: NSF MIP-87-14646
CONTRACT_GRANT: NAG1-613
Distribution Limits
Public
Copyright
Other