• Title/Summary/Keyword: 연장율

Search Result 516, Processing Time 0.03 seconds

Embedding a Mesh of Size 2n ×2m Into a Twisted Cube (크기 2n ×2m인 메쉬의 꼬인 큐브에 대한 임베딩)

  • Kim, Sook-Yeon
    • 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$.

Embedding Multiple Meshes into a Crossed Cube (다중 메쉬의 교차큐브에 대한 임베딩)

  • Kim, Sook-Yeon
    • 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.

Embedding Torus into Petersen-Torus(PT) Networks (토러스를 피터슨-토러스(PT) 네트워크에 임베딩)

  • Seo, Jung-Hyun;Lee, Hyeong-Ok;Jang, Moon-Suk;Han, Soon-Hee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.573-576
    • /
    • 2008
  • 본 논문은 분지수가 상수인 토러스를 피터슨-토러스 네트워크에 임베딩 가능함을 보인다. 토러스 T(5m, 2n)는 PT(m, n)에 연장율 5, 밀집율 5 그리고 확장율 1에 임베딩 가능함을 보였다. 추가로 토러스를 PT에 평균 연장율 3이하에 임베딩 가능함을 보였다. 널리 알려진 토러스 네트워크를 연장율과 밀집율을 5이하에 PT에 임베딩 함으로써 웜홀 라우팅 방식과 store-and-forward 방식 모두에서 임베딩 알고리즘이 사용 가능하고, 일대일 임베딩을 함으로써 시뮬레이션시 프로세서 작업 처리량을 최소화 하였다.

Embedding Algorithms between Even network and Odd network (이븐 연결망과 오드 연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.659-662
    • /
    • 2007
  • 알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

  • PDF

Embedding Algorithms among Folded hypercube Network and Odd network (Folded 하이퍼큐브 연결망과 오드 연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • 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에 임베딩 가능함을 보인다.

  • PDF

Embedding Algorithms between Folded Hypercube network and Even network (Folded하이퍼큐브 연결망과 이븐연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.11a
    • /
    • pp.667-670
    • /
    • 2007
  • 알고리즘의 설계에 있어서 주어진 연결망을 다른 연결망으로 임베딩하는 것은 알고리즘을 활용하는 중용한 방법중의 하나이다. 본 논문에서는 하이퍼큐브보다 망비용이 개선된 이븐 연결망과 오드 연결망 사이의 임베딩을 분석하고, 이븐 연결망이 이분할 연결망임을 보인다. 이븐 연결망을 오드 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보이고, 오드 연결망을 이븐 연결망에 연장율 2, 밀집율 1에 임베딩 가능함을 보인다.

  • PDF

Embedding Mesh-Like Networks into Petersen-Torus(PT) Networks (메쉬 부류 네트워크를 피터슨-토러스(PT) 네트워크에 임베딩)

  • Seo, Jung-Hyun;Lee, Hyeong-Ok;Jang, Moon-Suk
    • The KIPS Transactions:PartA
    • /
    • v.15A no.4
    • /
    • pp.189-198
    • /
    • 2008
  • In this paper, we prove mesh-like networks can be embedded into Petersen-Torus(PT) networks. Once interconnection network G is embedded in H, the parallel algorithm designed in Gcan be applied to interconnection network H. The torus is embedded into PT with dilation 5, link congestion 5 and expansion 1 using one-to-one embedding. The honeycomb mesh is embedded into PT with dilation 5, link congestion 2 and expansion 5/3 using one-to-one embedding. Additional, We derive average dilation. The embedding algorithm could be available in both wormhole routing system and store-and-forward routing system by embedding the generally known Torus and honeycomb mesh networks into PT at 5 or less of dilation and congestion, and the processor throughput could be minimized at simulation through one-to-one.

Symmetry and Embedding Algorithm of Interconnection Networks Folded Hyper-Star FHS(2n,n) (상호연결망 폴디드 하이퍼-스타 FHS(2n,n)의 대칭성과 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • The KIPS Transactions:PartA
    • /
    • v.16A no.6
    • /
    • pp.501-508
    • /
    • 2009
  • In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.

Embedding Algorithm between [ 22n-k×2k] Torus and HFN(n,n), HCN(n,n) ([ 22n-k×2k] 토러스와 HFN(n,n), HCN(n,n) 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Kang, Min-Sik
    • The KIPS Transactions:PartA
    • /
    • v.14A no.6
    • /
    • pp.327-332
    • /
    • 2007
  • In this paper, we will analysis embedding between $2^{2n-k}{\times}2^k$ torus and interconnection networks HFN(n,n), HCN(n,n). First, we will prove that $2^{2n-k}{\times}2^k$ torus can be embedded into HFN(n,n) with dilation 3, congestion 4 and the average dilation is less than 2. And we will show that $2^{2n-k}{\times}2^k$ torus can be embedded into HCN(n,n) with dilation 3 and the average dilation is less than 2. Also, we will prove that interconnection networks HFN(n,n) and HCN(n,n) can be embedded into $2^{2n-k}{\times}2^k$ torus with dilation O(n). These results mean so many developed algorithms in torus can be used efficiently in HFN(n,n) and HCN(n,n).

Embedding Algorithm among Folded Hypercube, Even Network and Odd Network (폴디드 하이퍼큐브와 이븐연결망, 오드연결망 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Sim, Hyun;Lee, Hyeong-Ok
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.7
    • /
    • pp.318-326
    • /
    • 2008
  • In this paper, we will analyze embedding among Folded Hypercube, Even Network and Odd Network to further improve the network cost of Hypercube. We will show Folded Hypercube $FQ_n$ can be embedded into Even Network $E_{n-1}$ with dilation 2, congestion 1 and Even Network $E_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 1. Also, we will prove Folded Hypercube $FQ_n$ can be embedded into Odd Network $O_{n-1}$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $FQ_{2d-3}$ with dilation 2, congestion 1. Finally, we will show Even Network $E_d$ can be embedded into Odd Network $O_d$ with dilation 2, congestion 1 and Odd Network $O_d$ can be embedded into Folded Hypercube $E_{d-1}$ with dilation 2, congestion 1.