Journal
COMPUTER JOURNAL
Volume 55, Issue 12, Pages 1440-1446Publisher
OXFORD UNIV PRESS
DOI: 10.1093/comjnl/bxr137
Keywords
interconnection network; algorithm; parallel processing; hypercube; HCN
Categories
Funding
- Fund for Promoting Research on Symbiotic Information Technology of Ministry of Education, Culture, Sports, Science and Technology (MEXT) Japan
- Japan Society for the Promotion of Science (JSPS) [22500041]
- Grants-in-Aid for Scientific Research [22500041] Funding Source: KAKEN
Ask authors/readers for more resources
Hypercubes are a simple topology frequently used as interconnection network of parallel systems. However, hypercubes connecting a significant number of nodes also have an impractically high number of edges. To address this issue, Ghose and Desai introduced a new topology, hierarchical cubic networks, containing almost half many edges than a hypercube of the same size. In this paper, we describe a node-to-set disjoint-path routing algorithm in a hierarchical cubic network HCN(n) finding node-disjoint paths between one source node and k (k < n+1) destination nodes in O(knlog k) time complexity. Generated paths have lengths of at most 3n+k+3.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available