• Title/Summary/Keyword: 클러스터 구조

Search Result 596, Processing Time 0.023 seconds

The Cluster Characterization on the Domain Decomposition Algorithms (클러스터 구조 특성에 따른 영역분할 알고리즘)

  • Park, Tae-Hyo;Tak, Moon-Ho;Lee, Kyung-Jae
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2011.04a
    • /
    • pp.635-638
    • /
    • 2011
  • 유한요소법은 편미분방정식(Partial Differential Equation)의 수치적 근사 해를 구하기 위한 가장 일반적이고 효율적인 방법으로 다양한 공학 분야에서 널리 사용되어지고 있다. 유한요소법의 해석은 연속적인 범위를 가지는 문제를 여러 개의 요소로 나누어 다항식의 형상함수를 만들게 되며 결과적으로 근사 해를 구하게 된다. 이때 해석의 정확성을 높이기 위하여 형상함수의 차수를 높이고 요소의 개수를 늘리게 되면, 이에 따른 수치 계산량의 급격한 증가로 인해 수치해석의 효율성은 떨어지게 된다. 이를 보완하기 위해 유한요소법에 영역분할기법을 적용하여 병렬해석을 수행하면 해의 정확성과 효율성을 동시에 높인다. 병렬해석을 수행하는데 있어서 클러스터의 구조적 특성은 해석의 효율성에 영향을 미치게 된다. 따라서 본 논문에서는 일반적인 모델에 대하여 병렬해석의 수행을 통하여 클러스터의 구조적 특성이 병렬해석의 효율성에 미치는 영향에 대해 확인한다.

  • PDF

A Methodology for Performance Modeling and Prediction of Large-Scale Cluster Servers (대규모 클러스터 서버의 성능 모델링 및 예측 방법론)

  • Jang, Hye-Churn;Jin, Hyun-Wook;Kim, Hag-Young
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1041-1045
    • /
    • 2010
  • Clusters can provide scalable and flexible architectures for parallel computing servers and data centers. Their performance prediction has been a very challenging issue. Existing performance measurement methodologies are able to measure the performance of servers already constructed. Thus they cannot provide a way to predict the overall system performance in advance when designing the system at the initial phase or adding more nodes for more capacity. Therefore, the performance modeling and prediction methodology for large-scale clusters is highly required. In this paper, we suggest a methodology to predict the performance of large-scale clusters, which consists of measurement, modeling and prediction steps. We apply the methodology to a real cluster server and show its usefulness.

A Design and Implementation of Cache Coherence Protocol for Hierarchical Cluster Architecture (계층 클러스터 구조를 위한 캐쉬 일관성 프로토콜의 설계 및 구현)

  • 박신민;최창훈;김성천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1282-1295
    • /
    • 1994
  • In this paper, a hierarchical cluster multiprocessor system based on a hierarchical bus system is proposed and its cache coherency protocol is designed and implemented. The hierarchical cluster architecture aims at elimination the system bottleneck of the existing single bus system by adding a hierarchy of buses as the number of clusters is increased. Therefore the system is easy to scale up to a large number of processors. The proposed cache protocol is designed to be adapted to the general N-level (N>2) hierarchical cluster architecture. The original pended protocol is extended to implement the cache protocol on the system bus and cache coherency operations for this protocol are explained.

  • PDF

A Study on the Spatial Characteristics of the Business Services Cluster in Metropolitan Seoul (대도시 사업서비스업클러스터의 공간적 특성에 관한 연구)

  • Pak Rae-Hyeon;Jeong Byeong-Sun
    • Journal of the Economic Geographical Society of Korea
    • /
    • v.8 no.2
    • /
    • pp.195-215
    • /
    • 2005
  • This study was carried into execution to analyze Spatial Characteristics of Seoul Business Services Cluster in circumstance of local economic development led by knowledge-intensive business services. The analysis was performed for industrial agglomeration and companies' linkage and network. As the result, there are three business services cluster, including the largest one in Gang-Nam Gu, Seoul, and for last 10 years, there has been increasing development of business services cluster. In the meanwhile, their linkage and network have not been performed briskly. Therefore, from now on, a plan that can help companies' linkage and network performed inside of cluster to have active and international structure has to be considered in cluster policy.

  • PDF

An Efficient Data Aggregation Method in Clustered Sensor Network (클러스터 구조의 센서 네트워크에서 효율적인 데이터 모음 기법)

  • Jee, Jae-Kyoung;Ha, Rhan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.220-222
    • /
    • 2005
  • 배터리를 사용하여 정보의 처리와 센싱 작업을 수행하는 무선 센서 네트워크를 오래 동안 가동시키기 위해서 한정된 자원을 효율적으로 사용할 수 있는 여러 기술들이 제안되고 있다. 이런 기법들 중 클러스터를 구성하거나, 데이터 모음 기법을 수행하여 중복된 데이터를 하나의 패킷으로 압축하여 전송 횟수를 줄이면 에너지 절감 효과를 볼 수 있다. 본 논문에서는 클러스터 구조를 이루고 있는 센서 네트워크에서 두개 이상의 클러스터가 중복된 지역을 센싱 할 경우 발생하는 중복 데이터 제거 기법을 제안한다. 제안하는 기법은 Meta-data를 사용한 사전 교섭으로 동일한 정보가 각각 다른 클러스터에 전송되는 것을 방지하여 에너지 절감 효과를 볼 수 있다. 또한, 클러스터 내에서 발생하는 다른 정보들을 시간 지연 기법을 사용하여 하나의 패킷으로 데이터 모음을 수행하는 기법도 제안한다. 성능 평가를 통해 제안하는 알고리즘은 기존의 기법에 비하여 지연 시간과 에너지 소모 면에서 모두 효율적인 것을 확인할 수 있다.

  • PDF

A Secure Cluster Formation Scheme in Wireless Sensor Networks (무선 센서 네트워크에서 안전한 클러스터 구성 방안)

  • Wang, Gi-Cheol;Cho, Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.84-97
    • /
    • 2012
  • In wireless sensor networks, cluster structure brings on many advantages such as load balancing, energy saving, and distributed key management, and so on. To transform a physical network into the cluster structure, sensor nodes should invoke a cluster formation protocol. During the protocol operation, if some nodes are compromised and they do not conform to the protocol, an inconsistency of membership in a cluster happen. This splits the cluster and consequently increases the number of clusters and decreases the number of members in the cluster. In this paper, we propose a scheme which well copes with such a problem. First, our scheme generates two hop clusters where hop distance between any two nodes is at most two. Besides, our scheme employs verification of two hop distant nodes to prevent the cluster split induced by compromised nodes. Last, our scheme mainly employs broadcast transmissions to reduce energy consumption of nodes. Simulation results have proven that our scheme reduces the number of clusters and more secure and energy-efficient than other scheme.

Distributed Call Processing Architecture in the ATM-based PCS (ATM기반의 PCS에서 분산 호 분석)

  • 홍용표;정부영김구수이진
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.78-81
    • /
    • 1998
  • 본 논문에서는 위치 등록 빈도의 증가를 해결할 수 있는 클러스터 개념을 이용한 위치 등록 프로토콜의 성능을 분석하고, 클러스터 크기와 시간의 흐름에 따른 위치 등록 확률을 계산하여 클러스터 크기와 위치 등록율의 관계를 정량적으로 분석하였으며, 실제로 육각형 셀 구조에 적용하여 위치 등록 확률을 클러스터의 크기에 따라 구해 보고 시뮬레이션을 통해 이를 검증하였다.

  • PDF

The Design and Implementation of RISE for Managing a Large Scale Cluster in Distributed Environment (분산 환경의 대규모 클러스터를 관리하기 위한 RISE 시스템의 설계 및 구현)

  • Park Doo-Sik;Yang Woo-Jin;Ban Min-Ho;Jeong Karp-Joo;Lee Jong-Hyun;Lee Sang-Moon;Lee Chang-Sung;Shin Soon-Churl;Lee In-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.421-428
    • /
    • 2006
  • In this paper, the way of remote installation and back-up of 3-tier structure is introduced for efficient utilizing the cluster system resources distributed at several places. Recently, cluster system is constructed as the system of over hundreds nodes under complex network system mixed with public networks and private networks. Therefore, the as installation method suitable for the large scale cluster system and the remote recovery of failure nodes are important. However the previous researches which are based on 2-tier architecture may not provide the efficient cluster installation and image back-up method when the network of cluster system is composed of several private networks and public networks. In this paper, RISE (Remote Installation Service and Environment) based on the 3-tier architecture is proposed to solve this problem. In our approach, the managing node's role is divided into the global master node (GRISE) and the local master node (LRISE) to provide the efficient initial system deployment and remote failure recovery of distributed cluster system under the various network systems. Also, LRISE's availability is ensured under the complex network environments by adopting the auto-synchronization mechanism between GRISE and LRISE. In this work, a 64-node cluster system with gigabit network system is utilized for the experiment. From the experimental result, the system image with 1.86GB data can be obtained in 5 minutes and 53 seconds and the image-based installation of 64-node system can be carried out in 17 minutes and 53 seconds.

A Composite Cluster Analysis Approach for Component Classification (컴포넌트 분류를 위한 복합 클러스터 분석 방법)

  • Lee, Sung-Koo
    • The KIPS Transactions:PartD
    • /
    • v.14D no.1 s.111
    • /
    • pp.89-96
    • /
    • 2007
  • Various classification methods have been developed to reuse components. These classification methods enable the user to access the needed components quickly and easily. Conventional classification approaches include the following problems: a labor-intensive domain analysis effort to build a classification structure, the representation of the inter-component relationships, difficult to maintain as the domain evolves, and applied to a limited domain. In order to solve these problems, this paper describes a composite cluster analysis approach for component classification. The cluster analysis approach is a combination of a hierarchical cluster analysis method, which generates a stable clustering structure automatically, and a non-hierarchical cluster analysis concept, which classifies new components automatically. The clustering information generated from the proposed approach can support the domain analysis process.

An Energy-Efficient Clustering Algorithm consider Minimum-hop in Hierarchical Sensor Network (계층구조 센서 네트워크에서 Minimun-hop 을 고려한 클러스터 구성 알고리즘)

  • Kim, Yong;Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.510-513
    • /
    • 2010
  • In hierarchical wireless sensor network, Sensor nodes forming a cluster with a hierarchy. And there are being study for balanced energy consumption between cluster nodes. When forming network routing path, if there are configured incorrectly then it can be wasting energy. In this paper to solve these problem, We propose that it can consider sensor's communication range to create minimum hop layer when cluster heads configure routing path.

  • PDF