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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computers Jg. 41; H. 6; S. 699 - 709
Hauptverfasser:	Belkhale, K.P., Banerjee, P.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Legacy CDMS IEEE 01.06.1992 Institute of Electrical and Electronics Engineers
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!