Node-disjoint paths in hierarchical hypercube networks
Resource
Information Sciences 177 (19): 4200-4207
Journal
Information Sciences
Journal Volume
177
Journal Issue
19
Pages
4200-4207
Date Issued
2007
Author(s)
Abstract
The hierarchical hypercube network is suitable for massively parallel systems. One of its appealing properties is the low number of connections per processor, which can facilitate the VLSI design and fabrication. Other alluring features include symmetry and logarithmic diameter, which can derive 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 + 2 m + 1, 2m + 1 + m + 4}, where 2m + 1 is the diameter. The effectiveness of node-disjoint paths is further verified by experiments. © 2007 Elsevier Inc. All rights reserved.
Subjects
Container; Hierarchical hypercube network; Hypercube; Interconnection network; Node-disjoint paths
Other Subjects
Hierarchical hypercube networks; Hypercube; Node-disjoint paths; Integrated circuit layout; Interconnection networks; Program processors; VLSI circuits; Parallel processing systems
Type
journal article
File(s)![Thumbnail Image]()
![Thumbnail Image]()
Loading...
Name
45.pdf
Size
185.4 KB
Format
Adobe PDF
Checksum
(MD5):6ecc30323a8a67b081ae51c01e9d3268
Loading...
Name
18.pdf
Size
957.08 KB
Format
Adobe PDF
Checksum
(MD5):a01b9e15e7f44d3c566210bf36d6f703