Optimized InfiniBandTMfat‐tree routing for shift all‐to‐all communication patterns
- 17 November 2009
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 22 (2) , 217-231
Abstract
Clustered systems have become a dominant architecture of scalable high‐performance super computers. In these large‐scale computers, the network performance and scalability is as critical as the compute‐nodes speed. InfiniBandTMhas become a commodity networking solution supporting the stringent latency, bandwidth and scalability requirements of these clusters. The network performance is also affected by its topology, packet routing and the communication patterns the distributed application exercises. Fat‐trees are the topology structures used for constructing most large clusters as they are scalable, maintain cross‐bisectional‐bandwidth (CBB), and are practical to build using fixed‐arity switches. In this paper, we propose a fat‐tree routing algorithm that provides a congestion‐free, all‐to‐all shift pattern leveraging on the InfiniBandTMstatic routing capability. The algorithm supports partially populated fat‐trees built with switches of arbitrary number of ports and CBB ratios. To evaluate the proposed algorithm, detailed switch and host simulation models were developed and multiple fabric topologies were run. The results of these simulations as well as measurements on real clusters show an improvement in all‐to‐all delay by avoiding congestion on the fabric. Copyright © 2009 John Wiley & Sons, Ltd.Keywords
This publication has 11 references indexed in Scilit:
- Multistage switches are not crossbars: Effects of static routing in high-performance networks2008
- Reconfigurable hybrid interconnection for static and dynamic scientific applications2007
- LASH-TOR: a generic transition-oriented routing algorithm2004
- Effective methodology for deadlock-free minimal routing in InfiniBand networks2003
- On generalized fat trees2002
- A Block Adaptive Mesh Refinement Algorithm for the Neutral Particle Transport EquationNuclear Science and Engineering, 2002
- Predictive performance and scalability modeling of a large-scale application2001
- Deadlock-free routing in InfiniBand/sup TM/ through destination renaming2001
- Parallel Computer Routing and Communication1994
- Fat-trees: Universal networks for hardware-efficient supercomputingIEEE Transactions on Computers, 1985