• Title/Summary/Keyword: 병렬시스템

Search Result 2,501, Processing Time 0.035 seconds

Development of real-time urban inundation prediction system (실시간 도시침수 예측 시스템 개발)

  • Lee, Seung Soo;Park, Kyung Won;Lee, Gi Ha;Ahn, Hyun Uk;Jung, Sung Ho
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.62-62
    • /
    • 2019
  • 본 연구에서는 기상청에서 제공하는 인공위성 관측자료와 레이더 자료를 합성하여 예측된 선행시간 2시간의 강수량 예측자료를 이용하여 도시유역의 침수 발생 여부를 확인할 수 있는 시스템을 개발하였다. 대상유역은 부산광역시에 위치하고 있는 유역면적 $54km^2$의 온천천유역으로, $10m{\times}10m$의 해상도로 지표면의 침수예측을 수행한다. 침수예측에 이용되는 모델은 지표면과 하수관망 사이의 상호작용을 효과적으로 고려할 수 있도록 지표면 2차원, 하수관망 1차원 모델을 연계하였으며, 침수예측에 소요되는 시간을 최소화하기 위하여 OpenMP기반의 병렬해석 기법을 적용하였다. 또한 초기조건에 의한 오차를 줄이기 위하여 하천수위 관측소에 관측된 수위자료를 예측모델의 초기조건으로 입력할 수 있도록 시스템을 구성하였으며 유역 하류단에서 경계조건으로 활용되는 예측수위자료는 시계열자료의 예측에 뛰어난 성능을 보여주는 것으로 알려진 LongShort-term Memory(LSTM) 기법을 적용하여 이용하였다. 본 연구에서 개발된 실시간 도시침수 예측 시스템은 집중호우 발생시 침수 발생 위치를 사전에 빠르게 예측하여 도시유역의 인적 물적 자원의 피해를 저감하는데 적극적으로 활용될 수 있을 것으로 기대된다.

  • PDF

Multiple Request per Single Virtual Machine Scheme based High Efficiency Cloud Resource Broker System (단일 가상 머신-다중 작업 할당 기법 기반 고효율 클라우드 자원 브로커 시스템)

  • Kim, Seong-Hwan;Ha, Yun-Gi;Youn, Chan-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.123-124
    • /
    • 2013
  • 비용대비 작업 처리의 효율을 위해서는 사용자들의 작업 요구사항에 적절한 자원을 선택하고 요구 작업을 적절한 할당된 자원에 스케쥴링하는 플랫폼이 필수적이다. 또한 이러한 플랫폼은 사용자의 SLA 에 따라 작업 처리 기한 안에 요구 비용 이내로 작업을 처리할 수 있도록 결정을 내릴 수 있어야 하고 요구 작업량의 변화에 따라 즉각 대응을 하기 위하여 실시간적인 결정을 내릴 수 있어야 한다. 이러한 복잡한 결정 사항들을 최적 판단으로 대신 처리해주는 미들웨어로 클라우드 자원 브로커 시스템을 사용할 수 있다. 클라우드 자원 브로커 시스템은 작업 스케쥴링과 자원 프로비저닝 등이 가격, 처리시간에 중요한 선택 및 수행을 한다. 기존의 많은 논문들에서의 작업 스케줄링은 다중 테넌트 정책의 클라우드가 제공하는 사용자들간의 가상 머신 독립에 초점을 두어 하나의 가상 머신이 하나의 작업에 한정되도록 처리하는 방식이었다. 이는 병렬화의 정도가 낮은 어플리케이션의 경우 시스템 활용률이 낮아 자원 활용율이 떨어진다. 이를 다수의 작업을 멀티 태스킹, 멀티 스레드의 방법으로 하나의 가상 머신에서 처리하도록 하여 스레드 레벨 병렬화의 이점을 이용해 자원 이용률을 높임으로 효율을 높이고자 한다.

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.

An Implementation and Verification of Performance Monitor for Parallel Signal Processing System (병렬신호처리시스템을 위한 성능 모니터의 구현 및 검증)

  • Lee Won-Joo;Kim Hyo-Nam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.313-322
    • /
    • 2005
  • In this paper, we implement and verify performance monitor for parallel signal processing system, using DSP Starter Kit(DSK) of which the basic Processor is TMS302C6711 chip. The key ideas of this performance monitor is, using Real Time Data Exchange(RTDX) for the Purpose of real-time data transfer and function of DSP/BIOS, the ability to measure the Performance measure like DSP workload, memory usage, and bridge traffic. In the simulation, FFT, 2D FFT, Matrix Multiplication, and Fir Filter, which are widely used DSP algorithms, have been employed. Using performance monitor and Code Composer Studio from Texas Instrument(Tl) , the result has been recorded according to different frequencies, data sizes, and buffer sizes for a single wave file. The accuracy of our performance monitor has been verified by comparing those recorded results.

  • PDF

Automatically Extracting Unknown Translations Using Phrase Alignment (정렬기법을 이용한 미등록 대역어의 자동 추출)

  • Kim, Jae-Hoon;Yang, Sung-Il
    • The KIPS Transactions:PartB
    • /
    • v.14B no.3 s.113
    • /
    • pp.231-240
    • /
    • 2007
  • In this paper, we propose an automatic extraction model for unknown translations and implement an unknown translation extraction system using the proposed model. The proposed model as a phrase-alignment model is incorporated with three models: a phrase-boundary model, a language model, and a translation model. Using the proposed model we implement the system for extracting unknown translations, which consists of three parts: construction of parallel corpora, alignment of Korean and English words, extraction of unknown translations. To evaluate the performance of the proposed system we have established the reference corpus for extracting unknown translation, which comprises of 2,220 parallel sentences including about 1,500 unknown translations. Through several experiments, we have observed that the proposed model is very useful for extracting unknown translations. In the future, researches on objective evaluation and establishment of parallel corpora with good quality should be performed and studies on improving the performance of unknown translation extraction should be kept up.

A Global Framework for Parallel and Distributed Application with Mobile Objects (이동 객체 기반 병렬 및 분산 응용 수행을 위한 전역 프레임워크)

  • Han, Youn-Hee;Park, Chan-Yeol;Hwang, Chong-Sun;Jeong, Young-Sik
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.6
    • /
    • pp.555-568
    • /
    • 2000
  • The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

  • PDF

Deployment and Performance Analysis of Data Transfer Node Cluster for HPC Environment (HPC 환경을 위한 데이터 전송 노드 클러스터 구축 및 성능분석)

  • Hong, Wontaek;An, Dosik;Lee, Jaekook;Moon, Jeonghoon;Seok, Woojin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.9
    • /
    • pp.197-206
    • /
    • 2020
  • Collaborative research in science applications based on HPC service needs rapid transfers of massive data between research colleagues over wide area network. With regard to this requirement, researches on enhancing data transfer performance between major superfacilities in the U.S. have been conducted recently. In this paper, we deploy multiple data transfer nodes(DTNs) over high-speed science networks in order to move rapidly large amounts of data in the parallel filesystem of KISTI's Nurion supercomputer, and perform transfer experiments between endpoints with approximately 130ms round trip time. We have shown the results of transfer throughput in different size file sets and compared them. In addition, it has been confirmed that the DTN cluster with three nodes can provide about 1.8 and 2.7 times higher transfer throughput than a single node in two types of concurrency and parallelism settings.