Communications of the ACM - Special section on computer architecture
Constructing a perfect matching is in random NC
Combinatorica
Topological Properties of Hypercubes
IEEE Transactions on Computers
On Embedding Rectangular Grids in Hypercubes
IEEE Transactions on Computers
Embedding meshes in Boolean cubes by graph decomposition
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Embedding of grids into optimal hypercubes
SIAM Journal on Computing
Embedding Grids into Hypercubes
AWOC '88 Proceedings of the 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Optimal Simulation of Full Binary Trees on Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The authors parallelize the embedding strategy for mapping any two-dimensional grid into its optimal hypercube with minimal dilation. The parallelization allows each hypercube node to independently determine, in constant time, which grid node it will simulate and the communication paths it will take to reach the hypercube nodes that simulate its grid-neighbors. The paths between grid-neighbors are chosen in such a way as to curb the congestion at each hypercube node and across each hypercube edge. Explicity, the node congestion for the embedding is at most 6, one above optimal, while the edge congestion is at most 5.