An efficient routing scheme for scalable hierarchical networks
H. Park, Dharma Prakash Agrawal · 2002
Future generation supercomputers are expected to have increased use of cluster-based hierarchy. This paper specifies the connection method in a recently introduced hierarchical topology called de Bruijn-Cube (dBCube), which connects clusters of hypercubes by a de Bruijn graph. The addressing scheme defined in this paper is used to show that the dBCube possesses a self-routing property. We introduce a new switching method, called Wormhole Intracluster Cut-through Intercluster (WICI) routing, to enhance the network efficiency in large hierarchical networks. The simulation results of WICI routing in dBCube networks are compared with wormhole and cut-through routings. To ensure the delivery of a message from a source to any destination, we also present the deadlock-free routing using virtual channels in dBCube.>