Design and implementation of a nonblocking 2-dilated flattened butterfly switching network

High-performance computing is highly dependent on the communication network connecting the nodes. In this paper, we present a design and implementation of the 2-dilated flattened butterfly (2DFB) network topology, which provides non-blocking performance for relatively low cost overhead. The flattened butterfly is known to be a cost efficient topology for high-radix networks. Because of its inherent path diversity, it is able to provide comparable cost/performance with the folded-Clos network in adversarial traffic conditions. However, the flattened butterfly is a blocking network and this blocking behavior can degrade the performance of the network when all compute nodes are transmitting and receiving data at full bandwidth. 2DFB network exhibits nonblocking behavior which is a critical factor in deciding the quality of any high performance computing system network. We have implemented the network using the NetF-PGA as the switching element and verified the nonblocking behavior of 2DFB. We also compare the performance of a 2DFB with other switching networks. We also show that the 2DFB topology can be used to build high speed switching systems with reduced cost.