The problem of emulating multilevel structures on hypercube supercomputers is studied in this paper. The frequently used pyramid belongs to the class of multilevel structures. Several algorithms have been published in the literature for the emulation of pyramids by hypercubes. This paper extends the most important of these algorithms to make them applicable for multilevel structures. Results for the Connection Machine system CM-2 with 16,384 processors, are presented and comparative analysis of the new algorithms is carried out. It is shown that very often higher performance can be obtained for multilevel structures other than the pyramid.
Return to the "selected publications" page