Routing Algorithms for Torus Networks

Routing in mesh networks is studied in great detail in the literature. Interest in torus networks however is steadily increasing due to its symmetry in traac distribution. In this paper, we present a new concept of virtual mesh network to map the torus inter-connection networks on to the mesh networks. Using this concept, we show how the routing algorithms for meshes can be applied to the torus networks with the use of minimum extra hardware. The concept is illustrated by an example of the fully adaptive PFNF algorithm. Although all the discussion assumes two dimensional mesh and torus networks, the idea is applicable to multi-dimensional networks.

[1]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[2]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[3]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[4]  Chita R. Das,et al.  A Class of Partially Adaptive Routing Algorithms for n_dimensional Meshes , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[5]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

[6]  William J. Dally,et al.  Performance Analysis of k-Ary n-Cube Interconnection Networks , 1987, IEEE Trans. Computers.

[7]  Chita R. Das,et al.  Efficient fully adaptive wormhole routing in n-dimensional meshes , 1994, 14th International Conference on Distributed Computing Systems.

[8]  Anant Agarwal,et al.  APRIL: a processor architecture for multiprocessing , 1990, ISCA '90.

[9]  R. E. Kessler,et al.  Cray T3D: a new dimension for Cray Research , 1993, Digest of Papers. Compcon Spring.