• DocumentCode
    327303
  • Title

    nD-dBPN: new self-routing permutation networks based on the de Bruijn digraphs

  • Author

    Samsudin, Azman ; Lee, Kyungsook Y.

  • Author_Institution
    Dept. of Math. & Comput. Sci., Denver Univ., CO, USA
  • fYear
    1998
  • fDate
    10-14 Aug 1998
  • Firstpage
    604
  • Lastpage
    611
  • Abstract
    A new class of self-routing permutation networks based on the de Bruijn digraphs is proposed. The new networks are modular and scalable, and have an optimal crosspoint complexity. Compared to the crossbar switches of the same size, nD-dBPN uses less cross-points, and operates faster. With its optimal configuration, the new network uses O (N log N) cross-points compared to O (N2) cross-points of the crossbar switches. The 2D-dBPN has the same crosspoint complexity as the 3-stage Clos network, but it has a constant control complexity compared to Ω(N3/2) of the Clos network
  • Keywords
    computational complexity; directed graphs; multiprocessor interconnection networks; cross-points; crossbar switches; crosspoint complexity; de Bruijn digraphs; nD-dBPN; permutation networks; self-routing permutation networks; Birth disorders; Computer science; Electronic mail; Electronic switching systems; Mathematics; Packet switching; Routing; Switches;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1998. Proceedings. 1998 International Conference on
  • Conference_Location
    Minneapolis, MN
  • ISSN
    0190-3918
  • Print_ISBN
    0-8186-8650-2
  • Type

    conf

  • DOI
    10.1109/ICPP.1998.708535
  • Filename
    708535
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=327303