• Title/Summary/Keyword: Mesh Topology

Search Result 171, Processing Time 0.028 seconds

Separated Address/Data Network Design for Bus Protocol compatible Network-on-Chip (버스 프로토콜 호환 가능한 네트워크-온-칩에서의 분리된 주소/데이터 네트워크 설계)

  • Chung, Seungh Ah;Lee, Jae Hoon;Kim, Sang Heon;Lee, Jae Sung;Han, Tae Hee
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.68-75
    • /
    • 2016
  • As the number of cores and IPs increase in multiprocessor system-on-chip (MPSoC), network-on-chip (NoC) has emerged as a promising novel interconnection architecture for its parallelism and scalability. However, minimization of the latency in NoC with legacy bus IPs must be addressed. In this paper, we focus on the latency minimization problem in NoC which accommodates legacy bus protocol based IPs considering the trade-offs between hop counts and path collisions. To resolve this problem, we propose separated address/data network for independent address and data phases of bus protocol. Compared to Mesh and irregular topologies generated by TopGen, experimental results show that average latency and execution time are reduced by 19.46% and 10.55%, respectively.

Study on the Network Architecture and the Wavelength Assignment Algorithm for All-Optical Transport Network (완전 광전달망에 적합한 망 구조와 파장 할당 알고리즘 연구)

  • 강안구;최한규;양근수;조규섭;박창수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1048-1058
    • /
    • 1999
  • This paper compares some architectures to achieve the optimized WDM architecture for all optical transport network, the comparison is presented in terms of the number of required wavelength and LT. These architecture types are PPWDM, SHWDM, DHWDM and fully optical WDM. Topology is a static ring network where the routing pattern is fixed and traffic pattern has uniform demand. This paper also proposes an algorithm for the wavelength assignment for a folly optical WDM ring network which has full mesh traffic pattern. The algorithm is based on heuristic algorithm which assigns traffic connections according to their respective shortest path. Traffic described here that is to be passed through can be routed directly within the optical layer instead of having the higher layer to handle it.

  • PDF

Crease Behavior of Thin Membrane (멤브레인의 접힘 거동 연구)

  • Woo, Kyeong-Sik
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.10
    • /
    • pp.905-911
    • /
    • 2007
  • In this paper, geometrically and materially non-linear finite element analyses were performed to study the crease behavior of thin membranes. The cross-section of the membrane was modeled with 2-dimensional plane strain elements. To simulate the creasing process, the membrane mesh was folded, compressed to prescribed crease gauge by activating two rigid contact surfaces, and then released to give the crease topology. Various crease gauges were considered to investigate the effect of crease intensity on the initial deployment angle. The crease geometry was also obtained by experiments and the results were compared.

A Multicast Routing Protocol for Reducing the Control Overhead in Mobile Ad-Hoc Networks (이동 애드-혹 네트워크 환경에서 컨트롤 오버 헤드를 줄이기 위한 멀티캐스트 라우팅 프로토콜)

  • Lim, Yu-Jin;Ahn, Sang-Hyun
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.459-465
    • /
    • 2002
  • Ad-hoc networks have the dynamic topology characteristics and most of the applications on ad-hoc networks require the group communication capability. Previously proposed multicast mechanisms on mobile ad-hoc networks build multicast-infrastructures like the tree or mesh for the group communication and these infrastructures nay cause significant overhead especially in a highly dynamic mobile ad-hoc network environment. Therefore, in this paper, we propose a new multicast mechanism supporting multicast services based on only the underlying unicast routing tables, hence any multicast-related infrastructures like trees and meshes are not required to be constructed.

A Genetic Algorithm Based Source Encoding Scheme for Distinguishing Incoming Signals in Large-scale Space-invariant Optical Networks

  • Hongki Sung;Yoonkeon Moon;Lee, Hagyu
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.2
    • /
    • pp.151-157
    • /
    • 1998
  • Free-space optical interconnection networks can be classified into two types, space variant and space invariant, according to the degree of space variance. In terms of physical implementations, the degree of space variance can be interpreted as the degree of sharing beam steering optics among the nodes of a given network. This implies that all nodes in a totally space-invariant network can share a single beam steering optics to realize the given network topology, whereas, in a totally space variant network, each node requires a distinct beam steering optics. However, space invariant networks require mechanisms for distinguishing the origins of incoming signals detected at the node since several signals may arrive at the same time if the node degree of the network is greater than one. This paper presents a signal source encoding scheme for distinguishing incoming signals efficiently, in terms of the number of detectors at each node or the number of unique wavelengths. The proposed scheme is solved by developing a new parallel genetic algorithm called distributed asynchronous genetic algorithm (DAGA). Using the DAGA, we solved signal distinction schemes for various network sizes of several topologies such as hypercube, the mesh, and the de Brujin.

  • PDF

AUTOMATED TRIANGULAR SURFACE GRID GENERATION ON CAD SURFACE DATA (CAD 형상 데이터를 이용한 물체 표면 삼각형 격자의 자동 생성 기법)

  • Lee, B.J.;Kim, B.S.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2007.04a
    • /
    • pp.103-107
    • /
    • 2007
  • Computational Fluid Dynamics (CFD in short) approach is now playing an important role in the engineering process recently. Generating proper grid system for the region of interest in time is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches. In this paper an automated triangular surface grid generation using CAD surface data is proposed According to the present method, the CAD surface data imported in the STL format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

  • PDF

A Ring-based Multicast Routing Architecture for Mobile Ad Hoc Networks (모바일 애드혹 네트워크를 위한 링 기반 멀티캐스트 라우팅 구조)

  • Heo Joon;Hong Choong Seon;Yang Yubai
    • The KIPS Transactions:PartC
    • /
    • v.11C no.7 s.96
    • /
    • pp.895-904
    • /
    • 2004
  • Due to the frequent and unpredictable topology changes, multicast still remains as challenge and no one-size-fits-all protocol could serve all kinds of needs in mobile ad hoc network. In this paper, we propose a novel scheme of Hierarchical Eulerian Ring Oriented Multicast Architecture (HEROMA) over mobile ad hoc network. It has features that concentrate on efficiency and robustness simultaneously. It is also an application-driven proposal for hazard detection. Architectures including Eulerian ring, hierarchy and multicast agent are investigated in detail Simulation results different level of improvements on control traffic, end-to-end delay and packet delivery ratio by comparing with tree-based and mesh-based multicast protocols.

Study on High Speed Routers(I)-Labeling Algorithms for STC104 (고속라우터에 대한 고찰(I)-STC104의 레이블링 알고리즘)

  • Lee, Hyo-Jong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.147-156
    • /
    • 2001
  • A high performance routing switch is an essential device to either the high performance parallel processing or communication networks that handle multimedia transfer systems such as VOD. The high performance routing chip called STC104 is a typical example in the technical aspect which has 32 bidirectional links of 100Mbps transfer sped. It has exploited new technologies, such as wormhole routing, interval labeling, and adaptive routing method. The high speed router has been applied into some parallel processing system as a single chip. However, its performance over the various interconnection networks with multiple routing chips has not been studied. In this paper, the strucrtures and characteristics of the STC104 have been investigated in order to evaluate the high speed router. Various topology of the STC104, such as meshes, torus, and N-cube are defined and constructed. Algorithms of packet transmission have been proposed based on the interval labeling and the group adaptive routing method implemented in the interconnected network. Multicast algorithms, which are often requited to the processor networks and broadcasting systems, modified from U-mesh and U-torus algorithms have also been proposed overcoming the problems of point-to-point communication.

  • PDF

Development of 2D Structural Shape Optimization Scheme Using Selective Element Method (선택적 요소 방법을 이용한 2차원 구조물의 형상 최적설계 기법 개발)

  • 심진욱;신정규;박경진
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.15 no.4
    • /
    • pp.599-607
    • /
    • 2002
  • During the shape optimization, relocations of nodes happen successively. However, excessive movement of nodes often results in the mesh distortion and eventually deteriorates the accuracy of the optimum solution. To overcome this problem, an efficient method lot the shape optimization has been developed. The method starts from the design domain which is large enough to hold the possible shape of the structure. The design domain has pre-defined uniform fine meshes. In each cycle, the method allots real properties to the elements inside the structure and nearly zero to ones outside. The performance of the method is evaluated through two examples with displacement and frequency constraints.

Dynamic On-Chip Network based on Clustering for MPSoC (동적 라우팅을 사용하는 클러스터 기반 MPSoC 구조)

  • Kim, Jang-Eok;Kim, Jae-Hwan;Ahn, Byung-Gyu;Sin, Bong-Sik;Chong, Jong-Wha
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.991-992
    • /
    • 2006
  • Multiprocessor system is efficient and high performance architecture to overcome a limitation of single core SoC. In this paper, we propose a multiprocessor SoC (MPSoC) architecture which provides the low complexity and the high performance. The dynamic routing scheme has a serious problem in which the complexity of routing increases exponentially. We solve this problem by making a cluster with several PEs (Processing Element). In inter-cluster network, we use deterministic routing scheme and in intra-cluster network, we use dynamic routing scheme. In order to control the hierarchical network, we propose efficient router architecture by using smart crossbar switch. We modeled 2-D mesh topology and used simulator based on C/C++. The results of this routing scheme show that our approach has less complexity and improved throughput as compared with the pure deterministic routing architecture and the pure dynamic routing architecture.

  • PDF