• 천문학회지
• /
• 제49권4호
• /
• pp.157-162
• /
• 2016

High resolution reconstruction technology is developed to help enhance the spatial resolution of observational images for ground-based solar telescopes, such as speckle masking. Near real-time reconstruction performance is achieved on a high performance cluster using the Message Passing Interface (MPI). However, much time is spent in reconstructing solar subimages in such a speckle reconstruction. We design and implement a novel parallel method for speckle masking reconstruction of solar subimage on a shared memory machine using the OpenMP. Real tests are performed to verify the correctness of our codes. We present the details of several parallel reconstruction steps. The parallel implementation between various modules shows a great speed increase as compared to single thread serial implementation, and a speedup of about 2.5 is achieved in one subimage reconstruction. The timing result for reconstructing one subimage with 256×256 pixels shows a clear advantage with greater number of threads. This novel parallel method can be valuable in real-time reconstruction of solar images, especially after porting to a high performance cluster.

• 한국전산유체공학회지
• /
• 제19권2호
• /
• pp.24-29
• /
• 2014

In this study, a parallel performance of CUPID-code has been investigated for both Ethernet and Infiniband network system to examine the effect of cache memory and network-speed. Bi-conjugate gradient solver of CUPID-code has been parallelised by using domain decomposition method and message passing interface (MPI). It is shown that the parallel performance of Ethernet-network system is worse than that of Infiniband-network system due to the slow network-speed and a small cache memory. It is also found that the parallel performance of each system deteriorates for a small problem due to the communication overhead, but the performance of Infiniband-network system is better than Ethernet-network system due to a much faster network-speed. For a large problem, the parallel performance depends less on network system.

• 대한기계학회논문집B
• /
• 제21권8호
• /
• pp.1024-1033
• /
• 1997

The past several years have witnessed an ever-increasing acceptance and adoption of parallel processing, both for high performance scientific computing as well as for more general purpose applications. Furthermore with increasing needs to perform the complex flow calculations in an efficient manner, the use of the message passing model on distributed networks has emerged as an important alternative to the expensive supercomputers. This work attempts to provide a generic framework to enable the parallelization of all CFD-related works using the master-slave model. This framework consists of (1) input geometry, (2) domain decomposition, (3) grid generation, (4) flow computations, (5) flow visualization, and (6) output display as the sequential components, but performs computations for (2) to (5) in parallel on the workstation clustering. The flow computations are parallized by having multiple copies of the flow-code to solve a PDE on different spatial regions on different processors, while their flow data are exchanged across the region boundaries, and the solution is time-stepped. The Parallel Virtual Machine (PVM) is used for distributed communication in this work.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제26권10호
• /
• pp.1178-1178
• /
• 1999

A spatial join has the property that its execution time exponentially increases in proportion to the number of spatial objects. Recently, there have been many attempts for improving the performance of the spatial join by using parallel processing schemes, In the case of executing parallel spatial join using the parallel machine with shared disk architecture, the disk bottleneck of parallel processing of spatial join worsens in comparison with sequential spatial join. This paper presents the algorithms of task creation and assignment to reduce the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing between processors, This paper proposes object caching which is a higher level of abstraction than page caching, and uses it to do creation and assignment of tasks according to temporal and spatial localities for minimizing disk access time. The object caching shows the performance improvement of 50%. The task creation and assignment using localities gives the gain of 30% and 20%. Overall performance evaluation of the proposed algorithms shows 7.2 times speed up than those of sequential execution of spatial joins.

• 한국산학기술학회논문지
• /
• 제11권1호
• /
• pp.182-189
• /
• 2010

본 논문에서는 비동기적 분산시스템에서 고장 추적 장치를 이용한 상호배제의 문제를 서술하고 이러한 문제를 해결하는 가장 약한 고장 추적 장치를 결정하고자 한다. 이를 위해서 $M^*$라고 정의한 modal failure detector star 고장 추적 장치를 정의하고 $M^*$를 이용해서 상호배제 문제는 비동기적 분산 시스템에서 해결 가능함을 보인다. $M^*$는 perfect failure detector P보다 확실히 약하며 eventually perfect failure detector ◇P보다는 강한 고장추적 장치이다. 본 논문에서는 어떤 환경 안에서 이러한 문제가 해결 가능함을 보인다.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (A)
• /
• pp.43-45
• /
• 2006

Unlike RNA interference, whose usage is limited to eukaryotic cells, Peptide Nucleic Acid (PNA) technique is applicable to both eukaryotic and prokaryotic cells. PNA has been proven to be an effective agent for blocking gene expressions and has several advantages over other antisense techniques. Here we developed a parallel computing software that provides the ideal sequences to design PNA oligos to prevent any off-target effects. We applied a new approach in our location-finding algorithm that finds a target gene from the whole genome sequence. Message Passing Interface (MPI) was used to perform parallel computing in order to reduce the calculation time. The software will help biologists design more accurate and effective antisense PNA by minimizing the chance of off-target effects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.703-722
• /
• 2016

Passive wireless devices have increasing civilian and military applications, especially in the scenario with wearable devices and Internet of Things. In this paper, we study indoor localization of a target equipped with radio-frequency identification (RFID) device in ultra-wideband (UWB) wireless networks. With known room layout, deterministic multipath components, including the line-of-sight (LOS) signal and the reflected signals via multipath propagation, are employed to locate the target with one transmitter and a single inaccurate receiver. A factor graph corresponding to the joint posterior position distribution of target and receiver is constructed. However, due to the mixed distribution in the factor node of likelihood function, the expressions of messages are intractable by directly applying belief propagation on factor graph. To this end, we approximate the messages by Gaussian distribution via minimizing the Kullback-Leibler divergence (KLD) between them. Accordingly, a parametric message passing algorithm for indoor passive localization is derived, in which only the means and variances of Gaussian distributions have to be updated. Performance of the proposed algorithm and the impact of critical parameters are evaluated by Monte Carlo simulations, which demonstrate the superior performance in localization accuracy and the robustness to the statistics of multipath channels.

• 정보과학회 논문지
• /
• 제42권12호
• /
• pp.1467-1473
• /
• 2015

본 논문에서는 고성능 병렬 계산 장치로 주목받고 있는 GPU에서의 선형 합동 방식(linear congruential)의 병렬 난수 생성 프로그램을 구현하였다. 난수는 임의성을 필요로 하는 모든 분야에서 중요하게 사용되며, 선형 합동 난수 방식은 컴퓨터 계산을 통하여 생성되는 의사 난수(pseudo random numbers) 생성 방식 중에 가장 많이 사용되는 방식이다. 본 논문에서는 NVIDIA CUDA 프로그래밍 모델을 사용하여 구현된 프로그램 및 MPI를 사용한 다중 GPU를 구동하는 병렬프로그램을 설명하고, 생성된 난수들의 임의성과 성능을 알아보았다. 또한 원주율(${\pi}$)을 계산하기 위한 몬테카를로 알고리즘을 사용하여 CUDA 라이브러리 함수인 cuRAND와 성능을 비교하였으며, 다수의 GPU를 동시에 계산한 성능의 변화도 알아보았다.

• 한국콘텐츠학회논문지
• /
• 제10권12호
• /
• pp.43-50
• /
• 2010

FM-VMS는 교통정보제공을 위해 구축한 가변전광표지(Variable Message Signs, 이하 VMS) 문자정보를 워터마킹 기술을 이용하여 음성신호와 같이 동시에 변조시켜 송출하는 시스템으로, 본 논문에서는 VMS에 제공되는 교통정보를 FM 주파수를 이용하여 이동차량에 대하여 실시간 교통정보를 제공하는 시스템을 설계하고 제작하여 특성을 평가하였으며, 가변전광 표지판으로부터의 VMS 정보와 연동한 교통소통정보를 오디오와 문자정보로 변환하여 FM방송을 통해서 자동차 운전자에게 전달하는 것이 가능함을 확인할 수 있었다.

• 한국우주과학회:학술대회논문집(한국우주과학회보)
• /
• 한국우주과학회 2009년도 한국우주과학회보 제18권2호
• /
• pp.26.2-26.2
• /
• 2009

The Solar and Space Weather Research Group (SOS) in Korea Astronomy and Space Science Institute (KASI) is constructing the Space Weather Prediction Center since 2007. As a part of the project, we are developing automatic real-time system of the global 3-D magnetohydrodynamics (MHD) simulation. The MHD simulation model of earth's magnetosphere is designed as modified leap-frog scheme by T. Ogino, and it was parallelized by using message passing interface (MPI). Our work focuses on the automatic processing about simulation of 3-D MHD model and visualization of the simulation results. We used PC cluster to compute, and virtual reality modeling language (VRML) file format to visualize the MHD simulation. The system can show the variation of earth's magnetosphere by the solar wind in quasi real time. For data assimilation we used four parameters from ACE data; density, pressure, velocity of solar wind, and z component of interplanetary magnetic field (IMF). In this paper, we performed some initial tests and made a animation. The automatic real-time system will be valuable tool to understand the configuration of the solar-terrestrial environment for space weather research.