• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.69-78
• /
• 2006

In the field of the bioinformatics, it plays an important role in predicting functional information or structure information to search similar sequence in biological DB. Biolrgical sequences have been increased dramatically since Human Genome Project. At this point, because the searching speed for the similar sequence is highly regarded as the important factor for predicting function or structure, the SMP(Sysmmetric Multi-Processors) computer or cluster is being used in order to improve the performance of searching time. As the method to improve the searching time of BLAST(Basic Local Alighment Search Tool) being used for the similarity sequence search, We suggest the nBLAST algorithm performing on the cluster environment in this paper. As the nBLAST uses the MPI(Message Passing Interface), the parallel library without modifying the existing BLAST source code, to distribute the query to each node and make it performed in parallel, it is possible to easily make BLAST parallel without complicated procedures such as the configuration. In addition, with the experiment performing the nBLAST in the 28 nodes of LINUX cluster, the enhanced performance according to the increase in the number of the nodes has been confirmed.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.10a
• /
• pp.111-114
• /
• 2004

CFD code that simulates stator-rotor interactions is developed applying parallel computing method. Modified Multi-Block Grid System which enhances perpendicularity in grid and is appropriate in parallel processing is introduced and Patched Algorithm is applied in sliding interface which is caused by movement of rotor. The experimental model in the turbo-machine is composed of 11 stators and 14 rotors. Analyses on two test cases which are one stator - one rotor model and three stators - four rotors model are performed. The results of the two cases have been compared with the experimental test data.

• Proceedings of the KSME Conference
• /
• 2002.08a
• /
• pp.537-540
• /
• 2002

Flow through turbomachinery has a very complex structure and is intrinsically unsteady. Especially, recent design trend to turbomachinery with short axial spacing makes the flow extremely complex due to the interaction between stator and rotor. Therefore, it is very necessary to clearly understand the complex flow structure to obtain the high efficiency turbomachinery. So, in this paper, the effects of axial spacing on the unsteady secondary flow performance in the one stage turbine are investigated by three-dimensional unsteady flow analysis. The three-dimensional solver is parallelized using domain decomposition and Message Passing Interface(MPI) standard to overcome the limitation of memory and the CPU time in three-dimensional unsteady calculation. A sliding mesh interface approach has been implemented to exchange flow information between blade rows.

• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.586-592
• /
• 2000

터보머신 태부에 존재하는 정익 - 동익의 상호작용 유동현상을 수치모사 하는 코드를 병렬화 하였다 정익 - 동익의 상호작용을 해석하는 데에 편리하도륵 Multi-Block Grid System을 도입하여 계산영역을 형성하였고, 동익의 움직임으로 인해 발생하는 Sliding Interface부분은 Patched 알고리즘을 적용하여 해석하였다. 정익과 동익의 수를 1대 1로 단순화시켜 수치모사한 결과와 정익과 동익의 수를 실제 조건과 더 비슷하게 설정한 3대 4의 비율로 맞추어 수치모사한 결과를 비교하였다. 또한, 병렬컴퓨팅으로 인해 단축된 계산시간을 다른 연구에서의 계산시간들과 서로 비교하였다. 2차원 비정상 압축성 Navier-Stokes 방정식이 이용되었고, 난류모델링에는 K-w SST 모델링이 적응되었다. Roe의 FDS 기법을 사용하여 플럭스를 계산하였고, MUSCL 기법을 적용하여 3차의 공간정확도를 갖도록 하였다. 시간적분에는 이보성의 DP-SGS를 사용하였다. 해석결과의 분석에는 Time-averaged pressure distribution과 Pressure amplitude distribution 데이터를 사용했다.

• Journal of Platform Technology
• /
• v.10 no.2
• /
• pp.3-9
• /
• 2022

In this paper, to maximize the performance of the scatter communication in multi-core and many-core processors, a technique that considers the communication situation of the processing node is applied to a multi-core processor composed of 32 processing nodes. Since the existing scatter algorithm cannot recognize the communication conditions of the processing nodes, communication is generally performed according to an initially set transmission order. In this case, scatter communication starts only after the communication currently being performed by all processing nodes inside the processor is finished. The scatter communication performance was improved by this technique, and it was confirmed that there was a performance improvement of up to 78.93% compared to the existing algorithm through BFM simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.59-66
• /
• 2012

The use of MPSoC has been increasing because of a rise of use of mobile devices and complex applications. For improving the performance of MPSoC, number of processor has been increasing. Standard MPI is used for efficiently sending data in distributed memory architecture that has advantage in multi processor. Standard In this paper, we propose a scalable distributed memory system with a low cost hardware message passing interface(MPI). The proposed architecture improves transfer rate with buffered send for small size packet. Three queues, Ready Queue, Request Queue, and Reservation Queue, work as previous architecture, and two queues, Small Ready Queue and Small Request Queue, are added to send small size packet. When the critical point is set 8 bytes, the proposed architecture takes more than 2 times the performance improvement in the data that below the critical point.

• Economic and Environmental Geology
• /
• v.39 no.6 s.181
• /
• pp.711-717
• /
• 2006

In order to study gas hydrate, potential future energy resources, Korea Institute of Geoscience and Mineral Resources has conducted seismic reflection survey in the East Sea since 1997. one of evidence for presence of gas hydrate in seismic reflection data is a bottom simulating reflector (BSR). The BSR occurs at the interface between overlaying higher velocity, hydrate-bearing sediment and underlying lower velocity, free gas-bearing sediment. That is often characterized by large reflection coefficient and reflection polarity reverse to that of seafloor reflection. In order to apply depth migration to seismic reflection data. we need high performance computers and a parallelizing technique because of huge data volume and computation. Phase shift plus interpolation (PSPI) is a useful method for migration due to less computing time and computational efficiency. PSPI is intrinsically parallelizing characteristic in the frequency domain. We conducted conventional data processing for the gas hydrate data of the Ease Sea and then applied prestack depth migration using message-passing-interface PSPI (MPI_PSPI) that was parallelized by MPI local-area-multi-computer (MPI_LAM). Velocity model was made using the stack velocities after we had picked horizons on the stack image with in-house processing tool, Geobit. We could find the BSRs on the migrated stack section were about at SP 3555-4162 and two way travel time around 2,950 ms in time domain. In depth domain such BSRs appear at 6-17 km distance and 2.1 km depth from the seafloor. Since energy concentrated subsurface was well imaged we have to choose acquisition parameters suited for transmitting seismic energy to target area.

• International Journal of CAD/CAM
• /
• v.4 no.1
• /
• pp.47-53
• /
• 2004

The subdivision surface is the limit of recursively refined polyhedral mesh. It is quite intuitive that the multi-resolution feature can be utilized to simplify generation of NC (Numerical Control) tool paths for rough machining. In this paper, a new method of parallel NC tool path generation for subdivision surfaces is presented. The basic idea of the method includes two steps: first, extending G-Buffer to a strip buffer (called S-Buffer) by dividing the working area into strips to generate NC tool paths for objects of large size; second, generating NC tool paths by parallel implementation of S-Buffer based on MPI (Message Passing Interface). Moreover, the recursion depth of the surface can be estimated for a user-specified error tolerance, so we substitute the polyhedral mesh for the limit surface during rough machining. Furthermore, we exploit the locality of S-Buffer and develop a dynamic division and load-balanced strategy to effectively parallelize S-Buffer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.863-870
• /
• 1993

A new methodology of multimedia data composition generated SRT(Synchronization Relation Tree) dynamically after user composing multimedia date by using high level user interface, and processes message passing protocols to adjust multimedia data temporal composition. In this paperl we propose SRT generating algorithm which transfer user defined timeline diagram to SRT dynamically. SRT generating algorithm is to use divide and conquer methodology and recurvise programming. And prove that it generates and type of multimedia date compositon to SRT.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.23-34
• /
• 2005

In a large scale parallel computation, failures of some nodes or communication links end up with waste of computing resources, Several fault-tolerant MPI libraries have been proposed so far, but the programs written by using such libraries have a portability problem since fault-tolerant features are not supported by the MPI standard yet, In this paper, we propose an application-level fault-tolerant linear system solver that uses the asynchronous iteration algorithm and the standard MPI functions only, which does not have a portability problem and is more efficient by adopting a simplified recovery mechanism.