Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor

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

Full description

Saved in:

Bibliographic Details
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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!