DocumentCode
3297407
Title
Embedding multilevel structures into massively parallel hypercubes-connection machine results for computer vision algorithms
Author
Ziavras, Sotirios G.
Author_Institution
Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA
fYear
1992
fDate
19-21 Oct 1992
Firstpage
586
Lastpage
589
Abstract
Investigates the problem of embedding multilevel structures into hypercubes. The widely used pyramid belongs to the class of multilevel structures. Although several algorithms have been proposed for embedding pyramids into hypercubes, there do not exist algorithms for embedding general multilevel structures. For the special case of the pyramid, this research carries out a comparative analysis that involves four embedding algorithms. Results for a Connection Machine system CM-2 containing 16384 processors are presented, including the general case
Keywords
computer vision; hypercube networks; parallel architectures; CM-2; Connection Machine; computer vision; connection machine; massively parallel hypercubes; multilevel structures; Algorithm design and analysis; Computational modeling; Computer vision; Hypercubes; Interleaved codes; Mirrors; Network topology; Parallel processing; Reflective binary codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
Conference_Location
McLean, VA
Print_ISBN
0-8186-2772-7
Type
conf
DOI
10.1109/FMPC.1992.234913
Filename
234913
Link To Document