Issue No. 02 - February (2011 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.89
Yuefan Deng , Stony Brook University, Stony Brook, NY
Reid Powell , Stony Brook University, Stony Brook, NY
Peng Zhang , Stony Brook University, Stony Brook, NY
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 \times 30 \times36 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.
Network topology, torus networks, bypass ring, network diameter, node-to-node distance, routing.
Yuefan Deng, Reid Powell, Peng Zhang, "Interlacing Bypass Rings to Torus Networks for More Efficient Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 22, no. , pp. 287-295, February 2011, doi:10.1109/TPDS.2010.89