• DocumentCode
    3487049
  • Title

    The connection cubes: symmetric, low diameter interconnection networks with low node degree

  • Author

    Singhvi, Nitin K.

  • Author_Institution
    Dept. of Comput. Sci., State Univ. of New York, Binghamton, NY, USA
  • fYear
    1993
  • fDate
    13-16 Apr 1993
  • Firstpage
    260
  • Lastpage
    267
  • Abstract
    The enhanced connection cube or ECC and the minimal connection cube or MCC, proposed in this paper, are regular and symmetric static interconnection networks for large-scale, loosely coupled systems. The ECC connects 22n+1 processing nodes with only n+2 links per node, almost half the number used in a comparable hypercube. Yet its diameter is only n+2, almost half that of the hypercube. The MCC connects 22n+1 nodes using only n+1 links per node, has about the same diameter as a hypercube and is scalable like the hypercube. The MCC can be converted into the ECC by adding one more link per node. Both networks can emulate all the connections present in a hypercube of the same size, with no increase in routing complexity, so that typical parallel applications run on both types of CCs with the same time complexity as on a hypercube
  • Keywords
    computational complexity; hypercube networks; parallel architectures; enhanced connection cube; hypercube; low diameter interconnection networks; low node degree; minimal connection cube; routing complexity; static interconnection networks; time complexity; Broadcasting; Carbon capture and storage; Computer science; Delay systems; Hypercubes; Large-scale systems; Multiprocessor interconnection networks; Network topology; Parallel processing; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing Symposium, 1993., Proceedings of Seventh International
  • Conference_Location
    Newport, CA
  • Print_ISBN
    0-8186-3442-1
  • Type

    conf

  • DOI
    10.1109/IPPS.1993.262892
  • Filename
    262892