Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses/Dissertations

1993

Electrical and Computer Engineering

Hypercube networks (Computer networks)

Articles 1 - 2 of 2

Full-Text Articles in Engineering

Multilevel Embeddings For Massively-Parallel Hypercubes, Devenkuma P. Shah May 1993

Multilevel Embeddings For Massively-Parallel Hypercubes, Devenkuma P. Shah

Theses

Hierarchically structured arrays of processors have widely been used in the low and intermediate phases of image processing and computer vision. Since the pyramid structure efficiently supports local and global operations extensively required by these phases, it has been widely used for relevant algorithms. Multilevel systems keep all the advantages of the pyramid structure while providing a general hierarchical structure that is easier to be used for the development of several algorithms and may also provide higher performance.

Although the cost of pyramid machines may be tremendously high, they have limited applications. In contrast, the hypercube network is widely used …


Performance Analysis Of Pyramid Mapping Algorithms For The Hypercube, Jing-Chiou Liou Jan 1993

Performance Analysis Of Pyramid Mapping Algorithms For The Hypercube, Jing-Chiou Liou

Theses

Comparative performance analysis of algorithms that map pyramids and multilevel structures onto the hypercube are presented. The pyramid structure is appropriate for low-level and intermediate-level computer vision algorithms. It is not only efficient for the support of both local and global operations but also capable of supporting the implementation of multilevel solvers. Nevertheless, pyramids lack the capability of efficient implementation of the majority of scientific algorithms and their cost may become unacceptably high. On a different horizon, hypercube machines have widely been used in the field of parallel computing due to their small diameter, high degree of fault tolerance, and …