• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.288-292
• /
• 1987

The purpose of this paper is to develope the parallel computation algorithm that enables it to minimize the completion tine of computation execution of the entire subtasks, under the constraints of the series-parallel precedence relation in each subtask. The developed algorithm was applied to the control of a robot manipulator functioned by multi-CPU's and to obtain the minimum time schedule so that real time control may be achieved. The completion time of computation execution was minimized by applying "Variable" Branch and Bound algorithm which was developed In this paper in determining the optimum ordered schedule for each CPU.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.185-193
• /
• 2008

An MTBF(mean time between failures) of large scale parallel systems is known to be only an order of several hours, and large computations sometimes result in a waste of huge amount of CPU time, However. the MPI(Message Passing Interface), a de facto standard for message passing parallel programming, suggests no possibility to handle such a problem. In this paper, we propose an application-level fault tolerant computation system, purely on the basis of the current MPI standard without using any non-standard fault tolerant MPI library, that can be used for general scientific synchronous parallel computation.

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

• Proceedings of the KWS Conference
• /
• 2003.11a
• /
• pp.156-158
• /
• 2003

An implicit finite element implementation for Leblond's transformation plasticity constitutive equations, which are widely used in welded steel structure is proposed in the framework of parallel computing. The implementation is based upon the multiplicative decomposition of deformation gradient and hyper elastic formulation. We examine the efficiency of parallel computation for the finite element analysis of a welded structure using domain-wise multi-frontal solver.

• Structural Engineering and Mechanics
• /
• v.5 no.5
• /
• pp.635-644
• /
• 1997

The paper reviews the implementation and evaluation of exact methods for the computation of transcendental structural eigenvalues, i.e., critical buckling loads and natural frequencies of undamped vibration, on multiple instruction, multiple data parallel computers with distributed memory. Coarse, medium and fine grain parallel methods are described with illustrative examples. The methods are compared and combined into hybrid methods whose performance can be predicted from that of the component methods individually. An indication is given of how performance indicators can be presented in a generic form rather than being specific to one particular parallel computer. Current extensions to permit parallel optimum design of structures are outlined.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.7
• /
• pp.735-741
• /
• 1992

This paper presents a parallel algorithm for the finite element analysis using relatively inexpensive transputer parallel system. The substructure method, which is highly parallel in nature, is used to improve the parallel computing efficiency by splitting up the whole structure into substructures. The proposed algorithm is applied to a simple two-dimensional magnetostatic problem. It is found that the more the number of transputer is increased, the more the total computation time is reduced. And the computational efficiency becomes better as the number of internal boundary nodes becomes smaller.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.2
• /
• pp.41-50
• /
• 2003

In this paper, nonlinear parallel structural analyses are introduced by using the parallel multifrontal solver and damage localization for 2D and 3D crack models is presented as the application of nonlinear parallel computation. The parallel algorithms related with nonliear reduce the amount of memory used is carried out because many variables should be utilized for this highly nonlinear damage analysis. Also, Riks' continuation method is parallelized to search the solution when strain softening occurs due to damage evolution. For damage localization problem, several computational models having up to around 1-million degree of freedoms are used. The parallel performance in this nonlinear parallel algorithm is shown through these examples and the local variation of damage at crack tip is compared among the models with different degree of freedoms.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.65-72
• /
• 2013

Current and future parallel computing model has been suggested for running and solving large-scale application problems such as climate, bio, cryptology, and astronomy, etc. Parallel computing is a form of computation in which many calculations are carried out simultaneously. And we are able to shorten the execution time of the program, as well as can extend the scale of the problem that can be solved. In this paper, we perform the actual cryptographic algorithms through parallel processing and evaluate its efficiency. Length of the key, which is stable criterion of cryptographic algorithm, judged according to the amount of complete enumeration computation. So we present a detailed procedure of DES key search cryptographic algorithms for executing of enumeration computation in parallel processing environment. And then, we did the simulation through applying to clustering system. As a result, we can measure the safety and solidity of cryptographic algorithm.

• Transactions of Materials Processing
• /
• v.7 no.5
• /
• pp.474-480
• /
• 1998

In the present study a domain decomposition scheme using the substructuring method is developed for the computational efficiency of the finite element analysis of metal forming processes. in order to avoid calculation of an inverse matrix during the substructuring procedure, the modified Cholesky decomposition method is implemented. As obtaining the data independence by the substructuring method the program is easily paralleized using the Parallel Virtual machine(PVM) library on a work-station cluster connected on networks. A numerical example for a simple upsetting is calculated and the speed-up ratio with respect to various number of subdomains and number of processors. The efficiency of the parallel computation is discussed by comparing the results.

• 한국전산유체공학회:학술대회논문집
• /
• 2011.05a
• /
• pp.194-198
• /
• 2011

In this study, an efficient algorithm for Delaunay triangulation of a number of points which can be used on a GPU-based parallel computation is studied The developed algorithm is programmed using CUDA library. and the program takes full advantage of parallel computation which are concurrently performed on each of the threads on GPU. The results of partitioned triangulation collected from the GPU computation requires proper stitching between neighboring partitions and calculation of connectivities among triangular cells on CPU In this study, the effect of number of threads on the efficiency and total duration for Delaunay grid generation is studied. And it is also shown that GPU computing using CUDA for Delaunay grid generation is feasible and it saves total time required for the triangulation of the large number points compared to the sequential CPU-based triangulation programs.