Comments on “Hierarchical Cubic Networks”

Ghose and Desai (1995) 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
Publisher
IEEE
Issue Date
1998-04-01
Keywords

Interconnection networks; hypercubes; hierarchical cubic network(HCN); routing algorithm

Citation

IEEE Transactions on Parallel and Distributed Systems, Vol.9, No.4, pp. 410-414

ISSN
1045-9219
URI
http://hdl.handle.net/10203/483
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
00667900윤상균.pdf(122.39 kB)Download
  • Hit : 676
  • Download : 486
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0