Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Flow Control Mechanism to Avoid Message Deadlock in k-ary n-cube Networks
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Overview of the IBM Blue Gene/P project
IBM Journal of Research and Development
Hi-index | 0.00 |
Torus topology is widely used in the largest supercomputers, and specially three-dimensional torus. To implement a 3D torus topology, six ports (links) per node are needed, which can be offered by a single or several communication cards. We showed how to build 3D tori by using two four-port low-profile cards per node, and since there are multiple ways of assigning the dimension and direction of the card ports, we found the optimal port configuration [2]. In these tori, routing becomes a challenge because deadlocks can appear due to the use of the link interconnecting the two cards in the nodes. In this paper we study this problem and present two different alternatives based on the DOR routing scheme.