• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.8
• /
• pp.1182-1190
• /
• 2003

A parallelized FEM code based on domain decomposition method has been recently developed for large-scale computational fluid dynamics. A 4-step splitting finite element algorithm is adopted for unsteady flow computation of the incompressible Navier-Stokes equation, and Smagorinsky LES model is chosen for turbulent flow computation. Both METIS and MPI Libraries are used for domain partitioning and data communication between processors, respectively. Tiburon model of Hyundai Motor Company is chosen as the computational model at Re=7.5 $\times$ 10$^{5}$ , which is based on the car height. The calculation is carried out under both the wind tunnel condition and the road condition using IBM SP parallel architecture at KISTI Super Computing Center. Compared with the existing experimental data, both the velocity and pressure fields are predicted reasonably well and the drag coefficient is in good agreement. Furthermore, it is confirmed that the drag under the road condition is smaller than that under the wind-tunnel condition.

• International Journal of High-Rise Buildings
• /
• v.4 no.1
• /
• pp.75-83
• /
• 2015

In the present study, the preliminary results of a large-scale seismic response analysis of a super-high-rise steel frame considering soil-structure interaction are presented. A seismic response analysis under the excitation of the JR Takatori record of the 1995 Hyogoken-Nanbu earthquake is conducted. Precise meshes of a 31-story super-high-rise steel frame and a soil region, which are constructed completely of hexahedral elements, are generated and combined. The parallel large-scale simulation is performed using K computer, which is one of the fastest supercomputers in the world. The results are visualized using an offline rendering code implemented on K computer, and the feasibility of using a very fine mesh of solid elements is investigated. The computation performance of the analysis code on K computer is also presented.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.430-438
• /
• 2004

Among the optimization method, GA (genetic algorithm) is a very powerful searching method enough to compete with design sensitivity analysis method. GA is very easy to apply, since it dose not require any design sensitivity information. However, GA has been computationally not efficient due to huge repetitive computation. In this study, parallel computation is adopted to Improve computational efficiency, Paralleled GA is introduced on a clustered LINUX based personal computer system.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.84-85
• /
• 2003

A parallelized FEM code based on domain decomposition method has been recently developed for a large scale computational fluid dynamics. A 4-step splitting finite element algorithm is adopted for unsteady computation of the incompressible Navier-Stokes equation, and Smagorinsky LES(Large Eddy Simulation) model is chosen for turbulent flow computation. Both METIS and MPI library are used for domain partitioning and data communication between processors respectively. Tiburon of Hyundai-motor is chosen as the computational model at $Re=7.5{\times}10^{5}$, which is based on the car height. It is confirmed that the drag under road condition is smaller than that of wind tunnel condition.

• Proceedings of the KSME Conference
• /
• 2002.08a
• /
• pp.59-62
• /
• 2002

In the present study, solution algorithms for the computation of unsteady flows on an unstructured mesh are presented. Dual time stepping is incorporated to achieve the 2-nd order temporal accuracy while reducing the linearization and the factorization errors associated with a linear solver. Hence, any time step can be used by only considering physical phenomena. Gauss-Seidel scheme is used to solve linear system of equations. Rigid motion and spring analogy method fur moving mesh are all considered and compared. Special treatments of spring analogy for high aspect ratio cells are presented. Finally, numerical results for oscillating wing are compared with experimental data.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.407-410
• /
• 2006

This study describes a simulation of two-dimensional bubble forming and motion by the Lattice Boltzmann Method with the phase field equation. The free energy model is used to treat the interfacial force and deformation of binary fluids system, drawn into a T-junction the micro channel. A numerical simulation of a binary flow in a cross-junction channel is carried out by using the parallel computation method. The aim in this investigation is to examine the applicability of LBM to numerical analysis of binary fluid separation and motion in the micro channel.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.1
• /
• pp.28-41
• /
• 1997

This paper describes a parallel implementation of a neurla network ensemble developed for object recognition on the connection machine CM-2. The implementation ensures that multiple networks are implemented simultaneously starting from different initial weights and all training samples are applied to each network by one sample per a copy of each network. When compared with a sequential implementation, this accelerates the computation speed by O(N.m.n) where N, m, and n are the network, respectively. The speedup in the computation time and the convergence characteristics of sthe modified backpropagation learning precedure were evaluated by two-dimensional object recognition problem.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.5 no.3
• /
• pp.164-168
• /
• 2012

LDPC decoder architectures are generally classified into serial, parallel and partially parallel architectures. Conventional method of LDPC decoding in general give rise to a large number of computation operations, mass power consumption, and decoding delay. It is necessary to reduce the iteration numbers and computation operations without performance degradation. This paper studies Horizontal Shuffle Scheduling (HSS) algorithm. In the result, number of iteration is half than conventional algorithm without performance degradation. Finally, this paper present design methodology of high-speed LDPC decoder and confirmed its throughput is up to about 600Mbps.

• Nuclear Engineering and Technology
• /
• v.53 no.7
• /
• pp.2162-2173
• /
• 2021

In this paper, the coupling of fine-mesh computational fluid dynamics (CFD) thermal-hydraulics (TH) code and neutronics code is achieved using the Ansys Fluent User Defined Function (UDF) for code development, including parallel meshing mapping, data computation, and data transfer. Also, some CFD schemes are designed for mesh mapping and data transfer to guarantee physical conservation in the coupling computation. Because there is no rigorous research that gives robust guidance on the various CFD schemes that must be obtained before the fine-mesh coupling computation, this work presents a quantitative analysis of the CFD meshing and mapping schemes to improve the accuracy of the value and location of key physical prediction. Furthermore, the effect of the sub-pin scale coupling computation is also studied. It is observed that even the pin-resolved coupling computation can also create a large deviation in the maximum value and spatial locations, which also proves the significance of the research on mesh mapping and data transfer for CFD code in a coupling computation.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.435-443
• /
• 2007

Computing the interior spectrum of large sparse generalized eigenvalue problems $Ax\;=\;{\lambda}Bx$, where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance.