This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "Hierarchical Cubic Networks"
April 1998 (vol. 9 no. 4)
pp. 410-414

Abstract—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.

[1] K. Ghose and K.R. Desai, "Hierarchical Cubic Networks," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 4, pp. 427-435, Apr. 1995.
[2] A. El-Amawy and S. Latifi, "Properties and Performance of Folded Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 1, pp. 31-42, 1991.
[3] A.H. Esfahanian, L.M. Ni, and B.E. Sagan, "The Twisted n-Cube with Application to Multiprocessing," IEEE Trans. Computers, vol. 40, no. 1, pp. 88-93, Jan. 1991.
[4] K. Hwang and J. Ghosh, "Hypernet: A Communication Efficient Architecture for Constructing Massively Parallel Computers," IEEE Trans. Computers, pp. 1,450-1,466, 1987.
[5] J.M. Kumar and L.M. Patnaik, "Extended Hypercube: A Hierarchical Interconnection Network of Hypercubes," IEEE Trans. Parallel and Distributed Systems, pp. 45-57, 1992.
[6] N.-F. Tzeng and S. Wei, “Enhanced Hypercubes,” IEEE Trans. Computers, vol. 40, no. 3, pp. 284-294, Mar. 1991.
[7] S.G. Ziavras, “A Versatile Family of Reduced Hypercube Interconnection Network,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1210-1220, Nov. 1994.
[8] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[9] D.R. Duh, G.H. Chen, and J.F. Fang, “Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 7, pp. 714-723, July 1995.
[10] K. Ghose and K. R. Desai,“The HCN: A versatile interconnection network based on cubes,”inProc. Supercomputing '89, pp. 426–435.
[11] K. Ghose and K.R. Desai, "The Design and Evaluation of the Hierarchical Cubic Network," Proc. 19th Int'l Conf. Parallel Processing, vol. I, pp. 355-362, 1990.

Index Terms:
Interconnection networks, hypercubes, hierarchical cubic network(HCN), routing algorithm.
Citation:
Sang Kyun Yun, Kyu Ho Park, "Comments on "Hierarchical Cubic Networks"," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 4, pp. 410-414, April 1998, doi:10.1109/71.667900
Usage of this product signifies your acceptance of the Terms of Use.