By Topic

Embedding multilevel structures into massively parallel hypercubes-connection machine results for computer vision algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ziavras, S.G. ; Dept. of Electr. & Comput. Eng., New Jersey Inst. of Technol., Newark, NJ, USA

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

Published in:

Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the

Date of Conference:

19-21 Oct 1992