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 transformations' 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.
| Original language | English |
|---|---|
| Pages (from-to) | 650-654 |
| Number of pages | 5 |
| Journal | IEEE Symposium on Parallel and Distributed Processing - Proceedings |
| Publication status | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA Duration: 15 Apr 1996 → 19 Apr 1996 |