• Title/Summary/Keyword: Cluster computing environment

Search Result 109, Processing Time 0.023 seconds

Design of Global Buffer Manager in SAN-based Cluster File Systems (SAN 환경의 대용량 클러스터 파일 시스템을 위한 광역 버퍼 관리기의 설계)

  • Lee, Kyu-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.11
    • /
    • pp.2404-2410
    • /
    • 2011
  • This paper describes the design overview of cluster file system $SANique^{TM}$ based on SAN(Storage Area Network) environment. The design issues and problems of the conventional global buffer manager are also illustrated under a large set of clustered computing hosts. We propose the efficient global buffer management method that provides the more scalability and availability. In our proposed global buffer management method, we reuse the maintained list of lock information from our cluster lock manager. The global buffer manger can easily find and determine the location of requested data block cache based on that lock information. We present the pseudo code of the global buffer manager and illustration of global cache operation in cluster environment.

An Improved Hybrid Canopy-Fuzzy C-Means Clustering Algorithm Based on MapReduce Model

  • Dai, Wei;Yu, Changjun;Jiang, Zilong
    • Journal of Computing Science and Engineering
    • /
    • v.10 no.1
    • /
    • pp.1-8
    • /
    • 2016
  • The fuzzy c-means (FCM) is a frequently utilized algorithm at present. Yet, the clustering quality and convergence rate of FCM are determined by the initial cluster centers, and so an improved FCM algorithm based on canopy cluster concept to quickly analyze the dataset has been proposed. Taking advantage of the canopy algorithm for its rapid acquisition of cluster centers, this algorithm regards the cluster results of canopy as the input. In this way, the convergence rate of the FCM algorithm is accelerated. Meanwhile, the MapReduce scheme of the proposed FCM algorithm is designed in a cloud environment. Experimental results demonstrate the hybrid canopy-FCM clustering algorithm processed by MapReduce be endowed with better clustering quality and higher operation speed.

Facture Simulation using Molecular Dynamics on a PC Cluster (PC 클러스터 상에서 분자동역학을 이용한 파괴 모사)

  • Choi, Deok-Kee;Ryu, Han-Kyu
    • Proceedings of the KSME Conference
    • /
    • 2001.11a
    • /
    • pp.252-257
    • /
    • 2001
  • With the help of newly arrived technology such as PC clustering, molecular dynamics (MD) seems to be promising for large-scale materials simulations. A cost-effective cluster is set up using commodity PCs connected over Ethernet with fast switching devices and free software Linux. Executing MD simulations in the parallel sessions makes it possible to carry out large-scale materials simulations at acceptable computation time and costs. In this study, the MD computer code for fracture simulation is modified to comply with MPI (Message Passing Interface) specification, and runs on the PC cluster in parallel mode flawlessly. It is noted that PC clusters can provide a rather inexpensive high-performance computing environment comparing to supercomputers, if properly arranged.

  • PDF

Construction of Highly Integrated PC Cluster based on Windows XP (높은 집적도를 가지는 Windows XP PC 클러스터 구축)

  • Lee S.-K.;Shin J.-R.;Choi J.-Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2005.04a
    • /
    • pp.41-46
    • /
    • 2005
  • A new PC cluster was designed and constructed based on Windows XP Operating system. Primary target of the present design was the high node density per rack by using the general PC parts those are cost-effective and readily available in the market. Other major design points were system cooling and the convenient maintenance using standard PC parts. Presently 24 nodes per rack seems to be optimum considering the specification of the network switching device, system cooling and power supply, but 40 nodes can be accommodated within a single rack at maximum. Windows XP was selected as a high-performance computing environment considering the cost and the convenience in acquisition, maintenance and education. Both fast-Ethernet and Gigabit Ethernet network connection were tested and compared with previous data, especially for Linux doter using Myrinet. The result shows that there is no significant difference between the operating systems and the Fast-Ethernet and/or Gigabit Ethernet are good solution for the high-performance PC cluster considering the cost and performance.

  • PDF

Implementation of SLA Management System for QoS Guarantee in Cloud Computing Environment (클라우드 환경에서 QoS 보장을 위한 SLA 관리시스템 구현)

  • Yoon, Ka-Ram;Lee, Bong-Hwan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.302-308
    • /
    • 2013
  • Internet is becoming more common with increasing cloud services have been spreading rapidly. A SLA is agreements between service providers and customers of service providers is how to ensure quality of service. SLA in cloud computing environments from the perspective of the IT service providers to customer satisfaction increase for service quality, it will need to differentiate between competing carriers QoS guarantees with SLA is a very important factor. However, the study of SLA in the cloud is staying in its infancy. In this paper, SLA indices for cloud services defining and use them SLA Management System for QoS guarantee has been implemented. The proposed system using monitoring-based migration policy an open source-based cloud computing platform which Cluster Nodes load distribution of virtual machines assigned to their availability, response time, throughput analysis of what affects and is compared with existing cloud.

Efficient Data Pre-fetching Scheme for InfiniBand based High Performance Clusters (인피니밴드 기반 고성능 클러스터를 위한 효율적인 데이터 선반입 기법)

  • Kim, Bongjae;Jung, Jinman;Min, Hong;Heo, Junyoung;Jung, Hyedong
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.5
    • /
    • pp.293-298
    • /
    • 2017
  • Recently, much research has been devoted to implementing and provisioning high-performance computing environment using clusters with multiple computers and high-performance networking technologies. In-memory based Key-Value stores, such as Redis or Memcached, are widely used in high performance cluster environments to improve the data processing performance. We can distribute data at different storage nodes, and each computing node can access it at a high speed using these In-memory based Key-Value stores. InfiniBand is a de-facto technology that is widely used to interconnect each node of a cluster. In this paper, we propose a new data pre-fetching scheme for Key-Value store based on high performance clusters to improve the performance. The proposed scheme utilizes the data transfer characteristics of InfiniBand. The results of the simulation show that the proposed scheme can reduce the data transfer time by up to about 28%.

Application of Parallel PSO Algorithm based on PC Cluster System for Solving Optimal Power Flow Problem (PC 클러스터 시스템 기반 병렬 PSO 알고리즘의 최적조류계산 적용)

  • Kim, Jong-Yul;Moon, Kyoung-Jun;Lee, Haw-Seok;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.10
    • /
    • pp.1699-1708
    • /
    • 2007
  • The optimal power flow(OPF) problem was introduced by Carpentier in 1962 as a network constrained economic dispatch problem. Since then, the OPF problem has been intensively studied and widely used in power system operation and planning. In these days, OPF is becoming more and more important in the deregulation environment of power pool and there is an urgent need of faster solution technique for on-line application. To solve OPF problem, many heuristic optimization methods have been developed, such as Genetic Algorithm(GA), Evolutionary Programming(EP), Evolution Strategies(ES), and Particle Swarm Optimization(PSO). Especially, PSO algorithm is a newly proposed population based heuristic optimization algorithm which was inspired by the social behaviors of animals. However, population based heuristic optimization methods require higher computing time to find optimal point. This shortcoming is overcome by a straightforward parallel processing of PSO algorithm. The developed parallel PSO algorithm is implemented on a PC cluster system with 6 Intel Pentium IV 2GHz processors. The proposed approach has been tested on the IEEE 30-bus system. The results showed that computing time of parallelized PSO algorithm can be reduced by parallel processing without losing the quality of solution.

Development and Performance Evaluation of Parallel Sequence Analysis System on PC-Cluster (PC-Cluster 기반 병렬형 유전자 서열 검색 시스템의 개발 및 성능 평가)

  • Shin Yong-Won;Park Jeong-Seon
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.6
    • /
    • pp.617-621
    • /
    • 2004
  • In recent, researchers in the field of Bioinformatics need to analyze thousands of genome sequences efficiently according to introduce of new analysis methods and technologies such as genome expression microchip. This rapid growth in the field of bio-engineering needs computing resources to analyze rapidly for genome sequences, but it does not introduce the computing resources due to an enormous investment expense. The core factor of this study is integrated environment based PC-Cluster system & high speed access rate up to 155Mbps, continuous collection system for bio-information at home and abroad. The results of the study are establishment & stabilization of information and communication infrastructure, establishment & stabilization of high performance computer network up to 155Mbps, development of PC-Cluster system with 32 nodes, a parallel BLAST on Cluster system, which can provides scalable speedup in terms of response time, and development of collection & search system for bio-information.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF

API Server Transport Layer Security Packets Real-Time Decryption and Visualization System in Kubernetes (쿠버네티스 API server의 Transport Layer Security 패킷 실시간 복호화 및 시각화 시스템)

  • Kim, Tae-Hyun;Kim, Tae-Young;Choi, Me-Hee;Jin, Sunggeun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.3
    • /
    • pp.99-105
    • /
    • 2021
  • The cloud computing evolution has brought us increasing necessity to manage virtual resources. For this reason, Kubernetes has developed to realize autonomous resource management in a large scale. It provides cloud computing infrastructure to handle cluster creations and deletions in a secure virtual computing environment. In the paper, we provide a monitoring scheme in which users can observe securely encrypted protocols while each Kubernetes component exchanges their packets. Eventually, users can utilize the proposed scheme for debugging as well as monitoring.