• 한국전산유체공학회:학술대회논문집
• /
• 2003.08a
• /
• pp.63-68
• /
• 2003

The Grid[1] is a communication service that collaborates dispersed high performance computers so that those can be shared and worked together. So, the Grid enables a researcher to analyze a huge-sized problem which was impossible by using local resources. However, diverse communication speeds among computing resources and heterogeneity of computing resources can reduce parallel efficiency in the Grid, The present paper focuses on the development of an efficient load balancing algorithm suitable for the Grid. Proposed algorithm classifies the whole processors into several groups with relatively faster communication speeds. Computational domain is firstly partitioned to each group and then to the processor level considering the performance of each processor. Developed algorithm is validated in the homogeneous system by comparing the present result with the result of equally partitioned meshes and then applied to the heterogeneous system. Additionally, the present algorithm is expanded to be able to solve the decomposed domains and applied to some problems.

• Journal of computational fluids engineering
• /
• v.12 no.4
• /
• pp.28-37
• /
• 2007

In this study, a multi-block structured grid deformation code based on a hybrid of a transfinite interpolation algorithm and spring analogy was developed. The configuration was modeled by a Bezier surface. A combination of the spring analogy for block vertices and the transfinite interpolation for interior grid points helps to increase the robustness and makes it suitable for distributed computing. An elliptic smoothing operator was applied to the block faces with sub-faces in order to maintain the grid smoothness and skewness. The capability of this code was demonstrated on a range of simple and complex configurations including an airfoil and a wing-body configuration.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.177-181
• /
• 2007

Present study examines the numerical issues of cell structure simulation for various regimes of detonation phenomena ranging from weakly unstable to highly unstable detonations. Inviscid fluid dynamics equations with $variable-{\gamma}$ formulation and one-step Arrhenius reaction model are solved by a MUSCL-type TVD scheme and 4th order accurate Runge-Kutta time integration scheme. A series of numerical studies are carried out for the different regimes of the detonation phenomena to investigate the computational requirements for the simulation of the detonation wave cell structure by varying the reaction constants and grid resolutions. The computational results are investigated by comparing the solution of steady ZND structure to draw out the minimum grid resolutions and the size of the computational domain for the capturing cell structures of the different regimes of the detonation phenomena.

• Journal of computational fluids engineering
• /
• v.2 no.1
• /
• pp.84-92
• /
• 1997

In this paper a new structured grid generation technique is introduced. This new technique utilizes predictor-corrector approach, and is a marching scheme in the global sense as the hyperbolic scheme is. In the predictor step, one layer of grid cells is obtained by using Modified Advancing Front Method which generates a collection of quadrilateral cells simultaneously. In the corrector step, the layer of grid cells that is calculated in the predictor step is adjusted by solving Laplace equations to prevent grid lines from skewing and overlapping in highly curved configurations. It is shown that the resultant algorithm, named a MAP scheme, which combines the Modified Advancing Front Method as a Predictor with an elliptic scheme as a corrector can be used to generate globally smooth and locally near-orthogonal grids for external flow fields even for highly curved configurations. Examples of grid generations for external flow fields about several configurations by use of the present approach are given, and its applicability and flexibility have been demonstrated and discussed.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.103-107
• /
• 2007

Computational Fluid Dynamics (CFD in short) approach is now playing an important role in the engineering process recently. Generating proper grid system for the region of interest in time is prerequisite for the efficient numerical calculation of flow physics using CFD approach. Grid generation is, however, usually considered as a major obstacle for a routine and successful application of numerical approaches in the engineering process. CFD approach based on the unstructured grid system is gaining popularity due to its simplicity and efficiency for generating grid system compared to the structured grid approaches. In this paper an automated triangular surface grid generation using CAD surface data is proposed According to the present method, the CAD surface data imported in the STL format is processed to identify feature edges defining the topology and geometry of the surface shape first. When the feature edges are identified, node points along the edges are distributed. The initial fronts which connect those feature edge nodes are constructed and then they are advanced along the CAD surface data inward until the surface is fully covered by triangular surface grid cells using Advancing Front Method. It is found that this approach can be implemented in an automated way successfully saving man-hours and reducing human-errors in generating triangular surface grid system.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.04a
• /
• pp.86-93
• /
• 1999

구조 설계지원 시스템의 최종적인 목표는 설계의 진행 시, 수없이 발생하는 선택의 과정이 구조물 품질 향상의 방향으로 이루어 질 수 있도록 하는 것이다. 이를 위해서는 두 가지의 해결 방안이 필수적이다. 하나는 구조 설계지원 시스템이 담당해야 하는 설계영역을 고객의 요구조건으로부터 최종 해결안을 도출시키는 차원까지 확대시켜야 하며, 두 번째는 품질을 정의하는 구조물의 성능이 다양하면서 서로 상반되기 때문에 이들을 동시에 만족시켜줄 수 있는 방안을 모색해야 한다는 점이다. 본 논문에서는 이러한 문제점을 해결할 수 있는 구조 설계지원시스템을 특히 Grid-like 타입의 구조물에 관하여 논의하고자 한다.

• Journal of computational fluids engineering
• /
• v.2 no.2
• /
• pp.18-25
• /
• 1997

A pressure-based Navier-Stokes numerical solver was used to compare solutions of the k-ε/RNG k-ε turbulence models. An efficient grid generation scheme, the transient grid generation with full boundary control, was used to solve the flows in the tip clearance region. Results indicate that the calculations using k-ε model captures various phenomena related to the tip clearance with good accuracy.

• Journal of computational fluids engineering
• /
• v.11 no.2 s.33
• /
• pp.62-66
• /
• 2006

In this paper an automated hole-finding method for overset grids is introduced which uses recursive octree-cell division. A graphic program which enables the user to do the hole-cutting with ease is also introduced. Using this program it is found that there is an optimum combination of the level of octree division and vector calculation for the efficient and fast hole finding.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.217-218
• /
• 2006

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.