Interconnection Networks of Degree Three Obtained by Pruning Two-Dimensional Tori

We study an interconnection network that we call 3Torus(m,n) obtained by pruning the 4m ×4n torus (of links) so that the resulting network is regular of degree 3. We show that 3Torus(m,n) retains many of the useful properties of tori (although, of course, there is a price to be paid due to the reduction in links). In particular, we show that 3Torus(m,n) is node-symmetric; we establish closed-form expressions on the length of a shortest path joining any two nodes of the network; we calculate the diameter precisely; we obtain an upper bound on the average inter-node distance; we develop an optimal distributed routing algorithm; we prove that 3Torus(m,n) has connectivity 3 and is Hamiltonian; we obtain a precise expression for (an upper bound on) the wide-diameter; and we derive optimal one-to-all broadcast and personalized one-to-all broadcast algorithms under both a one-port and all-port communication model. We also undertake a preliminary performance evaluation of our routing algorithm. In summary, we find that 3Torus(m,n) compares very favourably with tori.

[1]  Selim G. Akl,et al.  Efficient algorithms for global data communication on the multidimensional torus network , 1995, Proceedings of 9th International Parallel Processing Symposium.

[2]  Ramón Beivide,et al.  L-Networks: A Topological Model for Regular 2D Interconnection Networks , 2013, IEEE Transactions on Computers.

[3]  Fadi N. Sibai,et al.  A Two-Dimensional Low-Diameter Scalable On-Chip Network for Interconnecting Thousands of Cores , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

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

[6]  Myung M. Bae,et al.  Edge Disjoint Hamiltonian Cycles in k-Ary n-Cubes and Hypercubes , 2003, IEEE Trans. Computers.

[7]  Urban Borštnik,et al.  Interconnection networks for parallel molecular dynamics simulation based on hamiltonian cubic symmetric topology , 2009 .

[8]  Cheng-Kuan Lin,et al.  Graph Theory and Interconnection Networks , 2008 .

[9]  Yan-Quan Feng,et al.  Cubic symmetric graphs of order twice an odd prime-power , 2006, Journal of the Australian Mathematical Society.

[10]  Wenjun Xiao,et al.  Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks , 2007, J. Comput. Syst. Sci..

[11]  D. Maru,et al.  Symmetries of Hexagonal Molecular Graphs on the Torus , 2000 .

[12]  Dragan Marusic,et al.  Chirality of Toroidal Molecular Graphs , 2005, J. Chem. Inf. Model..

[13]  Abderezak Touzene,et al.  Edge-disjoint spanning trees for the generalized butterfly networks and their applications , 2005, J. Parallel Distributed Comput..

[14]  Bella Bose,et al.  The Topology of Gaussian and Eisenstein-Jacobi Interconnection Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[15]  Ching-Hsien Hsu,et al.  Scheduling for atomic broadcast operation in heterogeneous networks with one port model , 2008, The Journal of Supercomputing.

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

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

[18]  Yaagoub Ashir,et al.  Communication Algorithms in k-Ary n-Cube Interconnection Networks , 1997, Inf. Process. Lett..

[19]  Nicola Concer,et al.  Simulation and analysis of network on chip architectures: ring, spidergon and 2D mesh , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[20]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

[21]  Ralf Lämmel,et al.  Google's MapReduce programming model - Revisited , 2007, Sci. Comput. Program..

[22]  Zhen Zhang.  Some Properties in Hexagonal Torus as Cayley Graph , 2011, ICIC 2011.

[23]  Jimmy J. M. Tan,et al.  Honeycomb rectangular disks , 2005, Parallel Comput..

[24]  Amihay Hanany,et al.  Quivers, tilings, branes and rhombi , 2007 .

[25]  Shuming Zhou.  A New Family of Trivalent Cayley Networks on Wreath Product Zm≀Sn , 2006, J. Syst. Sci. Complex..

[26]  Natalie D. Enright Jerger,et al.  On-Chip Networks , 2009, On-Chip Networks.

[27]  John Kim,et al.  High Performance Datacenter Networks: Architectures, Algorithms, and Opportunities , 2011, High Performance Datacenter Networks: Architectures, Algorithms, and Opportunities.

[28]  Martin Skoviera,et al.  Lifting Graph Automorphisms by Voltage Assignments , 2000, Eur. J. Comb..

[29]  Wenjun Xiao,et al.  A Group Construction Method with Applications to Deriving Pruned Interconnection Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[30]  Philip Heidelberger,et al.  The IBM Blue Gene/Q interconnection network and message unit , 2011, 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (SC).

[31]  Qin Zhang,et al.  Principle of Symmetry for Network Topology with Applications to Some Networks , 2010, J. Networks.

[32]  Tomohiro Inoue,et al.  Tofu : Interconnect for the K computer , 2012 .

[33]  Ramón Beivide,et al.  Modeling Toroidal Networks with the Gaussian Integers , 2008, IEEE Transactions on Computers.

[34]  Aleksander Malnic,et al.  Action graphs and coverings , 2002, Discret. Math..

[35]  Miltos D. Grammatikakis,et al.  Design of Cost-Efficient Interconnect Processing Units , 2008 .

[36]  Bella Bose,et al.  Efficient Communication Algorithms in Hexagonal Mesh Interconnection Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[37]  Xiaohong Jiang,et al.  Network Performance of Pruned Hierarchical Torus Network , 2009, 2009 Sixth IFIP International Conference on Network and Parallel Computing.

[38]  Yoshiyasu Ishigami,et al.  The wide-diameter of the n-dimensional toroidal mesh , 1996 .

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

[40]  Yan-Quan Feng,et al.  Classifying cubic symmetric graphs of order 8p or 8p2 , 2005, Eur. J. Comb..

[41]  P. M. Weichsel.  THE KRONECKER PRODUCT OF GRAPHS , 1962 .

[42]  Lih-Hsing Hsu,et al.  Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs , 2005, Appl. Math. Comput..