Issue No. 04 - April (1998 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.667900
<p><b>Abstract</b>—Ghose and Desai [<ref rid="bibl04101" type="bib">1</ref>] 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.</p>
Interconnection networks, hypercubes, hierarchical cubic network(HCN), routing algorithm.
K. H. Park and S. K. Yun, "Comments on "Hierarchical Cubic Networks"," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 410-414, 1998.