Deadlock-free routing in InfiniBand/sup TM/ through destination renaming
Authors:
- 1 January 2001
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01903918,p. 427-434
Abstract
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 provide flexibility and incremental expansion capability. Routing 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 previously proposed routing algorithms for irregular topologies consider both the destination ID and the input channel. Therefore, these popular routing algorithms for irregular topologies may not be usable in InfiniBand networks because they do nor 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 modified at all. Hence, the proposed strategy does not degrade performance with respect to the original routing scheme.Keywords
This publication has 8 references indexed in Scilit:
- ServerNet deadlock avoidance and fractahedral topologies2002
- Performance evaluation of a new routing strategy for irregular networks with source routing2000
- A New Methodology to Compute Deadlock-Free Routing Tables for Irregular Networks2000
- Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing2000
- Efficient adaptive routing in networks of workstations with irregular topology1997
- Myrinet: a gigabit-per-second local area networkIEEE Micro, 1995
- A new theory of deadlock-free adaptive routing in wormhole networksIEEE Transactions on Parallel and Distributed Systems, 1993
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987