Comments on “Hierarchical Cubic Networks”

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 814
  • Download : 654
DC FieldValueLanguage
dc.contributor.authorYun, Sang Kyun-
dc.contributor.authorPark, Kyu Ho-
dc.date.accessioned2007-06-13T07:22:43Z-
dc.date.available2007-06-13T07:22:43Z-
dc.date.issued1998-04-01-
dc.identifier.citationIEEE Transactions on Parallel and Distributed Systems, Vol.9, No.4, pp. 410-414en
dc.identifier.issn1045-9219-
dc.identifier.urihttp://hdl.handle.net/10203/483-
dc.description.abstractGhose 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 hypercubeen
dc.language.isoen_USen
dc.publisherIEEEen
dc.subjectInterconnection networksen
dc.subjecthypercubesen
dc.subjecthierarchical cubic network(HCN)en
dc.subjectrouting algorithmen
dc.titleComments on “Hierarchical Cubic Networks”en
dc.typeArticleen

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0