Node-disjoint paths in hierarchical hypercube networks

Authors:
Ruei-Yu Wu;Gerard J. Chang;Gen-Huey Chen
Affiliations:
National Taiwan University, Dept. of Computer Science and Information Engineering, Taipei, Taiwan;National Taiwan University, Dept. of Mathematics, Taipei, Taiwan;National Taiwan University, Dept. of Computer Science and Information Engineering, Taipei, Taiwan
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 11
Cited 1

The connection machine

The connection machine
Processor allocation in an N-cube multiprocessor using gray codes

IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers

IEEE Transactions on Computers
Topological Properties of Hypercubes

IEEE Transactions on Computers
A recursively scalable network VLSI implementation

Future Generation Computer Systems
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Hierarchical Cubic Networks

IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
The Hierarchical Hypercube: A New Interconnection Topology for Massively Parallel Systems

IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications

Graph Theory With Applications

RTTM: a new hierarchical interconnection network for massively parallel computing

HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.