• DocumentCode
    2364621
  • Title

    Effective methodology for deadlock-free minimal routing in InfiniBand networks

  • Author

    Sancho, J.C. ; Robles, A. ; Flich, J. ; López, P. ; Duato, J.

  • Author_Institution
    Dept. of Comput. Eng., Univ. Politecnica de Valencia, Spain
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    409
  • Lastpage
    418
  • Abstract
    The InfiniBand Architecture (IBA) defines a switch-based network with point-to-point links whose topology is arbitrarily established by the customer. We propose a simple and effective methodology for designing deadlock-free routing strategies that are able to route packets through minimal paths in InfiniBand networks. This methodology can meet the trade-off between network performance and the number of resources dedicated to deadlock avoidance. Evaluation results show that the resulting routing strategies significantly outperform up*/down* routing. In particular, throughput improvement ranges, on average, from 1.33 for small networks to 4.05 for large networks. Also, it is shown that just two virtual lanes and three service levels are enough to achieve more than 80% of the throughput improvement achieved by the best proposed routing strategy (the one that always provides minimal paths without limiting the number of resources).
  • Keywords
    concurrency control; packet switching; telecommunication network routing; workstation clusters; InfiniBand architecture; InfiniBand networks; NOWs; deadlock-free minimal routing; interconnection pattern; minimal paths; network performance; packet routing; point-to-point links; service levels; switch-based network; throughput improvement; up*/down* routing; virtual lanes; Computer architecture; Computer networks; Intelligent networks; Network topology; Packet switching; Quality of service; Routing; Switches; System recovery; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 2002. Proceedings. International Conference on
  • ISSN
    0190-3918
  • Print_ISBN
    0-7695-1677-7
  • Type

    conf

  • DOI
    10.1109/ICPP.2002.1040897
  • Filename
    1040897