• DocumentCode
    3034193
  • Title

    Empirical evaluation of randomly-wire multistage networks

  • Author

    Leighton, Tom ; Linsinski, D. ; Maggs, Bruce

  • Author_Institution
    Lab. for Comput. Sci., MIT, Cambridge, MA, USA
  • fYear
    1990
  • fDate
    17-19 Sep 1990
  • Firstpage
    380
  • Lastpage
    385
  • Abstract
    Experimental data are presented indicating that multistage interconnection networks with randomly positioned wires are likely to be substantially better for message routing applications than traditional multistage networks, such as the butterfly. The data are presented for a variety of routing models, including store-and-forward routing, cut-through routing, and circuit switching, as well as for scenarios in which a potentially large number of switches are faulty. In most cases, the differences are dramatic, particularly when several switches in the network are faulty. The data provide empirical confirmation of recent theoretical work
  • Keywords
    circuit layout CAD; multiprocessor interconnection networks; circuit switching; cut-through routing; message routing; multistage interconnection networks; randomly positioned wires; randomly-wire multistage networks; store-and-forward routing; Circuit faults; Contracts; Joining processes; Mathematics; Merging; Out of order; Routing; Switches; Switching circuits; Wires;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Design: VLSI in Computers and Processors, 1990. ICCD '90. Proceedings, 1990 IEEE International Conference on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-8186-2079-X
  • Type

    conf

  • DOI
    10.1109/ICCD.1990.130247
  • Filename
    130247