Interlacing Bypass Rings to Torus Networks for More Efficient Networks

We introduce a new technique for generating more efficient networks by systematically interlacing bypass rings to torus networks (iBT networks). The resulting network can improve the original torus network by reducing the network diameter, node-to-node distances, and by increasing the bisection width without increasing wiring and other engineering complexity. We present and analyze the statement that a 3D iBT network proposed by our technique outperforms 4D torus networks of the same node degree. We found that interlacing rings of sizes 6 and 12 to all three dimensions of a torus network with meshes 30 × 30 × 36 generate the best network of all possible networks, including 4D torus and hypercube of approximately 32,000 nodes. This demonstrates that strategically interlacing bypass rings into a 3D torus network enhances the torus network more effectively than adding a fourth dimension, although we may generalize the claim. We also present a node-to-node distance formula for the iBT networks.

[1]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[3]  W. Worth Kirkman,et al.  Packed exponential connections-a hierarchy of 2-D meshes , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[4]  E. Anderson,et al.  Performance of the CRAY T3E Multiprocessor , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[5]  Volker Heun,et al.  Efficient Embeddings into Hypercube-like Topologies , 2003, Comput. J..

[6]  Rituparna Chaki,et al.  A new logical topology based on barrel shifter network over an all optical network , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[7]  Philip Heidelberger,et al.  IBM Research Report Design and Analysis of the BlueGene/L Torus Interconnection Network , 2003 .

[8]  Behrooz Parhami,et al.  Incomplete k-ary n-cube and its derivatives , 2004, J. Parallel Distributed Comput..

[9]  Hans Werner Meuer,et al.  Top500 Supercomputer Sites , 1997 .

[10]  Steven L. Scott,et al.  The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus , 1996 .

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

[12]  Hideharu Amano,et al.  Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  Kemal Efe A Variation on the Hypercube with Lower Diameter , 1991, IEEE Trans. Computers.

[14]  Hong Shen,et al.  A Low Cost Hybrid Fat-tree Interconnection Network , 1998 .

[15]  Michael Lang,et al.  Entering the petaflop era: The architecture and performance of Roadrunner , 2008, 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis.

[16]  R. P. Kaushal,et al.  Comparison of hypercube, hypernet, and symmetric hypernet architectures , 1992, CARN.

[17]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[18]  Behrooz Parhami,et al.  Swapped interconnection networks: Topological, performance, and robustness attributes , 2005, J. Parallel Distributed Comput..

[19]  David F. Heidel,et al.  An Overview of the BlueGene/L Supercomputer , 2002, ACM/IEEE SC 2002 Conference (SC'02).

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

[21]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[22]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[23]  David Semé,et al.  3D hexagonal network: modeling, topological properties, addressing scheme, and optimal routing algorithm , 2005, IEEE Transactions on Parallel and Distributed Systems.

[24]  Susumu Horiguchi,et al.  Shifted Recursive Torus interconnection for high performance computing , 1997, Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97.

[25]  F. Harary,et al.  A survey of the theory of hypercube graphs , 1988 .

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