Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
The HCN: a versatile interconnection network based on cubes
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
Cycle embedding in faulty hierarchical cubic networks
Proceedings of the 2002 ACM symposium on Applied computing
Pancycles and hamiltonian-connectedness of the hierarchical cubic network
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Hypercube and Its Variant Networks: A Topological Evaluation
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
| Hi-index | 0.00 |
Ghose and Desai [1] introduced a new interconnection for large-scale distributed memory multiprocessors called the Hierarchical Cubic Network (HCN). The HCN is topologically superior to a comparable hypercube. They also proposed optimal routing algorithms for the HCN and obtained its diameter, which is about three-fourths the diameter of a comparable hypercube. However, their routing algorithm is not distance-optimal. In this paper, we propose an optimal routing algorithm for the HCN and show that HCN has about two-thirds the diameter of a comparable hypercube.