Optimal Routing for a Family of Scalable Interconnection Networks
share
Scalability of interconnection networks for the supercomputers, particularly, for next-generation exascale systems with tens of millions of cores, is one of the essential features for enhancement of performance. One of the required properties of the scalable and low-radix for interconnection networks is the minimum-diameter-based scalable (MDBs) network. The MDBs network combines the desired features of some optimal topologies with different orders, such as small diameter, high connectivity, symmetry, and regularity. The diameter of the MDBs network grows up linearly while the size of the network measured in nodes increases exponentially. We designed the vertex-balanced routing algorithm for the base network by considering the pressure of the data transit in each node. The benchmarks on a real small-scale cluster show amazing improvements in performance after adapting the new routing algorithm. Each node of MDBs generated from base topologies can also sustain balanced transit loading if we apply the optimized routing algorithm to the base network. The simulation results show that our algorithm can substantially enhance communication performance for MDBs.
READ FULL TEXT