• DocumentCode
    758628
  • Title

    Embedding star networks into hypercubes

  • Author

    Bettayeb, Saïd ; Cong, Bin ; Girou, Mike ; Sudborough, I. Hal

  • Author_Institution
    Dept. of Comput. Sci., Arkansas Univ., Fayetteville, AR, USA
  • Volume
    45
  • Issue
    2
  • fYear
    1996
  • fDate
    2/1/1996 12:00:00 AM
  • Firstpage
    186
  • Lastpage
    194
  • Abstract
    The star interconnection network has recently been suggested as an alternative to the hypercube. As hypercubes are often viewed as universal and capable of simulating other architectures efficiently, we investigate embeddings of star network into hypercubes. Our embeddings exhibit a marked trade off between dilation and expansion. For the n dimensional star network we exhibit: (1) a dilation N-1 embedding of S n into Hn, where N=[log2(n!)]; (2) a dilation 2(d+1) embedding of Sn into H2d+n-1 where d=[log2([n/2]!)]; (3) a dilation 2d+2i embedding of S(2i m) into H(2id+i2im-2i+1) where d=[log2 (m!)]; (4) a dilation L embedding of Sn into Hd , where L=1+[log2(n!)], and d=(n-1)L; (5) a dilation (k+1)(k+2)/2 embedding of Sn into H(n(k+1)-2k+1+1) where k=[log2(n-1)]; (6) a dilation 3 embedding of S2k+1 into H(2k2+k); and (7) a dilation 4 embedding of S3k+2 into H(3k2+3k+1). Some of the embeddings are in fact optimum, in both dilation and expansion for small values of n. We also show that the embedding of Sn into its optimum hypercube requires dilation Ω(log2 n)
  • Keywords
    graph theory; multiprocessor interconnection networks; dilation embedding; hypercubes; n dimensional star network; optimum hypercube; star interconnection network; star network embedding; Computer networks; Computer science; Concurrent computing; Genetic mutations; Hypercubes; Multiprocessor interconnection networks;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.485371
  • Filename
    485371