(A) hierarchical hypercube network for parallel computers and a fault-tolerant routing algorithm in hypercube computers병렬 컴퓨터용 계층적 하이퍼큐브 네트웍과 하이퍼큐브에서의 고장허용 라우팅 알고리즘

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 486
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorPark, Kyu-Ho-
dc.contributor.advisor박규호-
dc.contributor.authorYun, Sang-Kyun-
dc.contributor.author윤상균-
dc.date.accessioned2011-12-14-
dc.date.available2011-12-14-
dc.date.issued1995-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=101714&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/36287-
dc.description학위논문(박사) - 한국과학기술원 : 전기및전자공학과, 1995.8, [ vii, 114 p. ]-
dc.description.abstractMajor topics of this thesis are concentrated on two issues: (1) Optimal routing algorithms of the hierarchical cubic network (HCN) and a hierarchical hypercube network (HHN) based on the extension of HCN and (2) Fault-tolerant routing algorithm and distributed fault-free subcube identification algorithms in a faulty hypercube. The hypercube topology has many advantages. However, it is not suitable for very large-scale parallel computers due to rapid increase of links. So, we need interconnection networks which have the smaller node degree and hold many advantages of the hypercube. The HCN proposed by Ghose and Desai is a network with these desirable properties. The HCN has the smaller diameter regardless of the smaller node degree. The performance of parallel algorithms with regular pattern of communications is identical to their performance on a hypercube. We propose the optimal routing algorithm in the HCN and show that the diameter of HCN(n, n) which consists of $2^{2n}$ nodes is $n+\lceil (n+1)/3 \rceil + 1$ while its node degree is only n+1. Incomplete HCN``s are also discussed. We also propose the hierarchical hypercube network (HHN), which is a multiple level extension of the HCN, and deal with the routing algorithm, broadcasting algorithm, and some properties. The HHN has a smaller number of links than the comparable hypercube. In particular, the HHN network with $2^K$ nodes can be constructed with the node degree about $2\surd\overline{K}$ while the node degree of the comparable hypercube is K . Due its smaller node degree, the HHN is an interconnection network suitable for constructing large scale parallel computers. Regardless of its smaller node degree, many parallel algorithms can be executed in HHN with the same time complexity as in hypercube and a hypercube can emulate the comparable hypercube in O(1) time. Thus, HHN is a good alternative to the popular hypercube network for large scale parallel systems. As the second topic, fault-tolerant metho...eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectrouting algorithm-
dc.subjecthierarchical network-
dc.subjecthypercube-
dc.subjectinterconnection network-
dc.subjectfault-tolerance-
dc.subject고장허용-
dc.subject라우팅알고리즘-
dc.subject계층적네트웍-
dc.subject하이퍼큐브-
dc.subject연결망-
dc.title(A) hierarchical hypercube network for parallel computers and a fault-tolerant routing algorithm in hypercube computers-
dc.title.alternative병렬 컴퓨터용 계층적 하이퍼큐브 네트웍과 하이퍼큐브에서의 고장허용 라우팅 알고리즘-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN101714/325007-
dc.description.department한국과학기술원 : 전기및전자공학과, -
dc.identifier.uid000845201-
dc.contributor.localauthorPark, Kyu-Ho-
dc.contributor.localauthor박규호-
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0