Issue No. 04 - April (1995 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.372797
<p><it>Abstract—</it>We introduce a new interconnection network for large-scale distributed memory multiprocessors called the Hierarchical Cubic Network (HCN). We establish that the number of routing steps needed by several data parallel applications running on a HCN-based system and a hypercube-based system are about identical. Further, hypercube connections can be emulated on the HCN in constant time. Simulation of uniform and localized traffic patterns reveal that the normalized average internode distances in a HCN are better than in a comparable hypercube. Additionally, the HCN also has about three-fourths the diameter of a comparable hypercube, although it uses about half as many links per node—a fact that has positive ramifications on the implementation of HCN-connected systems.</p><p><it>Index Terms—</it>Data parallel algorithm, hypercubes, interconnection networks, loosely-coupled multiprocessors.</p>
K. Ghose and K. R. Desai, "Hierarchical Cubic Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 427-435, 1995.