DocumentCode :
1496268
Title :
Interlacing Bypass Rings to Torus Networks for More Efficient Networks
Author :
Zhang, Peng ; Powell, Reid ; Deng, Yuefan
Author_Institution :
Dept. of Appl. Math., Stony Brook Univ., Stony Brook, NY, USA
Volume :
22
Issue :
2
fYear :
2011
Firstpage :
287
Lastpage :
295
Abstract :
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.
Keywords :
hypercube networks; parallel architectures; telecommunication network topology; 3D iBT network; 4D torus networks; bypass rings; network diameter reduction; network topology; node-to-node distances; Bandwidth; Computer architecture; Costs; Hypercubes; Multiprocessor interconnection networks; Network topology; Parallel processing; Routing; Supercomputers; Wiring; Network topology; bypass ring; network diameter; node-to-node distance; routing.; torus networks;
fLanguage :
English
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
1045-9219
Type :
jour
DOI :
10.1109/TPDS.2010.89
Filename :
5467053
Link To Document :
بازگشت