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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on computers Ročník 41; číslo 6; s. 699 - 709
Hlavní autori:	Belkhale, K.P., Banerjee, P.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Legacy CDMS IEEE 01.06.1992 Institute of Electrical and Electronics Engineers
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!