Node-to-Set Disjoint-path Routing in Metacube

The metacube interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one source node and at most m+k target nodes in a metacube MC(k, m) excluding MC(*,1), MC(2,2), MC(3,2) and MC(3,3). We show that we can find m+k disjoint paths between the source node and the m+k targets of length at most metacube diameter plus (k+4) with time complexity of order of metacube degree times its diameter.

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

[2]  E. Barszcz,et al.  Profiling the communication workload of an iPSC/860 , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

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

[4]  Trevor Mudge,et al.  Hypercube supercomputers , 1989, Proc. IEEE.

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

[6]  Shietung Peng,et al.  Metacube: a new interconnection network for large scale parallel systems , 2002 .

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

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

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

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

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

[12]  L. W. Tucker,et al.  Architecture and applications of the Connection Machine , 1988, Computer.

[13]  Matthias Felleisen,et al.  DrScheme: a programming environment for Scheme , 2002, J. Funct. Program..

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

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

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

[17]  Shietung Peng,et al.  DUAL-CUBES: A NEW INTERCONNECTION NETWORK FOR HIGH-PERFORMANCE COMPUTER CLUSTERS , 2000 .

[18]  Shietung Peng,et al.  Node-to-Set and Set-to-Set Cluster Fault Tolerant Routing in Hypercubes , 1998, Parallel Comput..

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