On Embedding Various Networks into the Hypercube Using Matrix Transformations

Authors:
Mounir Hamdi;Siang W. Song
Affiliations:
-;-
Venue:
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Year:
1996

Citing 7
Cited 1

Hypercube algorithms and implementations

SIAM Journal on Scientific and Statistical Computing
Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
On Embedding Rectangular Grids in Hypercubes

IEEE Transactions on Computers
Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Mapping pyramid algorithms into hypercubes

Journal of Parallel and Distributed Computing
Embedding shuffle networks in hypercubes

Journal of Parallel and Distributed Computing

Embedding Hierarchical Hypercube Networks into the Hypercube

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Various researchers have shown that the binary n-cube (or hypercube) can embed any r-ary m-cubes, having the same number of nodes, with dilation 1. Their construction method is primarily based on the reflected Gray code. We present a different embedding method based on matrix transformation schemes that achieves the same results. In addition, this method has a nice property that makes it suitable to be used in divide-and-conquer algorithms. Thus, it constitutes a useful tool for the design of parallel algorithms for the hypercube.