• Title/Summary/Keyword: Grid Cluster

Search Result 119, Processing Time 0.021 seconds

Application of a Parallel Asynchronous Algorithm to Some Grid Problems on Workstation Clusters

  • Park, Pil-Seong
    • Ocean and Polar Research
    • /
    • v.23 no.2
    • /
    • pp.173-179
    • /
    • 2001
  • Parallel supercomputing is now a must for oceanographic numerical modelers. Most of today's parallel numerical schemes use synchronous algorithms, where some processors that have finished their tasks earlier than others must wait at synchronization points for correct computation. Hence, the load balancing is a crucial factor, however, it is, in general, difficult to achieve on heterogeneous workstation clusters. We devise an asynchronous algorithm that reduces the idle times of faster processors, and discuss application of the algorithm to some grid problems and implementation on a workstation cluster using Message Passing Interface (MPI).

  • PDF

METALLICITY DETERMINATION FOR A GLOBULAR CLUSTER BY SPECTRAL INDICES

  • LEE SANG-GAK
    • Journal of The Korean Astronomical Society
    • /
    • v.29 no.2
    • /
    • pp.157-170
    • /
    • 1996
  • In order to determine the metallicity of a globuar cluster, M3,by using the spectral indices, a kind of index grid has been establshed by stars in globular clusters, M3, M15, M71 and old open cluster, NGC 188. The indices were measured from the medium resolution spectra of about $2{\AA}$. The summed indices were used to determine metallicity in order to increase signals. It is found that the core depth index is measured more accurately and leads result more accurate than the pseudo-equivalent width index. This method can be further improved by including many more calibration globular clusters of various metallicity to make finer grids. By this method, the metallicity of M3 is determined as $[Fe/H] = -1.46\pm0.15$.

  • PDF

Ergonomic Design of the Gauge Cluster Display for Commercial Trucks

  • Kim, Taehun;Park, Jaekyu;Choe, Jaeho;Jung, Eui S.
    • Journal of the Ergonomics Society of Korea
    • /
    • v.34 no.3
    • /
    • pp.247-264
    • /
    • 2015
  • Objective: The purpose of this study is to determine the priority of information presentation and the effective menu type to be placed in the center of a gauge cluster display for commercial trucks and to present a set of ergonomic designs for the gauge cluster display. Background: An effective ergonomic design is specifically needed for the development of the gauge cluster display for the commercial trucks, because more diverse and heavier information is delivered to truck drivers, compared to the information to passenger car drivers. Method: First, all the information that must be shown on the commercial truck display was collected. Then, the severity, frequency of use, and display design parameters were evaluated for those information by commercial truck drivers. Next, an analysis on the information attributes and the heuristic evaluation utilizing the display design principles were carried out. According to the results, a design alternative of the main screen to be displayed was constructed by priority. A comparative analysis between the alternative and existing main screens was also conducted to see the efficacy of the designs. Lastly, we conducted an experiment for the selection of menu type. The experiment was conducted using the driving simulator with an eye-tracking device. The independent variables were four types of the menu reflecting the commercial truck characteristics such as grid type, icon type, list type, and flow type. We measured preference, total execution time, the total duration of fixation on the gauge cluster area, and the total number of fixation on the gauge cluster area as dependent variables. Results: Four types of driver convenience information and six types of driver assistance information were selected as the information to be placed primarily on the main screen of the gauge cluster. The Grid type was the most effective among the menu types. Conclusion: In this study, the information that appears on the main screen of the display, the division of the display and the design of the menu type for commercial truck drivers were suggested. Application: This study is expected to be utilized as guidelines on the ergonomic design of a gauge cluster display for commercial trucks.

Development of Grid Service Based Molecular Docking Application (그리드 서비스 기반 분자 다킹 어플리케이션 개발)

  • Lee, HwaMin;Chin, SungHo;Lee, JongHyuk;Park, Seongbin;Yu, HeonChang
    • The Journal of Korean Association of Computer Education
    • /
    • v.9 no.4
    • /
    • pp.63-74
    • /
    • 2006
  • A molecular docking is thc process of reducing an unmanageable number of compounds to a limited number of compounds for the target of interest by means of computational simulation. And it is one of a large scale scientific application that requires large computing power and data storage capability. Previous applications or software for molecular docking were developed to be run on a supercomputer, a workstation, or a cluster computer. However the virtual screening using a supercomputer has a problem that a supercomputer is very expensive and the virtual screening using a workstation or a cluster-computer requires a long execution time. Thus we propose Grid service based molecular docking application. We designed a resource broker and a data broker for supporting efficient molecular docking service and developed various services for molecular docking.

  • PDF

A synchronous/asynchronous hybrid parallel method for some eigenvalue problems on distributed systems

  • 박필성
    • Proceedings of the Korean Society of Computational and Applied Mathematics Conference
    • /
    • 2003.09a
    • /
    • pp.11-11
    • /
    • 2003
  • 오늘날 단일 슈퍼컴퓨터로는 처리가 불가능한 거대한 문제들의 해법이 시도되고 있는데, 이들은 지리적으로 분산된 슈퍼컴퓨터, 데이터베이스, 과학장비 및 디스플레이 장치 등을 초고속 통신망으로 연결한 GRID 환경에서 효과적으로 실행시킬 수 있다. GRID는 1990년대 중반 과학 및 공학용 분산 컴퓨팅의 연구 과정에서 등장한 것으로, 점차 응용분야가 넓어지고 있다. 그러나 GRID 같은 분산 환경은 기존의 단일 병렬 시스템과는 많은 점에서 다르며 이전의 기술들을 그대로 적용하기에는 무리가 있다. 기존 병렬 시스템에서는 주로 동기 알고리즘(synchronous algorithm)이 사용되는데, 직렬 연산과 같은 결과를 얻기 위해 동기화(synchronization)가 필요하며, 부하 균형이 필수적이다. 그러나 부하 균형은 이질 클러스터(heterogeneous cluster)처럼 프로세서들의 성능이 서로 다르거나, 지리적으로 분산된 계산자원을 사용하는 GRID 환경에서는 이기종의 문제뿐 아니라 네트워크를 통한 메시지의 전송 지연 등으로 유휴시간이 길어질 수밖에 없다. 이처럼 동기화의 필요성에 의한 연산의 지연을 해결하는 하나의 방안으로 비동기 반복법(asynchronous iteration)이 나왔으며, 지금도 활발히 연구되고 있다. 이는 알고리즘의 동기점을 가능한 한 제거함으로써 빠른 프로세서의 유휴 시간을 줄이는 것이 목적이다. 즉 비동기 알고리즘에서는, 각 프로세서는 다른 프로세서로부터 갱신된 데이터가 올 때까지 기다리지 않고 계속 다음 작업을 수행해 나간다. 따라서 동시에 갱신된 데이터를 교환한 후 다음 단계로 진행하는 동기 알고리즘에 비해, 미처 갱신되지 않은 데이터를 사용하는 경우가 많으므로 전체적으로는 연산량 대비의 수렴 속도는 느릴 수 있다 그러나 각 프로세서는 거의 유휴 시간이 없이 연산을 수행하므로 wall clock time은 동기 알고리즘보다 적게 걸리며, 때로는 50%까지 빠른 결과도 보고되고 있다 그러나 현재까지의 연구는 모두 어떤 수렴조건을 만족하는 선형 시스템의 해법에 국한되어 있으며 비교적 구현하기 쉬운 공유 메모리 시스템에서의 연구만 보고되어 있다. 본 연구에서는 행렬의 주요 고유쌍을 구하는 데 있어 비동기 반복법의 적용 가능성을 타진하기 위해 우선 이론적으로 단순한 멱승법을 사용하여 실험하였고 그 결과 순수한 비동기 반복법은 수렴하기 어렵다는 결론을 얻었다 그리하여 동기 알고리즘에 비동기적 요소를 추가한 혼합 병렬 알고리즘을 제안하고, MPI(Message Passing Interface)를 사용하여 수원대학교의 Hydra cluster에서 구현하였다. 그 결과 특정 노드의 성능이 다른 것에 비해 현저하게 떨어질 때 전체적인 알고리즘의 수렴 속도가 떨어지는 것을 상당히 완화할 수 있음이 밝혀졌다.

  • PDF

MPICH-GP : An MPI Extension to Supporting Private IP Clusters in Grid Environments (MPICH-GP : 그리드 상에서 사설 IP 클러스터 지원을 위한 MPI 확장)

  • Park, Kum-Rye;Yun, Hyun-Jun;Park, Sung-Yong;Kwon, Oh-Young;Kwon, Oh-Kyoung
    • The KIPS Transactions:PartA
    • /
    • v.14A no.1 s.105
    • /
    • pp.1-14
    • /
    • 2007
  • MPICH-G2 is an MPI implementation to solve complex computational problems by utilizing geographically dispersed computing resources in grid environments. However, the computation nodes in MPICH-G2 are exposed to the external network due to the lack of supporting the private IP clusters, which raises the possibility of malicious security attacks. In order to address this problem, we propose MPICH-GP with a new relay scheme combining NAT(Network Address Translation) service and an user-level proxy. The proxy running on the front-end system of private IP clusters forwards the incoming connection requests to the systems inside the clusters. The outgoing connection requests out of the cluster are forwarded through the NAT service on the front-end system. Through the connection path between the pair of processes, the requested MPI jobs can be successfully executed in grid environments with various clusters including private IP clusters. By simulations, we show that the performance of MPICH-GP reaches over 80% of the performance of MPICH-G2, and over 95% in ease of using RANK management method.

Design and Implementation of an InfiniBand System Interconnect for High-Performance Cluster Systems (고성능 클러스터 시스템을 위한 인피니밴드 시스템 연결망의 설계 및 구현)

  • Mo, Sang-Man;Park, Kyung;Kim, Sung-Nam;Kim, Myung-Jun;Im, Ki-Wook
    • The KIPS Transactions:PartA
    • /
    • v.10A no.4
    • /
    • pp.389-396
    • /
    • 2003
  • InfiniBand technology is being accepted as the future system interconnect to serve as the high-end enterprise fabric for cluster computing. This paper presents the design and implementation of the InfiniBand system interconnect, focusing on an InfiniBand host channel adapter (HCA) based on dual ARM9 processor cores The HCA is an SoC tailed KinCA which connects a host node onto the InfiniBand network both in hardware and in software. Since the ARM9 processor core does not provide necessary features for multiprocessor configuration, novel inter-processor communication and interrupt mechanisms between the two processors were designed and embedded within the KinCA chip. Kinch was fabricated as a 564-pin enhanced BGA (Bail Grid Array) device using 0.18${\mu}{\textrm}{m}$ CMOS technology Mounted on host nodes, it provides 10 Gbps outbound and inbound channels for transmit and receive, respectively, resulting in a high-performance cluster system.

Construction of Customer Appeal Classification Model Based on Speech Recognition

  • Sheng Cao;Yaling Zhang;Shengping Yan;Xiaoxuan Qi;Yuling Li
    • Journal of Information Processing Systems
    • /
    • v.19 no.2
    • /
    • pp.258-266
    • /
    • 2023
  • Aiming at the problems of poor customer satisfaction and poor accuracy of customer classification, this paper proposes a customer classification model based on speech recognition. First, this paper analyzes the temporal data characteristics of customer demand data, identifies the influencing factors of customer demand behavior, and determines the process of feature extraction of customer voice signals. Then, the emotional association rules of customer demands are designed, and the classification model of customer demands is constructed through cluster analysis. Next, the Euclidean distance method is used to preprocess customer behavior data. The fuzzy clustering characteristics of customer demands are obtained by the fuzzy clustering method. Finally, on the basis of naive Bayesian algorithm, a customer demand classification model based on speech recognition is completed. Experimental results show that the proposed method improves the accuracy of the customer demand classification to more than 80%, and improves customer satisfaction to more than 90%. It solves the problems of poor customer satisfaction and low customer classification accuracy of the existing classification methods, which have practical application value.

A Solution for Void Grid in Routing Protocol Supporting Mobile Sink on Sensor Network (센서 네트워크에서 모바일 싱크를 지원하는 라우팅 프로토콜의 void grid를 해결하기 위한 방안)

  • Jo, Ji-Eun;Choe, Jong-Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.306-309
    • /
    • 2007
  • 센서 네트워크에서 고려해야 하는 중요한 사항중 하나는 제한된 자원을 가진 센서 네트워크에서 주어진 에너지 소모를 최소화 하여서 네트워크 수명을 연장하는 것이다. 그러나 기존에 제안된 프로토콜은 유동성을 지닌 여러 개의 싱크가 존재할 경우에는 비효율 적인 문제가 발생하였으며 그러한 문제를 해결하기 위해서 여러 가지 프로토콜이 제안 되었다. 본 논문에서는 기존에 제안된 그리드 형태를 이용한 클러스터 기반의 라우팅 프로토콜인 CBPER(Cluster-based -Power-Efficient Routing)을 기반으로 이 프로토콜이 가지는 영구적인 그리드 형성시 발생할 수 있는 void grid 문제를 해결하고자 한다.

  • PDF

Grid-Enabled Parallel Simulation Based on Parallel Equation Formulation

  • Andjelkovic, Bojan;Litovski, Vanco B.;Zerbe, Volker
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.555-565
    • /
    • 2010
  • Parallel simulation is an efficient way to cope with long runtimes and high computational requirements in simulations of modern complex integrated electronic circuits and systems. This paper presents an algorithm for parallel simulation based on parallelization in equation formulation and simultaneous calculation of matrix contributions for nonlinear analog elements. In addition, the paper describes the development of a grid interface for a parallel simulator that enables a designer to perform simulations on distant computer clusters. Performances of the developed parallel simulation algorithm are evaluated by simulation of a microelectromechanical system.