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

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