Achieving Predictable High Performance in Imbalanced Fat Trees

• Published in: 2010 IEEE 16th International Conference on Parallel and Distributed Systems pp. 381 - 388
• Main Authors: Bogdanski, Bartosz, Sem-Jacobsen, Frank Olaf, Reinemo, Sven-Arne, Skeie, Tor, Holen, Line, Huse, Lars Paul
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.12.2010
• Subjects: Approximation algorithms; Bandwidth; fat-trees; InfiniBand; interconnection networks; Network topology; Routing; System recovery; Throughput; Topology
• ISBN: 1424497272; 9781424497270
• ISSN: 1521-9097; 2690-5965
• DOI: 10.1109/ICPADS.2010.94

The fat-tree topology has become a popular choice for InfiniBand fabrics due to its inherent deadlock freedom, fault-tolerance and full bisection bandwidth. InfiniBand is used by more than 40% of the systems on the latest Top 500 list, and many of these systems are based on a fat-tree topology. However, the current InfiniBand fat-tree routing algorithm suffers from flaws that reduce its scalability and flexibility. Counter-intuitively, the achievable throughput per node deteriorates both when the number of nodes in a tree decreases or when the node distribution among leaves is nonuniform. In this paper, we identify the weaknesses of the current enhanced fat-tree routing algorithm in Open Fabrics Enterprise Distribution and we propose extensions to it that alleviate all performance problems related to node distribution. The new algorithm is implemented in OpenSM for real world evaluation and for future contribution to the Open Fabrics community. We demonstrate that our solution allows to achieve a predictable high throughput regardless of the number of nodes and their distribution. Furthermore, the simulations show that our extensions improve throughput up to 30% depending on topology size and node distribution.