Node-to-set disjoint paths routing in a metacube

The metacube interconnection network was designed for large parallel computers in 2002. Compared with a hypercube of the same size, a metacube has a degree significantly lower while retaining a similar diameter. For example, a metacube having only six links per node has the capacity to connect 2

[1]  Shietung Peng,et al.  Fault-tolerant Routing in Metacube , 2002 .

[2]  Kemal Efe,et al.  The Crossed Cube Architecture for Parallel Computation , 1992, IEEE Trans. Parallel Distributed Syst..

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

[4]  Shietung Peng,et al.  Set-To-Set Fault Tolerant Routing in Hypercubes (Special Section on Discrete Mathematics and Its Applications) , 1996 .

[5]  Shietung Peng,et al.  Disjoint Paths in Metacube , 2003 .

[6]  Shietung Peng,et al.  Metacube—a versatile family of interconnection networks for extremely large-scale supercomputers , 2010, The Journal of Supercomputing.

[7]  Keiichi Kaneko,et al.  Node-to-set disjoint-path routing in perfect hierarchical hypercubes , 2011, ICCS.

[8]  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).

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

[10]  Kanad Ghose,et al.  Hierarchical Cubic Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[11]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[12]  Keiichi Kaneko,et al.  Node-to-Set Disjoint Paths Routing in Dual-Cube , 2008, 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008).

[13]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .