• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.357-358
• /
• 2008

폴디드 하이퍼스타 FHS(2n,n)은 하이퍼큐브와 그의 변형된 그래프보다 망 비용이 개선된 상호연결망이다. 본 논문에서는 폴디드 하이퍼스타 FHS(n-1,k-1)와 FHS(n-1,k) 그래프를 연결하여 폴디드 하이퍼스타 FHS(n,k)를 생성하는 방법을 제시하였다(단, n=2k). 또한, 정규 연결망 형태인 폴디드 하이퍼스타 FHS(2n,n)의 노드연결도는 n+1이고, 최대고장허용도를 가짐을 보인다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.149-157
• /
• 2009

The crossed cube, a variation of the hypercube, possesses a better topological property than the hypercube in its diameter that is about half of that of the hypercube. It has been known that an N-node complete binary tree is a subgraph of an (N+1)-node crossed cube [P. Kulasinghe and S. Bettayeb, 1995]. However, efficient embedding methods have not been known for the case that the number of nodes of the complete binary tree is greater than that of the crossed cube. In this paper, we show that an N-node complete binary tree can be embedded into an M-node crossed cube with dilation 1 and load factor [N/M], N>M$\geq$2. The dilation and load factor is optimal. Our embedding has a property that the tree nodes on the same level are evenly distributed over the crossed cube nodes. The property is especially useful when tree-structured algorithms are processed on a crossed cube in a level-by-level way.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.789-796
• /
• 2006

An unpaired many-to-many k-disjoint nth cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct sources and sinks in which each vertex of G is covered by a path. Here, a source can be freely matched to a sink. In this paper, we investigate unpaired many-to-many DPC's in a subclass of hpercube-like interconnection networks, called restricted HL-graphs, and show that every n-dimensional restricted HL-graph, $(m{\geq}3)$, with f or less faulty elements (vertices and/or edges) has an unpaired many-to-many k-DPC for any $f{\geq}0\;and\;k{\geq}1\;with\;f+k{\leq}m-2$.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.249-254
• /
• 2007

In this paper, we consider the embedding problem of postorder Fibonacci circulant. We show that Fibonacci linear array, Fibonacci mesh, Fibonacci tree, Fibonacci cubes and Hypercube are a subgraph of postorder Fibonacci circulant.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.7
• /
• pp.900-910
• /
• 1997

Multiblock structured grids are, to a large extent, capable of filling up topologically complex flow domains in an efficient way. The proposed approach enables to use different flow models in each different block and the easy incorporation of different grid refinement strategies for different blocks. Furthermore, it may be expected that this multiblock structured approach will naturally lead to the parallel executions of calculations per block on different vector processors. In this paper, the hypercube + + structure is proposed for topological informations on multiblock grids and the B-spline volume for geometrical informations. Three samples of the-three dimensional results are presented to demonstrate the capabilities of the present approach.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11a
• /
• pp.169-172
• /
• 2003

최근에 대규모 병렬컴퓨터의 새로운 위상으로 HHN(m;n,h) 그래프가 제안되었다. HHN(m;n,h) 그래프는 하이퍼큐브에 기반한 계층적인 상호 연결망이며, 노드개수가 유사한 하이퍼큐브보다 작은 노드 분지수와 작은 링크의 수를 가지고 있기 때문에 대규모 병렬 컴퓨터를 구성하는 상호 연결망이지만, 심플 라우팅 알고리즘에 기반한 경로를 구성함으로써 불필요한 라우팅 경로를 갖는 단점이 있다. 따라서 본 논문에서는 심플 라우팅 알고리즘보다 평균거리가 개선된 새로운 라우팅 알고리즘을 제안하고, HHN(3;3,2)를 기준으로 비교하였을 때 대략 32%정도 향상됨을 보인다.

• Proceedings of the Korean Statistical Society Conference
• /
• 2001.11a
• /
• pp.115-120
• /
• 2001

라틴 하이퍼큐브 실험계획은 전산실험을 위하여 Mckay, Beckman과 Conover(1979)에 의해 고안된 방법으로 실험을 한번 시행하는데 많은 시간과 비용이 들거나 인자가 많은 실험에 효율적으로 사용할 수 있다. 하지만 이 실험계획 역시 실험영역 전체에서 골고루 배치되지 않을 가능성이 있으므로 이를 보완하려는 시도가 이루어져 왔으며, 여기서는 good lattice points(glp)와 계통추출을 응용하여 격자기반(lattice-based) Lhd의 두 가지 방법을 제안하였다. 모의실험 결과 glp 실험계획을 응용한 "방법 1"은 모형을 가정한 엔트로피에 기초한 최적 기준으로 검토한 경우 우수하였다. "방법 2"는 표본조사에 널리 쓰이는 계통추출을 응용하였으며 입력변수가 각기 다른 9개의 실험함수에 관하여 표본 평균의 추정치와 분산, MSE를 비교한 결과, 다른 실험계획들보다 우수하였다. 이 결과는 실험점이 실험영역 전체에서 골고루 퍼져서 나타난 것으로 보이며, 향후 전산실험계획에서의 응용을 기대할 수 있다.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.499-510
• /
• 2004

This paper proposes a heuristic load balancing algorithm for multiprocessor systems. The algorithm minimizes the number of idle links to distribute load traffic and reduces its communication cost. Each processor iteratively tries to transfer unit load to/from every neighbor processors. However, real load transfer is collectively done after complete load traffic calculation to minimize useless traffic. The proposed algorithm can be employed in various interconnection topologies with slight modifications. In this paper, it is applied to both hypercube and mesh environments. For performance evaluation, simulation studies are performed. The performance of proposed algorithm is compared to those of two well-known algorithms. The results show that the proposed algorithm always balances the loads perfectly. Furthermore, it reduces the communication costs by $70{\%}{\~}90{\%}$ in the hypercube ; and it reduces the cost by $\75{\%}$ in the mesh, compared to existing algorithms.

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

알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.273-279
• /
• 2003

Hypercube multicomputers have been drawing considerable attention from many researchers due to their regular structure and short diameter. One of keys to the performance of Hypercube is the efficiency of communication among processors. Among several communication patterns, multicast is important, which is found in a variety of applications as data replication and signal processing. As the number of processors increases, the probability of occurrences of fault components also increases. So it would be desirable to design an efficient scheme that multicasts messages in the presence of faulty component. In fault-tolerant routing and multicast, there are local information based scheme, global information based scheme and limited information based scheme in terms of information. In general, limited information is easy to obtain and maintain by compressing information in a concise format. In this paper, we propose a new routing scheme and a new multicast scheme using recently proposed fully reachability information scheme and new local information scheme. The proposed multicast scheme increases multicast success possibility and reduce deroute cases. Experiments show that multicast success possibility can increase at least 15% compared to previous method.