• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.663-666
• /
• 2007

본 논문에서는 하이퍼큐브보다 망비용이 개선된 Folded 하이퍼큐브 연결망과 오드 연결망 사이의 임베딩을 분석한다. Folded 하이퍼큐브 $FQ_n$을 오드 연결망 $O_{2n+1}$에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망 $O_d$을 Folded 하이퍼큐브 $FQ_{2d-1}$에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.242-250
• /
• 1996

Communications on hypercube nodes are done by explicit message routing. So efficient message routing is very important for the performance of hypercube multicomputers. However, hypercube nodes can be faulty due to hardware and/o r software problems, which is called an injured hypercube. A reliable hypercube system should tolerate the problems. One of the methods to enhance reliability on injured hypercube is to use fault-tolerant message routing algorithms. In this paper, we propose a message routing algorithm with possible shortest distance using disjoint paths. To analyze the performance, the algorithm is simulated and evaluated.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3099-3108
• /
• 1998

본 논문에서는 새로운 다중 컴퓨터의 위상으로 하이퍼-스타 그래프를 제안하고, 하이퍼-스타 그래프에 대하여 주요 망 척도인 분지수, 연결도, 확장성, 라우팅, 지름, 임베딩 등의 특징을 분석한다. 하이퍼-스타 그래프 HS(2n,n)에 에지를 한 개 추가한 folded 하이퍼-스타 그래프 FHS(2n,n)은 2nCn개의 노드를 갖고 널리 알려진 상호 연결망인 하이퍼큐브에 비해 상대적으로 분지수와 지름이 작은 값을 갖는 연결망이다. Folded 하이퍼-스타 그래프 FHS(2n,n)가 하이퍼큐브 Qn이 같은 노드 수를 가질 때 분지수$\times$지름에 대한 척도에 있어서 은 n2/2보다 작고, 하이퍼큐브 Qn와 그의 변형들보다 연결망의 망 비용에 있어서 우수함을 의미한다. 또한 하이퍼큐브 Qn과 n$\times$n 토러스를 하이퍼-스타 그래프 HS(2n,n)에 연장비율 2에 임베딩하는 방법을 보인다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.151-154
• /
• 2013

In this paper, we will analyze embedding between Folded Hypercube and HFH. We will show Folded Hypercube $FQ_{2n}$ can be embedded into HFH($C_n,C_n$) with dilation 4, expansion $\frac{(C_n)^2}{2^{2n}}$ and HFH($C_d,C_d$) can be embedded into $FQ_{4d-2}$ with dilation O(d).

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.341-346
• /
• 2004

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.5
• /
• pp.1180-1192
• /
• 1996

On demand of many users, basic networks of a parallel computer system are required to have a property that can embed various topologies. Bisectional interconnection network is known to satisfy this property, and it can embed various topologies optimally. Nowadays one is very interested in the hypercube as a message pssing multicomputer system, so it is very important to implement a hypercube in bisectional network. In this paper, a hypercube is implemented in a versatile bisecional netork, and its routing and broadcasting algorithm are proposed. Conventional bisectional network can accomodata linear array, complete binary tree and mesh structure as its topology. Now hypercube is implemented to be utilized as a general purpose supercomputercommunication architecture. The proposed routing and broadcasting algorithm embedded in bisectional network are general purpose algorithms which satisfy property of conventional hypercube.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.583-585
• /
• 2001

하이퍼큐브의 정규적이며 계층적인 구조적 특성은 효율적인 진단 알고리즘 개발에 유리하게 적용될 수 있다. Feng et al.의 HADA/IHADA와 Choi와 Rhee의 적응적 큐브 분할 방법은 하이퍼큐브의 전체 노드를 하나의 링으로 임베딩하여 링의 진단 특성을 이용하기 위하여 분할 및 정복 방법을 이용하였다. 또한 Kranakis와 Pelc는 결함을 모두 포함하는 최소의 서브링을 하나의 노드로 하는 하이퍼큐브의 형태로 분할하는 HYP-DIAG 알고리즘을 제안하였다. 또한 최악의 경우에, 테스트 수만을 고려하여 2$^n$+3n/2의 테스트 수를 갖는 FAST-HYP-DIAG 알고리즘과 병렬 시간만을 고려하여 많아야 11테스트 라운드 이내에 진단을 수행하는 EXPRESS-HYF-DIAG 알고리즘을 제안하였다. 본 논문에서는 HYP-DIAG의 첫 번째 단계에서 얻어진 서브링들의 신드롬을 분석하여 테스트의 수와 테스트 라운드를 모두 고려하는 알고리즘을 제안한다.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.263-268
• /
• 2007

In this paper, we analyze some topological properties of Folded Hyper-Star FHS(2n,n). First, we prove that FHS(2n,n) has maximal fault tolerance, and broadcasting time using double rooted spanning tree is 2n-1. Also we show that FHS(2n,n) can be embedded into Folded hypercube with dilation 1, and Folded hypercube can be embedded into FHS(2n,n) ith dilation 2 and congestion 1.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.117-129
• /
• 2003

In this paper, we propose advanced parallel join algorithm to efficiently process join operation on hypercube systems. This algorithm uses a broadcasting method in processing relation R which is compatible with hypercube structure. Hence, we can present optimized parallel join algorithm for that hypercube structure. The proposed algorithm has a complete solution of two essential problems - load balancing problem and data skew problem - in parallelization of join operation. In order to solve these problems, we made good use of the characteristics of clustering effect in the algorithm. As a result of this, performance is improved on the whole system than existing algorithms. Moreover. new algorithm has an advantage that can implement non-equijoin operation easily which is difficult to be implemented in hash based algorithm. Finally, according to the cost model analysis. this algorithm showed better performance than existing parallel join algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.637-640
• /
• 2000

본 논문에서는 하이퍼큐브보다 망비용이 개선된 HFN(n,n)과 2n-hypercube 사이의 임베딩을 분석한다. 2n-hypercube를 HFN(n,n)에 연장율 3에 임베딩 가능함을 보이고, HFN(n,n)을 2n-hypercube에 임베딩하는 비용이 O(n)임을 보인다.