Optimized InfiniBandTMfat‐tree routing for shift all‐to‐all communication patterns
Eitan Zahavi, Gregory R. Johnson, Darren J. Kerbyson, Michael Lang · Concurrency and Computation Practice and Experience · 2009
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.