Effective strategy to compute forwarding tables for infiniBand networks Export

@inproceedings{citeulike:3176960, abstract = {InfiniBand is very likely to become the facto standard for communication between processing nodes and I/O devices as well as for interprocessor communication. The InifiniBand Architecture (IBA) defines a switch-based network with point-to-point links that support any topology defined by the user. Routing in IBA is distributed based on forwarding tables, and only considers the packet destination ID for routing within subnets. Up*/down* routing is the simplest and most popular routing algorithm for irregular topologies. Unfortunately, up*/down* routing cannot be used in IBA switches because it may leads to deadlock. In this paper we address this issue, proposing an easy-to-implement strategy to complete up*/down* forwarding tables for IBA switches that guarantees deadlock freedom, and is effective whatever the methodology applied to compute up*/down* routing tables. Preliminary evaluation results modeling an InfiniBand network at register transfer level show that the proposed strategy allows up*/down* routing algorithms to be implemented on InfiniBand networks with minimal performance degradation.}, author = {Sancho, J. C. and Robles, A. and Duato, J.}, booktitle = {Parallel Processing, International Conference on, 2001.}, citeulike-article-id = {3176960}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/ICPP.2001.952046}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=952046}, doi = {10.1109/ICPP.2001.952046}, journal = {Parallel Processing, International Conference on, 2001.}, keywords = {ib-routing, routing}, pages = {48--57}, posted-at = {2008-08-31 19:21:04}, priority = {3}, title = {Effective strategy to compute forwarding tables for infiniBand networks}, url = {http://dx.doi.org/10.1109/ICPP.2001.952046}, year = {2001} }

TY - CONF ID - citeulike:3176960 L3 - citeulike-article-id:3176960 N2 - InfiniBand is very likely to become the facto standard for communication between processing nodes and I/O devices as well as for interprocessor communication. The InifiniBand Architecture (IBA) defines a switch-based network with point-to-point links that support any topology defined by the user. Routing in IBA is distributed based on forwarding tables, and only considers the packet destination ID for routing within subnets. Up*/down* routing is the simplest and most popular routing algorithm for irregular topologies. Unfortunately, up*/down* routing cannot be used in IBA switches because it may leads to deadlock. In this paper we address this issue, proposing an easy-to-implement strategy to complete up*/down* forwarding tables for IBA switches that guarantees deadlock freedom, and is effective whatever the methodology applied to compute up*/down* routing tables. Preliminary evaluation results modeling an InfiniBand network at register transfer level show that the proposed strategy allows up*/down* routing algorithms to be implemented on InfiniBand networks with minimal performance degradation. JF - Parallel Processing, International Conference on, 2001. EP - 57 TI - Effective strategy to compute forwarding tables for infiniBand networks T2 - Parallel Processing, International Conference on, 2001. SP - 48 KW - ib-routing KW - routing AU - Sancho, JC AU - Robles, A AU - Duato, J PY - 2001/// UR - http://dx.doi.org/10.1109/ICPP.2001.952046 ER -