Academic
Publications
Deadlock-Free Routing in InfiniBand through Destination Renaming

Deadlock-Free Routing in InfiniBand through Destination Renaming,10.1109/ICPP.2001.952089,Pedro López,Jose Flich,José Duato

Deadlock-Free Routing in InfiniBand through Destination Renaming   (Citations: 33)
BibTex | RIS | RefWorks Download
The InfiniBand Architecture (IBA) defines a switch-based network with point-to-point links that supports any topology defined by the user, including irregular ones, in order to pro- vide flexibility and incremental expansion capability. Rout- ing in IBA is distributed, based on forwarding tables, and only considers the packet destination ID for routing within subnets in order to drastically reduce forwarding table size. Unfortunately, the forwarding tables for most of the pre- viously proposed routing algorithms for irregular topolo- gies consider both the destination ID and the input channel. Therefore, these popular routing algorithms for irregular topologies may not be usable in InfiniBand networks be- cause they do not conform to the IBA specifications. In this paper, we propose an easy-to-implement strategy to adapt the forwarding tables already computed following any routing algorithm that considers the destination ID and the input channel into the required IBA forwarding table format. The resulting routing algorithm is deadlock-free on IBA. Indeed, the originally computed paths are not modi- fied at all. Hence, the proposed strategy does not degrade performance with respect to the original routing scheme.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...The reason for this is the fact that this routing algorithm takes into account both the input port and the destination ID for routing, whereas IBA switches only consider the destination ID. We have proposed two simple and effective strategies to solve this problem [22, 13]...
    • ...In [13] routing restrictions are avoided with the destination renaming technique, which uses the IBA virtual addressing scheme...

    J. C. Sanchoet al. Routing in InfiniBandT M Torus Network Topologies

    • ...Existing routing schemes [1], [2], [3], [8], [13], [14], [15] are all based on the Up � =Down � routing [16], which is originally an adaptive...
    • ...We compare a new routing scheme that separates path computation from LID assignment with existing schemes for InfiniBand, including destination renaming [8] and the SRD routing scheme [14]...
    • ...The destination renaming [8] scheme uses a shortest path algorithm to select paths that follow Up � =Down � routing...

    Wickus Nienaberet al. LID Assignment in InfiniBand Networks

    • ...One class is called generic routing algorithms, such as up*/down* routing algorithm [3], its improvement [4, 5, 6, 7, 8] and its implementation in Infiniband [9, 10]...
    • ...As the original Up*/Down* routing scheme can not be used in Infiniband directly, we use a renaming scheme [10] to implement the Up*/Down* routing scheme in Infiniband...

    Xiaoshuang Xiaet al. Infiniband-Based Multipath Mesh/Torus Interconnection Network for Mass...

    • ...Most routing research for system area networks (see, for example, [5], [6], [19], [24], and [25]) has focused on developing techniques for computing and establishing routes...

    Xin Yuanet al. Oblivious routing in fat-tree based system area networks with uncertai...

    • ...Some proposals that fit these restrictions can be found in [2], [4], [14], [24]...

    Aurelio Bermúdezet al. Handling Topology Changes in InfiniBand

Sort by: