Abstract
The embedding of one interconnection network into another is a very important issue in the design and analysis of parallel algorithms. Through such embeddings, the algorithms originally developed for one architecture can be directly mapped to another architecture. This paper describes a new embedding method, based on matrix transformations, for optimally embedding hierarchical hypercube networks (HHNs) into the hypercube (binary n-cube). Thus, this embedding method has practical importance in enhancing the capabilities and extending the usefulness of the hypercube, since hierarchical hypercube networks have proven to be very cost-effective for a wide range of applications.
Original language | English |
---|---|
Pages (from-to) | 897-902 |
Number of pages | 6 |
Journal | IEEE Transactions on Parallel and Distributed Systems |
Volume | 8 |
Issue number | 9 |
DOIs | |
Publication status | Published - 1997 |
Externally published | Yes |
Keywords
- Dilation
- Embedding
- Hierarchical networks
- Hypercube
- Interconnection networks