• 한국전산유체공학회:학술대회논문집
• /
• 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 Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.492-495
• /
• 2001

In order to utilize a parallel machine tool for CAM system, the development of adequate interpolator is necessary. This paper presents a quintic B-spline interpolator with algorithm of limiting maximum interpolation error. The favored property of near arc-length parametrization in the curve representation is used in the implementation of the reference command generation. Then, this interpolator is applied to cubic parallel manipulator to show its validity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.12
• /
• pp.1072-1080
• /
• 2013

In a the present day, many vision inspection techniques are used in productive industrial areas. In particular, in the semiconductor industry the vision inspection system for wafers is a very important system. Also, inspection techniques for semiconductor wafer production are required to ensure high precision and fast inspection. In order to achieve these objectives, parallel processing of the inspection algorithm is essentially needed. In this paper, we propose the GPU (Graphical Processing Unit)-based parallel processing algorithm for the fast inspection of semiconductor wafers. The proposed algorithm is implemented on GPU boards made by NVIDIA Company. The defect detection performance of the proposed algorithm implemented on the GPU is the same as if by a single CPU, but the execution time of the proposed method is about 210 times faster than the one with a single CPU.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.89-92
• /
• 2018

본 논문에서는 Edge computing 환경에서 다수의 노드들로 구성된 네트워크의 디바이스를 효율적으로 관리하기 위한 방법을 제안한다. 기존의 클라이언트-서버 모델은 모든 데이터와 그에 대한 요청을 중심 서버에서 처리하기 때문에, 다수의 노드로부터 생성된 많은 양의 데이터를 처리하는 데 빠른 응답속도를 보장하지 못한다. Edge computing은 분담을 통해 네트워크의 부담을 줄일 수 있는 IoT 네트워크에 적합한 방법으로, 데이터를 전송하고 받는 과정에서 네트워크의 대역폭을 사용하는 대신 서로 연결된 노드들이 협력해서 데이터를 처리하고, 또한 네트워크 말단에서의 데이터 처리가 허용되어 데이터 센터의 부담을 줄일 수 있다. 여러병렬 기계학습 모델 중 본 연구에서는 Stale Synchronous Parallel(SSP) 모델을 이용하여 Edge 노드에서 분산기계 학습에 적용하였다.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1999.10a
• /
• pp.72-72
• /
• 1999

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.2
• /
• pp.11-22
• /
• 1989

The problem of scheduling n-jobs on m-uniform parallel machines is considered, in which each job has a release time, a deadline, and a processing requirement. The job processing requirements are allocated to the machines so that the maximum of the load differences between time periods is minimized. Based on Federgruen's maximum flow network model to find a feasible schedule, a polynomially bounded algorithm is developed. An example to show the effectiveness of our algorithm is presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1996.03a
• /
• pp.85-90
• /
• 1996

In the word, there is varied types of vibration, and these affect the mechanical industry. In this paper is plates with two parallel sides fixed. Electronic speckle pattern interferometry (ESPI) is one of the optical nondestructive testing technique. By using the ESPI, vibration modes for excitation point, a/b(ratio of longuitudinal and lateral length), and kind of specimen are measured and compared qualitatively with theoritical analysis that Warburton proposed.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.812-819
• /
• 2015

This paper presents a new approach for simulating the internal faults of synchronous machines using distributed computing and Large Change Sensitivity (LCS) analysis. LCS analysis caters for a parallel solution of 3-phase model of a faulted machine within the symmetrical component-based model of interconnected network. The proposed method considers dynamic behavior of the faulty machine and connected system and tries to accurately solve the synchronous machine’s internal fault conditions in the system. The proposed method is implemented in stand-alone FORTRAN-based phasor software and the results have been compared with available recordings from real networks and precisely simulated faults by use of the ATP/EMTP as a time domain software package. An encouraging correlation between the simulation results using proposed method, ATP simulation and measurements was observed and reported. The simplified approach also enables engineers to quickly investigate their particular cases with a reasonable precision.