• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.35-38
• /
• 2006

데이터 웨어하우스에서는 OLAP(On-Line Analytical Processing) 연산을 제공하기 위해 다차원 데이터를 큐브의 형태로 관리한다. 특히, 공간 차원과 같이 데이터 큐브의 차원에 개념 계층이 존재하는 경우 사용자는 특정 계층에 대한 집계 결과를 요구한다. 기조의 데이터 큐브의 구조들은 차원의 개념 계층을 지원하지 못하거나 지원하더라도 시간이나 공간적 비용에 대해 비효율적이다. 본 논문에서는 공간 데이터 웨어하우스에서 공간 개념 계층을 이용하여 효율적인 계층별 영역 집계연산을 지원하는 공간 데이터 큐브를 제안한다. 이는 개념 계층을 DAG(Directed Acyclic Graph) 형태로 표현하여 구성된 여러 개의 차원들을 공간차원의 지역성을 기준으로 연결한 구조이다. 이러한 구조를 갖는 큐브를 이용하면, 데이터 검색 시 상위 계층부터 아래 방향으로 탐색하기 때문에 각 차원에 대한 효율적인 검색이 가능하다. 특히, 공간 개념 계층에 대한 DAG를 이용하면, 공간적 지역성에 따른 영역 검색을 지원할 수 있다. 성능평가에서 개념 계층이 적용된 질의에 대한 실험을 통해 제안 기법이 기존 기법들에 비해 저장 공간 효율성 및 질의 응답 성능이 우수함을 증명한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.577-580
• /
• 2008

본 논문은 차원이 증가함에 따라 분지수가 증가하는 하이퍼큐브 연결망을 분지수가 고정인 피터슨-토러스(PT) 네트워크에 임베딩 가능함을 보였다. 하이퍼큐브 $Q_{log_2n^2+3}$을 PT(n,n)에 확장율 10/8, 연장율 1.5n+2 그리고 밀집율 4n에 임베딩 하였다. 확장율은 1에 근접하도록 사상알고리즘이 설계되었고, 밀집율과 연장율은 분지수가 증가하는 하이퍼큐브의 특성 때문에 O(n)에 비례한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.335-343
• /
• 2009

The crossed cube has received great attention because it has equal or superior properties compared to the hypercube that is widely known as a versatile parallel processing system. It has been known that disjoint two copies of a mesh of size $4{\times}2^m$ or disjoint four copies of a mesh of size $8{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 [Dong, Yang, Zhao, and Tang, 2008]. However, it is not known that disjoint multiple copies of a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1 and expansion 1. In this paper, we show that disjoint $2^{n-1}$ copies of a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 where $n{\geq}1$ and $m{\geq}3$. Our result is optimal in terms of dilation and expansion that are important measures of graph embedding. In addition, our result is practically usable in allocating multiple jobs of mesh structure on a parallel computer of crossed cube structure.

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

In this paper, we propose the new torus network which has the hypercube Q3 as the basic module. The proposed Hyper-torus has the degree 4, and is the network which has the scalability, and the fine diameter. If we compare the class of the torus in the viewpoint of network cost, the hyper-torus with $1.4{\sqrt{N}}$+ 16 is proved to be approximately 65% than the torus with $4{\sqrt{N}}$ and 50% than the honeycomb with $2.45{\sqrt{N}}$. This result means that hyper-torus is better for the class of the existing mesh in the viewpoint of network cost.

• Journal of Korea Multimedia Society
• /
• v.11 no.9
• /
• pp.1227-1237
• /
• 2008

In this paper, we analyze topological properties and embedding of Folded Hyper-Star network to further improve the network cost of Hypercube, a major interconnection network. Folded Hyper-Star network has a recursive expansion and maximal fault tolerance. The result of embedding is that Folded Hypercube $FQ_n$ and $n{\times}n$ Torus can be embedded into Folded Hyper-Star FHS(2n,n) with dilation 2. Also, we show Folded Hyper-Star FHS(2n,n) can be embedded into Folded Hypercube $FQ_{2n-1}$ with dilation 1.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.87-99
• /
• 1998

In the multicasting communications, the quality of service is not guaranteed occasionally, according to the shortage of resources, because all resources such as communication buffer, processing power for the packet multiplication, and bandwidth, should be shared among each members. This problem can be solved through the hierarchical multicaster construction mechanism which guarantees that all multicaster can be operated within the required performance. This paper proposes the architecture of multipoint communication server based on hypercube type massively parallel computer. Through the simulation, it is verified that the traffic of links between each node of hypercube computer is under the some bandwidth. So, it is certified that the hypercube computer is suitable for the multicast communication servers supporting the various groups.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.161-164
• /
• 2003

n-차원 스타 그래프와 펜케익 그래프의 노드 개수는 n!개로서, 하이퍼큐브가 갖는 좋은 성질을 가지면서 하이퍼큐브 보다 망 비용이 적은 값을 갖는 상호연결망이다. 본 논문에서는 스타 그래프와 팬케익 그래프가 동일한 노드 개수를 가질 때, 두 그래프의 에지 정의를 이용하여 스타 그래프 $S_n$을 팬케익 그래프 $P_n$에 연장율 4, 확장율 1에 임베딩 가능함을 보이고. 펜케익을 매크로-스타에 임베딩 하는 비용이 O(n)임을 보인다.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.2
• /
• pp.115-124
• /
• 2014

Hypercube and star graph are widely known as interconnection network. The embedding of an interconnection network is a mapping of a network G into other network H. The possibility of embedding interconnection network G into H with a low cost, has an advantage of efficient algorithms usage in network H, which was developed in network G. In this paper, we provide an embedding algorithm between HCN and HON. HCN(n,n) can be embedded into HON($C_{n+1},C_{n+1}$) with dilation 3 and HON($C_d,C_d$) can be embedded into HCN(2d-1,2d-1) with dilation O(d). Also, star graph can be embedded to half pancake's value of dilation 11, expansion 1, and average dilation 8. Thus, the result means that various algorithms designed for HCN and Star graph can be efficiently executed on HON and half pancake, respectively.

• The KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.223-226
• /
• 2009

The twisted cube has received great attention as an interconnection network of parallel systems because it has several superior properties, especially in diameter, to the hypercube. It was recently known that, for even m, a mesh of size $2{\times}2^m$ can be embedded into a twisted cube with dilation 1 and expansion 1 and a mesh of size $4{\times}2^m$ with dilation 1 and expansion 2 [Lai and Tsai, 2008]. However, as we know, it has been a conjecture that a mesh with more than eight rows and columns can be embedded into a twisted cube with dilation 1. In this paper, we show that a mesh of size $2^n{\times}2^m$ can be embedded into a twisted cube with dilation 1 and expansion $2^{n-1}$ for even m and with dilation 1 and expansion $2^n$ for odd m where $1{\leq}n{\leq}m$.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.301-308
• /
• 2008

The crossed cube has received great attention because it has equal or superior properties to the hypercube that is widely known as a versatile parallel processing system. It has been known that a mesh of size $2{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion 1 and a mesh of size $4{\times}2^m$ with dilation 1 and expansion 2. However, as we know, it has been a conjecture that a mesh with more than eight rows and columns can be embedded into a crossed cube with dilation 1. In this paper, we show that a mesh of size $2^n{\times}2^m$ can be embedded into a crossed cube with dilation 1 and expansion $2^{n-1}$ where $n{\geq}1$ and $m{\geq}3$.