Comments on “Hierarchical Cubic Networks”
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Yun, Sang Kyun | - |
| dc.contributor.author | Park, Kyu Ho | - |
| dc.date.accessioned | 2007-06-13T07:22:43Z | - |
| dc.date.available | 2007-06-13T07:22:43Z | - |
| dc.date.issued | 1998-04-01 | - |
| dc.identifier.citation | IEEE Transactions on Parallel and Distributed Systems, Vol.9, No.4, pp. 410-414 | en |
| dc.identifier.issn | 1045-9219 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/483 | - |
| dc.description.abstract | 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 | en |
| dc.language.iso | en_US | en |
| dc.publisher | IEEE | en |
| dc.subject | Interconnection networks | en |
| dc.subject | hypercubes | en |
| dc.subject | hierarchical cubic network(HCN) | en |
| dc.subject | routing algorithm | en |
| dc.title | Comments on “Hierarchical Cubic Networks” | en |
| dc.type | Article | en |
- Appears in Collection
- EE-Conference Papers(학술회의논문)
- Files in This Item
- 00667900윤상균.pdf(122.39 kB)Download
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.