• Title/Summary/Keyword: 밀집 연결

Search Result 95, Processing Time 0.032 seconds

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.

Embedding Algorithms among $2^{2n-k}\times2^k$ Torus and HFN(n,n) ($2^{2n-k}\times2^k$ 토러스와 HFN(n,n)의 상호 임베딩)

  • Kang, Min-Sik;Kim, Jong-Seok;Lee, Hyeong-Ok;Heo, Yeong-Nam
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11a
    • /
    • pp.111-114
    • /
    • 2002
  • 임베딩은 어떤 연결망이 다른 연결망 구조에 포함 혹은 어떻게 연관되어 있는지를 알아보기 위해 어떤 특정한 연결망을 다른 연결망에 사상하는 것으로, 특정한 연결망에서 사용하던 여러 가지 알고리즘을 다른 연결망에서 효율적으로 이용할 수 있도록 한다. 본 논문에서는 $2^{2n-k}\times2^k$ 토러스를 HFN(n,n)에 연장율 3, 밀집율 4 로 임베딩 가능함을 보이고, HFN(n,n)을 $2^{2n-k}\times2^k$ 토러스에 연장율 O(N)으로 임베딩됨을 보인다($N=2^n$).

  • PDF

Efficient Construction of Euclidean Minimum Spanning Tree Using Partial Polynomial-Time Approximation Scheme in Unequality Node Distribution (비 균등 노드 분포환경에서 부분 PTAS를 이용한 효과적인 유클리드 최소신장트리 생성)

  • Kim, In-Bum;Kim, Soo-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.6
    • /
    • pp.71-80
    • /
    • 2014
  • Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.

Routing Congestion Driven Placement (배선밀집도 드리븐 배치)

  • Oh Eun-Kyung;Hur Sung-Woo
    • The KIPS Transactions:PartA
    • /
    • v.13A no.1 s.98
    • /
    • pp.57-70
    • /
    • 2006
  • This paper describes a new effective algorithm to estimate routing congestion and to resolve highly congested regions for a given detailed placement. The major features of the proposed technique can be summarized as follows. Firstly, if there are congested regions due to some nets which pass through the regions it can determine which cells affect those congested spots seriously and moves some of them to resolve congestion effectively. Secondly, since the proposed technique uses the ripple movement technique to move cells it resolves congestion without sacrificing wire length. Thirdly, we use an efficient incremental data structure to trace the changes in congestion and wire length as cells move. Hence, selection of cells to move could be very accurate and fast in the course of iteration. Finally, although an MST net model is used to resolve congestion in this paper, proposed technique can be work with any net model. Particularly, if proposed technique can obtain routing information from a real router, congestion can be resolved more effectively. Experimental results show that the proposed technique can resolve congestion effectively and efficiently without sacrificing wire length.

Analysis of Distribution and Highly Density Area Pattern of One-Person Household : Pusan Metropolitan's Case (1인가구 분포 및 밀집지역 유형 분석 : 부산광역시 사례)

  • Choi, Yeol;Shin, Jong Hun;Park, Won Jeon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.32 no.6D
    • /
    • pp.655-662
    • /
    • 2012
  • The aim of this study is to analyze tthe pattern of compacted area and the distribution characteristics in one-person household. Through ArcGis, we collect the basic data and classify the compact area in accordance with the pattern employing Ward method out of cluster analysis. The main results are found as follows; First, the station sphere type is located around Seomyun and Nampo-dong, which are the main CBD( Central Business District) This type must be essentially considered in residential plan for one-person household location. Second, the district oriented type is located around the subway and it has relatively better residential facilities and environments. Third, it is found that the younger worker including students resided in one room and villa in the type around university. Forth, the foreign workers and domestic workers in small and medium factory resided in the factory centered type which is far from the station sphere. Lastly, it is dormitory type which is isolated from the CBD, and insteadly amenable and well natural environment area, but students and workers in this area where there are lacking life-related facilities and aside from accessibilities feel uncomfortable.

Technical Trends of Small Cells for UDN (UDN을 위한 소형셀 기술동향)

  • Moon, J.M.;Na, J.H.;Kwon, D.S.
    • Electronics and Telecommunications Trends
    • /
    • v.31 no.1
    • /
    • pp.36-44
    • /
    • 2016
  • 5G에서는 광대역 서비스뿐만 아니라 저지연 및 신뢰성 보장 서비스 등 새로운 서비스들을 정의하고 있으며 이를 제공하기 위한 다양한 후보 기술에 대한 논의가 이루어지고 있다. 5G에서는 기지국의 셀 크기가 작은 스몰셀 기지국을 기반으로 대규모 데이터 트래픽을 수용하기 위하여 밀집한 형태의 셀 구조를 가지며 각 기지국의 셀들은 무선전송방식도 서로 다를 수 있을 것으로 예상된다. 이러한 밀집한 형태의 소형셀은 5G의 핵심 기술요소의 하나로 고려되고 있다. 5G 소형셀 연구는 5G 핵심 제공능력 중 단위 면적당 트래픽 용량 증대, 사용자 체감 전송률 증대, 에너지 절감에 기여하며 부가적으로 지연 절감과 연결 밀도 증대에도 기여할 수 있는 분야이다.

  • PDF

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

  • Seo, Jung-Hyun;Lee, Hyeong-Ok;Jang, Moon-Suk
    • 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)에 비례한다.

A Genetic Algorithm for Cooperative Communication in Ad-hoc Networks (애드혹 네트워크에서 협력통신을 위한 유전 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.201-209
    • /
    • 2014
  • This paper proposes a genetic algorithm to maximize the connectivity among the mobile nodes for the cooperative communication in ad-hoc networks. In general, as the movement of the mobile nodes in the networks increases, the amount of calculation for finding the solution would be too much increased. To obtain the optimal solution within a reasonable computation time for a high-density network, we propose a genetic algorithm to obtain the optimal solution for maximizing the connectivity. In order to make a search more efficient, we propose some efficient neighborhood generating operations of the genetic algorithm. We evaluate those performances through some experiments in terms of the maximum number of connections and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

Embedding Algorithms Hypercube, HCN, and HFN into HFCube Interconnection Networks (상호연결망 HFCube와 하이퍼큐브, HCN, HFN 사이의 임베딩 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1361-1368
    • /
    • 2014
  • In this paper, we analyze emddings among HFCube(n,n), HCN(n,n), HFN(n,n) with lower network cost than that of Hypercube. The results are as follows. We propose that $Q_{2n}$ can be embedded into HFCube(n,n) with dilation 5, congestion 2. HCN(n,n) and HFN(n,n) are subgraphs of HFCube(n,n). HFCube(n,n) can be embedded into HFN(n,n) with dilation 3. HFCube(n,n) can be embedded into HCN(n,n) with dilation O(n). The results will be helpful to analyze several efficient properties in each interconnection network.

Experimental Test on Coner Rigid Joint Connection Method for Underground Roadway Structure (지하차도 구조물의 우각부 연결장치에 대한 실험적 평가)

  • Kim, Sung Bae;Kim, Jang Ho Jay;Kim, Tae Kyun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.33 no.1
    • /
    • pp.23-34
    • /
    • 2013
  • In this study, a safe, economic, and rapid construction method of underground roadway using PSC girder is developed to reduce traffic congestion and maximize space usage in urban area. For an efficient application of the method, a rigid joint connection is proposed and tested. For the testing, cantilever specimens were used to verify its capacity. The parameters for this study were cross beam length and joint connection type. The results of the test showed that the proposed connection system has superior performances. Despite having differences of cross beam length and joint connection type, the stable flexural behavior was shown in all of the tested specimens. Also, the behaviors of PSC girders and upper slabs connected by the proposed method showed superior performance. Moreover, the improvement of structure performance according to the increase of length of cross beams has been verified.