• DocumentCode
    909142
  • Title

    A Comment on "Beyond Fat-tree: Unidirectional Load-Balanced Multistage Interconnection Network"

  • Author

    Antelo, Elisardo

  • Author_Institution
    Dept. of Electron. & Comput. Sci., Univ. of Santiago de Compostela, Santiago de Compostela
  • Volume
    8
  • Issue
    1
  • fYear
    2009
  • Firstpage
    33
  • Lastpage
    34
  • Abstract
    A recent work proposed to simplify fat-trees with adaptive routing by means of a load-balancing deterministic routing algorithm. The resultant network has performance figures comparable to the more complex adaptive routing fat-trees when packets need to be delivered in order. In a second work by the same authors published in IEEE CAL, they propose to simplify the fat-tree to a unidirectional multistage interconnection network (UMIN), using the same load-balancing deterministic routing algorithm. They show that comparable performance figures are achieved with much lower network complexity. In this comment we show that the proposed load-balancing deterministic routing is in fact the routing scheme used by the butterfly network. Moreover we show that the properties of the simplified UMIN network proposed by them are intrinsic to the standard butterfly and other existing UMINs.
  • Keywords
    deterministic algorithms; hypercube networks; resource allocation; adaptive routing fat-trees; butterfly network; load balancing deterministic routing algorithm; network complexity; packets; unidirectional load-balanced multistage interconnection network; unidirectional multistage interconnection network; Interconnections (Subsystems); Topology;
  • fLanguage
    English
  • Journal_Title
    Computer Architecture Letters
  • Publisher
    ieee
  • ISSN
    1556-6056
  • Type

    jour

  • DOI
    10.1109/L-CA.2009.6
  • Filename
    4967562