A multiple LID routing scheme for fat-tree-based InfiniBand networks

Summary form only given. In a cluster system, performance of the interconnection network greatly affects the computation power generated together from all interconnected processing nodes. The network architecture, the interconnection topology, and the routing scheme are three key elements dominating the performance of an interconnection network. InfiniBand architecture (IBA) is a new industry standard architecture. It defines a high-bandwidth, high-speed, and low-latency message switching network that is good for constructing high-speed interconnection networks for cluster systems. Fat-trees are well-adopted as the topologies of interconnection networks because of many nice properties they have. We proposed an m-port n-tree approach to construct fat-tree-based InfiniBand networks. Based on the constructed fat-tree-based InfiniBand networks, we proposed an efficient multiple LID (MLID) routing scheme. The proposed routing scheme is composed of processing node addressing scheme, path selection scheme, and forwarding table assignment scheme. To evaluate the performance of the proposed routing scheme, we have developed a software simulator for InfiniBand networks. The simulation results show that the proposed routing scheme runs well on the constructed fat-tree-based InfiniBand networks and is able to efficiently utilize the bandwidth and the multiple paths that fat-tree topology offers under InfiniBand architecture.

[1]  Antonio Robles,et al.  Analyzing the influence of virtual lanes on the performance of infiniband networks , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[2]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[3]  Lionel M. Ni,et al.  Performance Evaluation of Switch-Based Wormhole Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[4]  Fabrizio Petrini,et al.  k-ary n-trees: high performance networks for massively parallel architectures , 1997, Proceedings 11th International Parallel Processing Symposium.

[5]  Kai Hwang,et al.  Advanced computer architecture - parallelism, scalability, programmability , 1992 .

[6]  P.M. Melliar-Smith,et al.  Recursively scalable fat-trees as interconnection networks , 1994, Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications.

[7]  Fabrizio Petrini,et al.  Network performance under physical constraints , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[8]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[9]  Antonio Robles,et al.  Effective strategy to compute forwarding tables for infiniBand networks , 2001, International Conference on Parallel Processing, 2001..

[10]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[11]  José Duato,et al.  Deadlock-Free Routing in InfiniBand through Destination Renaming , 2001 .

[12]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[13]  Pedro López,et al.  Deadlock-free routing in InfiniBand/sup TM/ through destination renaming , 2001, International Conference on Parallel Processing, 2001..

[14]  Antonio Robles,et al.  Effective methodology for deadlock-free minimal routing in InfiniBand networks , 2002, Proceedings International Conference on Parallel Processing.