• Journal of computational fluids engineering
• /
• v.13 no.2
• /
• pp.27-41
• /
• 2008

An unstructured hybrid mesh flow solver has been developed for the simulation of three-dimensional steady and unsteady incompressible flow fields. The incompressible Navier-Stokes equations with an artificial compressibility method were discretized by using a node-based finite-volume method. For the unsteady time-accurate computation, a dual-time stepping method was adopted to satisfy a divergence-free flow field at each physical time step. An implicit time integration method with local time stepping was implemented to accelerate the convergence in the pseudo-time sub-iteration procedure. The one-equation Spalart-Allmaras turbulence model has been adopted to solve high-Reynolds number flow fields. The flow solver was parallelized to minimize the CPU time and to overcome the computational overhead. This method has been applied to calculate steady and unsteady flow fields around submarine configurations and a 3-D infinite cylinder. Validations were made by comparing the predicted results with those of experiments or other numerical results. It was demonstrated that the present method is efficient and robust for the prediction of steady and unsteady incompressible flow fields.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.436-442
• /
• 2009

Tomography images reconstructed from conebeam CT make it possible to observe inside of the projected object without any damage, and so it has been widely used in the industrial and medical fields. Recent advanced imaging equipment can produce high-resolution CT images. However, it takes much time to reconstruct the obtained large dataset. To reduce the time to reconstruct CT images, we propose an accelerating method using GPU (graphics processing unit). Reconstruction consists of mainly two parts, filtering and back-projection. In filtering phase, we applied 4ch image compression method and in back-projection phase, computation reduction method using depth test is applied. The experimental results show that the proposed method accelerates the speed 50 times than the CPU-based program optimized with OpenMP by utilizing the high-computing power of parallelized GPU.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.9
• /
• pp.189-196
• /
• 2020

Recently, GPU cloud computing technology applying GPU(Graphics Processing Unit) devices to virtual machines is widely used in the cloud environment. In a cloud environment, GPU devices assigned to virtual machines can perform operations faster than CPUs through massively parallel processing, which can provide many benefits when operating high-performance computing services in a variety of fields in a cloud environment. In a cloud environment, a GPU device can help improve the performance of a virtual machine, but the virtual machine scheduler, which is based on the CPU usage time of a virtual machine, does not take into account GPU device usage time, affecting the performance of other virtual machines. In this paper, we test and analyze the performance degradation of other virtual machines due to the virtual machine that performs GPGPU(General-Purpose computing on Graphics Processing Units) task in the direct path based GPU virtualization environment, which is often used when assigning GPUs to virtual machines in cloud environments. Then to solve this problem, we propose a GPGPU task management method for a virtual machine.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.137-140
• /
• 2002

In this paper, a new algorithm for two-dimensional (2-D) finite-difference time-domain (FDTD) method is presented. By this new method, the maximum time step size can be increased over the Courant-Friedrich-Levy (CFL) condition restraint. This new algorithm is adapted from an Alternating-Direction Implicit FDTD (ADI-FDTD) method. However, unlike the ADI-FDTD algorithm. the alternation is performed with respect to the blocks of fields rather than with respect to each respective coordinate direction. Moreover. this method can be efficiently simulated with parallel computation. and it is more efficient than the conventional FDTD method in terms of CPU time. Numerical formulations are shown and simulation results are presented to demonstrate the effectiveness and efficiency of our proposed method.

• Proceedings of the KSME Conference
• /
• 2001.06d
• /
• pp.414-418
• /
• 2001

Flow and thermal characteristics of cooling system for the robot controller were numerically as well as experimentally investigated. To obtain the overall flows within controller, the system level solutions were analysed at first and then the board level solutions were pursued to understand the detailed flow and temperature fields near the main board which have a significant influence on the cooling of electronic components. The evaluation for a performance of the heat exchanger was conducted on the basis of the obtained flow and temperature patterns. The results showed that the heat exchanger made a small contribution to the cooling of controller and caused an increase of the temperature in CPU.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.175-178
• /
• 2005

TM plane-wave scattering from finite rectangular grooves in a conducting plane is systematically analyzed with the overlapping T-block method. Multiple rectangular grooves are divided into several overlapping T-blocks to obtain the fast CPU time, CAD applicability, and wide versatility. The scattered fields are obtained in simple closed forms including a fast-convergent integral.

• Journal of computational fluids engineering
• /
• v.6 no.2
• /
• pp.47-55
• /
• 2001

In recent years cluster systems using off-the-shelf processors and networks components have been increasing popular. Since actual performance of a cluster system varies significantly for different architectures, representative in-house codes from major application fields were executed to evaluate the actual performance of systems with different combination of CPU, network, and network topology. As an example of practical CFD(Computational Fluid Dynamics) simulations, the flow past an Onera-M6 wing and the flow past an infinite wing were simulated on clusters of Linux and several other hardware environments.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.161-169
• /
• 2001

At the end of 1999, the TeraCluster Project in the KISTI Supercomputing Center was initiated to explore the possibility of PC clusters as a scientific computing platform to replace the Cray T3E system in KISTI by 2002. Since actual performance of a computing system varies significantly for different architectures, representative in-house codes from major application fields were executed to evaluate the actual performance of systems with different combination of CPU, network and network topology. As an example of practical CFD(Computational Fluid Dynamics) simulations, the flow past the Onera-M6 wing and the flow past a infinite wing were simulated on a clusters of Linux and several other hardware environments.

• Journal of Institute of Convergence Technology
• /
• v.9 no.1
• /
• pp.1-6
• /
• 2019

Matrix multiplication is a fundamental mathematical operation that has numerous applications across most scientific fields. In this paper, we presents a parallel GPU computation algorithm for dense matrix-matrix multiplication using OpenGL compute shader, which can play a very important role as a fundamental building block for many high-performance computing applications. Experimental results on NVIDIA Quad 4000 show that the proposed algorithm runs about 208 times faster than previous CPU algorithm and achieves performance of 75 GFLOPS in single precision for dense matrices with matrix size 4,096. Such performance proves that our algorithm is practical for real applications.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.3
• /
• pp.348-354
• /
• 1998

The measured equation of invariance (MEI) method was introduced as a way to determine the electromagnetic fields scattered from discrete objects. Unlike more traditional numerical methods, MEI method over conventional methods over conventional methods are very substantial. In this work, Haar wavelets are applied to the measured equation of invariance (MEI) to solve two-dimensional scattering problem. We refer to "MEI method with wavelets" as "Wavelet MEI method". The proposed method leads to a significant saving in the CPU time compared to the MEI method that does not use wavelets as metrons. The results presented in this work promise that the Wavelet MEI method can give an accurate result quickly. We believe it is the first time that wavelets have been applied in conjunction with the MEI method to solve this scattering problem.