Node-disjoint paths in hierarchical hypercube networks

The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor which can facilitate the VLSI design and fabrication of the system. Other alluring features include symmetry and logarithmic diameter, which imply easy and fast algorithms for communication. In this paper, a maximal number of node-disjoint paths are constructed between every two distinct nodes of the hierarchical hypercube network. Their maximal length is not greater than max{2m+1 + 2m + 1, 2m+1 + m + 4},where 2m+1 is the diameter

[1]  Kai Hwang,et al.  Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers , 1987, IEEE Transactions on Computers.

[2]  W. Daniel Hillis,et al.  The connection machine , 1985 .

[3]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[4]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

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

[6]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[7]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[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]  Magdy A. Bayoumi,et al.  The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems , 1994, IEEE Trans. Parallel Distributed Syst..

[10]  Ming-Syan Chen,et al.  Processor Allocation in an N-Cube Multiprocessor Using Gray Codes , 1987, IEEE Transactions on Computers.

[11]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[12]  P. F. Corbett,et al.  Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks , 1992, IEEE Trans. Parallel Distributed Syst..

[13]  C. Sanges,et al.  A recursively scalable network VLSI implementation , 1988, Future Gener. Comput. Syst..

[14]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .