• Title/Summary/Keyword: PC-based Cluster

Search Result 127, Processing Time 0.023 seconds

The milli-arcsecond scale radio properties of central AGNs in cool-core and non cool-core clusters

  • Baek, Junhyun;Chung, Aeree;Tremou, Evangelia;Sohn, Bongwon;Jung, Taehyun;Ro, Hyunwook
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.1
    • /
    • pp.68.4-69
    • /
    • 2016
  • We report preliminary results of KaVA observations of central galaxies in cool-core and non cool-core clusters. The main goal is to study how cooling environments of galaxy clusters affect the central AGN activities especially at its innermost region. For KaVA observations, 7 radio bright AGNs have been selected from the extended Highest Flux Galaxy Cluster Sample (eHIFLUGCS; the X-ray flux limited & all sky galaxy cluster catalog) with various cooling timescales. In our previous KVN study, we have found that most AGNs in the cool-core clusters show the hint of pc-scale jet-like features while the ones in the non cool-core clusters do not. Using the KaVA 22/43 GHz data of a much higher resolution than the KVN resolution, we have investigated detailed pc-scale jet properties such as physical size, morphology, and radiative age. Based on the KaVA data, we discuss the effect of cluster cooling environment on the evolution of AGNs in the cluster center.

  • PDF

Parallel Genetic Algorithm-Tabu Search Using PC Cluster System for Optimal Reconfiguration of Distribution Systems

  • Mun Kyeong-Jun;Lee Hwa-Seok;Park June-Ho
    • KIEE International Transactions on Power Engineering
    • /
    • v.5A no.2
    • /
    • pp.116-124
    • /
    • 2005
  • This paper presents an application of the parallel Genetic Algorithm-Tabu Search (GA- TS) algorithm, and that is to search for an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration of distribution systems is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to solve the optimal switch position because of its numerous local minima. This paper develops a parallel GA- TS algorithm for the reconfiguration of distribution systems. In parallel GA-TS, GA operators are executed for each processor. To prevent solution of low fitness from appearing in the next generation, strings below the average fitness are saved in the tabu list. If best fitness of the GA is not changed for several generations, TS operators are executed for the upper 10$\%$ of the population to enhance the local searching capabilities. With migration operation, the best string of each node is transferred to the neighboring node after predetermined iterations are executed. For parallel computing, we developed a PC-cluster system consisting of 8 PCs. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based rapid Ethernet. To demonstrate the usefulness of the proposed method, the developed algorithm was tested and is compared to a distribution system in the reference paper From the simulation results, we can find that the proposed algorithm is efficient and robust for the reconfiguration of distribution system in terms of the solution quality, speedup, efficiency, and computation time.

Global Production Network and Coupling Strategy of IT Industrial Clusters in Dongguan, China (중국 동관 IT 산업 클러스터의 글로벌 생산 네트워크 및 커플링 전략)

  • Lee, Sang-Bin;Sung, Eul-Hyun;Yeom, Myung-Bae
    • Journal of the Korea Convergence Society
    • /
    • v.8 no.7
    • /
    • pp.39-46
    • /
    • 2017
  • Dongguan City of Guangdong province, one of the core areas of the Pearl River Delta, has also pursued economic development through the geographical advantage close to Hong Kong. In the early 1980s, small and medium-sized multinational corporations related to home appliances industry from Hong Kong invested to the Dongguan area and set up a production factory. In the mid-1990s, as Taiwanese PC manufacturers invested, local industrial clusters have developed in Dongguan with core of the IT, PC components and electronic industries. The case of the IT industrial cluster in Dongguan is a typical example of the development of Chinese manufacturing industry after the reform of China. This paper focused on the coupling strategy case of Dongguan City industrial cluster in Guangdong province, and theoretically compared the endogenous growth factor analysis(NMID) of regional industrial development with the regional differentiation of industry based on external linkage with global production network(GPN).

HPC(High Performance Computer) Linux Clustering for UltraSPARC(64bit-RISC processor) (UltraSPARC(64bit-RISC processor)을 위한 고성능 컴퓨터 리눅스 클러스터링)

  • 김기영;조영록;장종권
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.45-48
    • /
    • 2003
  • We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

  • PDF

Modified Passive Clustering Algorithm for Wireless Sensor Network

  • AI Eimon Akhtar Rahman;HONG Choong Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.427-429
    • /
    • 2005
  • Energy efficiency is the most challenging issue in wireless sensor network to prolong the life time of the network, as the sensors has to be unattended. Cluster based communication can reduce the traffic on the network and gives the opportunity to other sensors for periodic sleep and thus save energy. Passive clustering (PC) can perform a significant role to minimize the network load as it is less computational and light weight. First declaration wins method of PC without any priority generates severe collision in the network and forms the clusters very dense with large amount of overlapping region. We have proposed several modifications for the existing passive clustering algorithm to prolong the life time of the network with better cluster formation.

  • PDF

Performance Analysis of PC Cluster-based CC-NUMA System using Execution-driven Simulation (실행주도 시뮬레이션에 의한 PC 클러스터 기반 CC-NUMA 시스템 성능분석)

  • Ha, Chi-Jeong;Jeong, Sang-Hwa;O, Su-Cheol
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.4
    • /
    • pp.188-195
    • /
    • 2001
  • 본 논문에서는 PC 클러스터 기반 CC-NUMA 시스템을 제안하고, 시뮬레이션을 통하여 성능을 분석하였다. PC 클러스터 기반 CC-NUMA 시스템은 PC의 PCI slot에 CC-NUMA 카드를 장착함으로써 구현되며 공유메모리, 네트워크 캐쉬, 네트워크 제어 모듈을 포함한다. CC-NUMA 시스템은 PCI 버스상에 존재하는 메모리를 공유대상으로 하며, 공유메모리와 네트워크 캐쉬사이의 일관성은 IEEE SCI 표준에 의해 유지된다. CC-NUMA 시스템을 시뮬레이션 하기 위해 실행주도 시뮬레이터인 Limes를 수정하여 사용하였으며, 캐쉬 일관성 유지 알고리즘으로 SCI의 typical set을 구현하였다. 또한 기존 시스템과의 비교를 위해서 네트워크 캐쉬를 활용하지 않는 Dolphin사의 PCI-SCI 카드에 기반한 NUMA 시스템을 시뮬레이션 하였다. CC-NUMA 시스템의 성능을 측정하기 위하여 다양한 실험을 수행하였으며, 실험결과 CC-NUMA 시스템이 NUMA 시스템에 비해서 성능향상이 우수함을 알 수 있었다. 또한, CC-NUMA 시스템이 최적의 성능을 발휘하는 파라미터의 값을 도출하였으며, 이를 CC-NUMA 시스템의 실제 구현에 반영하였다.

  • PDF

Parallel Nonlinear Analysis of Prestressed Concrete Frame on Cluster System (클러스터 시스템에서 프리스트레스트 콘크리트 프레임의 병렬 비선형해석)

  • 이재석;최규천
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.14 no.3
    • /
    • pp.287-298
    • /
    • 2001
  • Analysis of nonlinear behavior of prestressed concrete frame structures on PC is a time-consuming computing job if the problem size increase to a certain degree. Cluster system has emerged as one of promising computing environments due to its good extendibility, portability, and cost-effectiveness, comparing it with high-end work-stations or servers. In this paper, a parallel nonlinear analysis procedure of prestressed concrete frame structure is presented using cluster computing. Cluster system is configured with readily available pentium III class PCs under Win98 or Linux and fast ethernet. Parallel computing algorithms on element-wise processing parts including the calculation of stiffness matrix, element stresses and determination of material states, check of material failure and calculation of unbalanced loads are developed using MPL. Validity of the method is discussed through typical numerical examples. For the case of 4 node system, maximum speedup is 3.15 and 3.74 for Win98 and Linux, respectively. Important issues for the efficient use of cluster computing system based un PCs and ethernet are addressed.

  • PDF

A Physical Data Design and Query Routing Technique of High Performance BLAST on E-Cluster (고성능 BLAST구현을 위한 E-Cluster 기반 데이터 분할 및 질의 라우팅 기법)

  • Kim, Tae-Kyung;Cho, Wan-Sup
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.2
    • /
    • pp.139-147
    • /
    • 2009
  • BLAST (Basic Local Alignment Search Tool) is a best well-known tool in a bioinformatics area. BLAST quickly compares input sequences with annotated huge sequence databases and predicts their functions. It helps biologists to make it easy to annotate newly found sequences with reduced experimental time, scope, and cost. However, as the amount of sequences is increasing remarkably with the advance of sequencing machines, performance of BLAST has been a critical issue and tried to solve it with several alternatives. In this paper, we propose a new PC-Based Cluster system (E-Cluster), a new physical data design methodology (logical partitioning technique) and a query routing technique (intra-query routing). To verify our system, we measure response time, speedup, and efficiency for various sizes of sequences in NR (Non-Redundancy) database. Experimental result shows that proposed system has better speedup and efficiency (maximum 600%) than those o( conventional approaches such as SMF machines, clusters, and grids.

Development and Performance Study of a Zero-Copy File Transfer Mechanism for Ink-based PC Cluster Systems (VIA 기반 PC 클러스터 시스템을 위한 무복사 파일 전송 메커니즘의 개발 및 성능분석)

  • Park Sejin;Chung Sang-Hwa;Choi Bong-Sik;Kim Sang-Moon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.11_12
    • /
    • pp.557-565
    • /
    • 2005
  • This paper presents the development and implementation of a zero-copy file transfer mechanism that improves the efficiency of file transfers for PC cluster systems using hardware-based VIA(Virtual Interface Architecture) network adapters. VIA is one of the representative user-level communication interfaces, but because there is no library for file transfer, one copy occurs between kernel buffer and user boilers. Our mechanism presents a file transfer primitive that does not require the file system to be modified and allows the NIC to transfer data from the kernel buffer to the remote node directly without copying. To do this, we have developed a hardware-based VIA network adapter, which supports the PCI 64bit/66MHz bus and Gigabit Ethernet, as a NIC, and implemented a zero-copy file transfer mechanism. The experimental results show that the overhead of data coy and context switching in the sender is greatly reduced and the CPU utilization of the sender is reduced to $30\%\~40\%$ of the VIA send/receive mechanism. We demonstrate the performance of the zero-copy file transfer mechanism experimentally. and compare the results with those from existing file transfer mechanisms.

Web-Based Distributed Visualization System for Large Scale Geographic Data (대용량 지형 데이터를 위한 웹 기반 분산 가시화 시스템)

  • Hwang, Gyu-Hyun;Yun, Seong-Min;Park, Sang-Hun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.6
    • /
    • pp.835-848
    • /
    • 2011
  • In this paper, we propose a client server based distributed/parallel system to effectively visualize huge geographic data. The system consists of a web-based client GUI program and a distributed/parallel server program which runs on multiple PC clusters. To make the client program run on mobile devices as well as PCs, the graphical user interface has been designed by using JOGL, the java-based OpenGL graphics library, and sending the information about current available memory space and maximum display resolution the server can minimize the amount of tasks. PC clusters used to play the role of the server access requested geographic data from distributed disks, and properly re-sample them, then send the results back to the client. To minimize the latency happened in repeatedly access the distributed stored geography data, cache data structures have been maintained in both every nodes of the server and the client.