• Title/Summary/Keyword: PC-based Cluster

Search Result 127, Processing Time 0.025 seconds

PARALLEL IMPROVEMENT IN STRUCTURED CHIMERA GRID ASSEMBLY FOR PC CLUSTER (PC 클러스터를 위한 정렬 중첩 격자의 병렬처리)

  • Kim, Eu-Gene;Kwon, Jang-Hyuk
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.10a
    • /
    • pp.157-162
    • /
    • 2005
  • Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

  • PDF

Implementation of Scheduling Strategies on PC Clusters (PC 클러스터에서 스케줄링 기법의 구현)

  • Kang Oh-Han;Song Hee-Heon;Chung Joong-Soo
    • The KIPS Transactions:PartA
    • /
    • v.11A no.7 s.91
    • /
    • pp.521-528
    • /
    • 2004
  • In this-paper, we propose a new task scheduling scheme for bus-based cluster architectures and analyze performance of the scheduling scheme which has been implemented in a PC cluster. The implemented scheme schedules the tasks of a task graph to the processors of a PC cluster, and it reduces parallel execution time by selectively duplicating critical tasks using heuristic. Experimental results show that the proposed scheduling scheme produces better parallel execution time than the other scheduling scheme.

The PC Clustering of the SIMD Structure for a Distributed Process of On-line Contingency (온라인 선로상정사고 분산처리를 위한 SIMD 구조의 PC 클러스터링)

  • Jang, Se-Hwan;Kim, Jin-Ho;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.7
    • /
    • pp.1150-1156
    • /
    • 2008
  • This paper introduces the PC clustering of the SIMD structure for a distributed processing of on-line contingency to assess a static security of a power system. To execute on-line contingency analysis of a large-scale power system, we need to use high-speed execution device. Therefore, we constructed PC-cluster system using PC clustering method of the SIMD structure and applied to a power system, which relatively shows high quality on the high-speed execution and has a low price. SIMD(single instruction stream, multiple data stream) is a structure that processes are controlled by one signal. The PC cluster system is consisting of 8 PCs. Each PC employs the 2 GHz Pentium 4 CPU and is connected with the others through ethernet switch based fast ethernet. Also, we consider N-1 line contingency that have high potentiality of occurrence realistically. We propose the distributed process algorithm of the SIMD structure for reducing too much execution time on the on-line N-1 line contingency analysis in the large-scale power system. And we have verified a usefulness of the proposed algorithm and the constructed PC cluster system through IEEE 39 and 118 bus system.

Design & Implementation of a PC-Cluster for Image Feature Extraction of a Content-Based Image Retrieval System (내용기반 화상검색 시스템의 화상 특징 추출을 위한 PC-Cluster의 설계 및 구현)

  • 김영균;오길호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.700-702
    • /
    • 2004
  • 본 논문에서는 내용 기반의 화상 검색 시스템을 위한 화상 특징 추출을 고속으로 수행하기 위하여 TCP/IP 프로토콜을 사용하는 LAN 환경에서 유휴(Idle) PC들을 사용한 PC 클러스터에 관해 연구하였다. 실험에 사용한 화상 특징(Image feature)으로서는 칼라의 응집도를 사용하는 CCV(Color Coherence Vector), 화상의 엔트로피를 정량화한 PIM(Picture Information Measure), Gaussian-Laplacian 에지 검출 연산을 사용한 SEV(Spatial Edge Histogram Vector)로서 이들을 추출하기 위한 Task를 Master rude에서 Slave rude들로 전송하고, 연산에 사용 될 화상 데이터를 전송한 후 연산을 수행하고 결과를 다시 Master node로 전송하는 전통적인 Task-Farming형태의 PC Cluster를 구성하였다. 연산에 참여하는 클러스터 노드의 개수를 증가시키며 Task와 화상데이터를 전송하여 이에 따른 연산시간을 측정하고 비교하였다. 실험 결과는 유휴 PC들로 구성된 PC클러스터를 이용한 효율적인 내용기반의 화상 검색 시스템을 구성하기 위해 활용이 가능하다.

  • PDF

Design of an Idle Time Reservation based PC Cluster on LAN Environment (LAN환경에서 유휴시간 예약에 기반한 PC Cluster의 설계)

  • 김영균;오길호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.346-348
    • /
    • 2003
  • 본 논문에서는 TCP/IP프로토콜을 사용하는 LAN환경에서 PC들을 사용한 PC클러스터에 관해 연구하였다. LAN환경의 PC들은 안정된 사용환경을 확보할 수 있고, 특정한 사용 시간에 따라 작업을 배치할 수 있는 특징을 갖는다. 또한 별도의 전용의 클러스터를 설치하기 위한 하드웨어가 필요로 하지 않는 장점도 갖는다. 특히 PC실험 실습실의 PC들은 주로 주간 시간대(오전9시~오후6시)에만 실험실습 수업에 사용이 되고, 야간 시간대(오후6시~익일 오전9시)에는 사용되지 않는 유휴 시간을 갖는다. 이러한 사용되지 않는 유휴 시간대의 PC들을 CPU지향적인 복잡한 작업들을 연산하기 위해 사용할 수 있으며, 별도의 클러스터 시스템을 구성하기 위한 하드웨어(클러스터를 위한 컴퓨터들, 스위치장비, 케이블링 등)를 구입할 필요가 없기 때문에 저가격의 고성능을 요구하는 PC클러스터를 쉽게 구성할 수 있다. 공동실험실습실의 PC들마다 유휴기간을 Time table에 예약하고 이에 따라 작업을 배치하고 연산결과를 수집한다. 장기간의 연산작업이 필요로 하는 대규모 연산에 사용함으로써 상당한 경제적 효과를 얻을 수 있다. 또한 동일 실습실의 PC들은 대개 동일한 성능의 동일한 하드웨어와 운영체제를 사용하는 PC들로 구성되기 때문에 Homogeneous node로 구성된 PC 클러스터를 구축하기가 용이하다.

  • PDF

External Morphology and Numerical Taxonomy of Hanabusaya asiatica Populations in Different Habitats (자생지별 금강초롱꽃의 외부형태 및 수리분류)

  • 유기억;이우철;류승열
    • Korean Journal of Plant Resources
    • /
    • v.13 no.1
    • /
    • pp.80-88
    • /
    • 2000
  • External morphology and numerical taxonomy by principal component analysis and cluster analysis were investigated to understand the taxonomic relationships on the populations of Hanabusaya asiatica from 6 different habitats. Additionally H. latisepala was used as a outgroup. The distinct characters to each habitat were not present in the measurement of 21 qualitative characters except for some native individuals in the top of Mt. Sorak and Hyangrobong based on leaf shape and bracts. This results were recognized as the continuous variations of external morphology. The populations of H. latisepala and H. asiatica were identified by calyx lobe shape. The results obtained based on the principal component(PC) analysis of treated 78 OTU were divided into two groups by PC 1,2,3, and the sums of contributions for the total variance were 50.07% (PC1 22.3% , PC2 15.7%, PC3 12.0%, respectively), and six populations were not distinctly identified as illustrated in two dimensions with PC1 and PC2. In cluster analysis based on average linkage cluster analysis and Ward's method, there were similarities in the composition of clustered taxa, and each populations were not identified.

  • PDF

A Software VIA based PC Cluster System on SCI Network (SCI 네트워크 상의 소프트웨어 VIA기반 PC글러스터 시스템)

  • Shin, Jeong-Hee;Chung, Sang-Hwa;Park, Se-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.4
    • /
    • pp.192-200
    • /
    • 2002
  • The performance of a PC cluster system is limited by the use of traditional communication protocols, such as TCP/IP because these protocols are accompanied with significant software overheads. To overcome the problem, systems based on user-level interface for message passing without intervention of kernel have been developed. The VIA(Virtual Interface Architecture) is one of the representative user-level interfaces which provide low latency and high bandwidth. In this paper, a VIA system is implemented on an SCI(Scalable Coherent Interface) network based PC cluster. The system provides both message-passing and shared-memory programming environments and shows the maximum bandwidth of 84MB/s and the latency of $8{\mu}s$. The system also shows better performance in comparison with other comparable computer systems in carrying out parallel benchmark programs.

A VR-based Tile Display System for the Distributed Visualization (분산 가시화를 위한 가상현실 타일 디스플레이 시스템의 개발)

  • Cha, Moo-Hyun;Lee, Jae-Kyung;Hwang, Jin-Sang;Han, Soon-Hung
    • Korean Journal of Computational Design and Engineering
    • /
    • v.15 no.3
    • /
    • pp.167-177
    • /
    • 2010
  • In recent years, the use of high-resolution tiled display system which does not have restrictions on the size of the screen and implements various layout of tile is increasing in order to evaluate the digital mock-up in physical scale or explore large engineering data set in detail. In this study, we developed multi-channel distributed visualization system which provides a virtual reality-based visual contents using 3D open-source graphics engine. Efficient data structures and exchange methods were proposed as a scene synchronization technology in PC cluster environments. DLP-Cube based tiled visualization system which provides $5{\times}2$ layout of display wall was developed and we validated our approach using this system. In addition, we introduced integrated control program that administrates PC cluster environment in remote and controls the layout of display channels.

NAVER : Design and Implementation of Networked Virtual Environments Based on PC Cluster (NAVER : PC 클러스터 기반의 분산가상환경 커널 설계 및 구현)

  • Park, Chang-Hoon;Ko, Hee-Dong;Changseok Cho;Ahn, Hee-Kap;Han, Yo-Sub;Kim, Tai-Yun
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2002.05a
    • /
    • pp.221-228
    • /
    • 2002
  • The NAVER is based on a cluster of low-cost personal computers. The goal of NAVER is to provide flexible, extensible, scalable and re-configurable framework for the diverse virtual environments especially for Gamsung research experiments. Personal computers are divided into three servers are according to their specific functions: Render Server, Device Server and Control Server. While Device Server contains external modules requiring event-based communication for the integration, Control Server contains external modules requiring synchronous communication every frame. And, the Render Server consists of 5 managers: Scenario Manager, Event Manger, Command Manager, Interaction Manager and Sync Manager. In this paper, we discuss NAVER as effective distributed system and its application to Gamsung experiment.

  • PDF

The Security Constrained Economic Dispatch with Line Flow Constraints using the Multi PSO Algorithm Based on the PC Cluster System (PC 클러스터 기반의 Multi-HPSO를 이용한 안전도 제약의 경제급전)

  • Jang, Se-Hwan;Kim, Jin-Ho;Park, Jong-Bae;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.9
    • /
    • pp.1658-1666
    • /
    • 2009
  • This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.