Dynamic communication performance of a TESH network under the nonuniform traffic patterns

Interconnection networks play a crucial role in the performance of massively parallel computers. Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computer systems. The Tori-connected mESH (TESH) Network is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-mesh networks that are hierarchically interconnected for higher level networks. In this paper, we present a deadlock-free routing algorithm for the TESH network using 2 virtual channels - 2 being the minimum number for dimension-order routing - and evaluate the network's dynamic communication performance under various nonuniform traffic patterns, using the proposed routing algorithm. We evaluate the dynamic communication performance of TESH, mesh, and torus networks by computer simulation. It is shown that the dynamic communication performance of the TESH network is better than that of the mesh and torus networks.

[1]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[2]  Lawrence Snyder,et al.  The Case for Chaotic Adaptive Routing , 1997, IEEE Trans. Computers.

[3]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[4]  William J. Dally,et al.  The torus routing chip , 2005, Distributed Computing.

[5]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[6]  Gregory F. Pfister,et al.  “Hot spot” contention and combining in multistage interconnection networks , 1985, IEEE Transactions on Computers.

[7]  Nian-Feng Tzeng,et al.  Enhanced Hypercubes , 1991, IEEE Trans. Computers.

[8]  Jungang Han,et al.  RTTM: A New Hierarchical Interconnection Network for Massively Parallel Computing , 2009, HPCA.

[9]  Mohan Kumar,et al.  Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes , 1992, IEEE Trans. Parallel Distributed Syst..

[10]  Susumu Horiguchi,et al.  A deadlock-free routing algorithm using minimum number of virtual channels and application mappings for Hierarchical Torus Network , 2006, Int. J. High Perform. Comput. Netw..

[11]  Lionel M. Ni,et al.  The Twisted N-Cube with Application to Multiprocessing , 1991, IEEE Trans. Computers.

[12]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[13]  Vijay K. Jain,et al.  VLSI considerations for TESH: a new hierarchical interconnection network for 3-D integration , 1998, IEEE Trans. Very Large Scale Integr. Syst..

[14]  Sotirios G. Ziavras.  RH: A Versatile Family of Reduced Hypercube Interconnection Networks , 1994, IEEE Trans. Parallel Distributed Syst..

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

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

[17]  Miltos D. Grammatikakis,et al.  Packet Routing in Fixed-Connection Networks: A Survey , 1998, J. Parallel Distributed Comput..

[18]  Vijay K. Jain,et al.  Automatic Reconfiguration and Yield of the TESH Multicomputer Network , 2002, IEEE Trans. Computers.

[19]  Susumu Horiguchi,et al.  A deadlock-free routing for hierarchical interconnection network: TESH , 2000, Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.

[20]  Susumu Horiguchi,et al.  High performance hierarchical torus network under matrix transpose traffic patterns , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..