Symmetric and Folded Tori Connected Torus Network

Hierarchical interconnection networks provide high performance at low cost by exploring the locality that exists in the communication patterns of massively parallel computers. A Symmetric Tori connected Torus Network (STTN) is a 2D-torus network of multiple basic modules, in which the basic modules are 2D-torus networks that are hierarchically interconnected for higher-level networks. We also fold the STTN to minimize the length of the longest wire of STTN. The folded network is called Folded Tori connected Torus Network (FTTN). In this paper, we present the architecture of the STTN and FTTN, addressing of node, routing of message, and evaluate the static network performance of STTN, FTTN, TTN, TESH, mesh, and torus networks. It is shown that both the STTN and FTTN possess several attractive features, including constant node degree, small diameter, low cost, small average distance, moderate bisection width, and high fault tolerant performance than that of other conventional and hierarchical interconnection networks. We further evaluate the longest wire length of FTTN and compare it with other networks. We found that the longest wire length of the FTTN is far lower than that of other networks considered in this paper while keeping good static network performance. It is just about (1 / 2 m th) of its rival STTN.

[1]  Susumu Horiguchi,et al.  Dynamic communication performance of hierarchical interconnection network: H3D-Mesh , 2002 .

[2]  Susumu Horiguchi,et al.  Modified Hierarchical 3D-Torus Network , 2005, IEICE Trans. Inf. Syst..

[3]  Peng Zhang,et al.  Interlacing Bypass Rings to Torus Networks for More Efficient Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[4]  S. Borkar,et al.  An 80-Tile Sub-100-W TeraFLOPS Processor in 65-nm CMOS , 2008, IEEE Journal of Solid-State Circuits.

[5]  Susumu Horiguchi,et al.  TTN: A High Performance Hierarchical Interconnection Network for Massively Parallel Computers , 2009, IEICE Trans. Inf. Syst..

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

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

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

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

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

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

[12]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[13]  Susumu Horiguchi,et al.  Hierarchical 3D-torus interconnection network , 2000, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN 2000.

[14]  Junming Xu Topological Structure and Analysis of Interconnection Networks , 2002, Network Theory and Applications.

[15]  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..

[16]  Eunseuk Oh,et al.  Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube , 2002, EurAsia-ICT.

[17]  Behrooz Parhami,et al.  A Unified Formulation of Honeycomb and Diamond Networks , 2001, IEEE Trans. Parallel Distributed Syst..

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

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

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