• DocumentCode
    935166
  • Title

    Unidirectional cube connected cycles

  • Author

    Bhattacharya, S. ; Choi, Y.-H. ; Tsai, W.T.

  • Author_Institution
    Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
  • Volume
    140
  • Issue
    4
  • fYear
    1993
  • fDate
    7/1/1993 12:00:00 AM
  • Firstpage
    191
  • Lastpage
    195
  • Abstract
    Cube connected cycles (CCC), a popular and layout-efficient alternative to the hypercube, uses duplex dimensional links. The paper proposes a variant of the CCC interconnection using simplex dimensional links. Usage of simplex links (instead of duplex) is shown to have design advantages. Cost-performance comparison of the proposed ´directed cube connected cycles´ (DCCC) structure with bidirectional CCC is shown. DCCC layout is compared with CCC layout and a routing algorithm for DCCC is proposed. A method for porting CCC algorithms to DCCC is provided, and the extent of slowdown is evaluated. DCCC can embed a loop with unit dilation and unit expansion.
  • Keywords
    hypercube networks; parallel processing; duplex dimensional links; interconnection; layout-efficient alternative; routing algorithm; simplex links; unidirectional cube-connected cycles; unit dilation; unit expansion;
  • fLanguage
    English
  • Journal_Title
    Computers and Digital Techniques, IEE Proceedings E
  • Publisher
    iet
  • ISSN
    0143-7062
  • Type

    jour

  • Filename
    232035