Skip to main navigation Skip to search Skip to main content

On embedding various networks into the hypercube using matrix transformations

  • Mounir Hamdi*
  • , Siang W. Song
  • *Corresponding author for this work
  • Hong Kong University of Science and Technology

Research output: Contribution to journalConference articlepeer-review

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 languageEnglish
Pages (from-to)650-654
Number of pages5
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
Publication statusPublished - 1996
Externally publishedYes
EventProceedings of the 1996 10th International Parallel Processing Symposium - Honolulu, HI, USA
Duration: 15 Apr 199619 Apr 1996

Fingerprint

Dive into the research topics of 'On embedding various networks into the hypercube using matrix transformations'. Together they form a unique fingerprint.

Cite this