Evaluation of Routing Algorithms for InfiniBand Networks (Research Note)

Authors:
María E. Gómez;Jose Flich;Antonio Robles;Pedro López;José Duato
Affiliations:
-;-;-;-;-
Venue:
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Year:
2002

Citing 3
Cited 0

Deadlock-Free Routing in InfiniBand through Destination Renaming

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Effective Strategy to Compute Forwarding Tables for InfiniBand Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing

ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Storage Area Networks (SANs) provide the scalability required by the IT servers. InfiniBand (IBA) interconnect is very likely to become the de facto standard for SANs as well as for NOWs. The routing algorithm is a key design issue in irregular networks. Moreover, as several virtual lanes can be used and different network issues can be considered, the performance of the routing algorithms may be affected. In this paper we evaluate three existing routing algorithms (up*/down*, DFS, and smart-routing) suitable for being applied to IBA. Evaluation has been performed by simulation under different synthetic traffic patterns and I/O traces. Simulation results show that the smart-routing algorithm achieves the highest performance.