• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.183-192
• /
• 2000

This paper considers the problem of scheduling a set of n jobs on m parallel machines to minimize total weighted tardiness. For the problem a genetic algorithm is proposed, in which solutions are encoded using the random key method suggested by Bean and new crossover operators are employed to increase performance of the algorithm. The algorithm is compared with the Modified Due-Date (MDD) algorithm after series of tests to find appropriate values for genetic parameters. Results of computational tests on randomly generated test problems show that the suggested algorithm performs better than the MDD algorithm and gives good solutions in a reasonable amount of computation time.

• Proceedings of the KIPE Conference
• /
• 2010.07a
• /
• pp.448-449
• /
• 2010

This paper proposes a sensorless control strategy for the Interior Permanent Magnet Synchronous Motor (IPMSM) by using the parallel reduced-order Extended Kalman Filter. The sensorless control strategy is composed with two EKFs alternately computed every sampling period with a new model. The new model is based on the extended electromotive force (EEMF) which has a simple structure, making position estimation possible without approximation. The proposed strategy can save computation time and estimate rotor speed and position. To verify the merit of the proposed strategy, simulation and experimental results validate the theoretical analysis and show the feasibility of the proposed control strategy.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.20 no.4
• /
• pp.277-293
• /
• 2016

We develop an efficient numerical method for pricing the Derivative Linked Securities (DLS). The payoff structure of the hybrid DLS consists with a standard 2-Star step-down type ELS and the range accrual product which depends on the number of days in the coupon period that the index stay within the pre-determined range. We assume that the 2-dimensional Geometric Brownian Motion (GBM) as the model of two equities and a no-arbitrage interest model (One-factor Hull and White interest rate model) as a model for the interest rate. In this study, we employ the Monte Carlo simulation method with the Compute Unified Device Architecture (CUDA) parallel computing as the General Purpose computing on Graphic Processing Unit (GPGPU) technology for fast and efficient numerical valuation of DLS. Comparing the Monte Carlo method with single CPU computation or MPI implementation, the result of Monte Carlo simulation with CUDA parallel computing produces higher performance.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.79-89
• /
• 1997

Logic programming has many advantages as a paradigm for parallel programming because it offers ease of programming while retaining high expressive power due to its declarative semantics. In parallel logic programming, one of the important issues is the compile-time parallelism detection. Static data-dependency analysis has been widely used to gather some information needed for the detection of AND-parallelism. However, the static data-dependency analysis cannot fully detect AND-parallelism because it does not provide some necessary functions such as the propagation of groundness. As an alternative approach, abstract interpretation provides a promising way to deal with AND-parallelism detection, while a full-blown abstract interpretation is not efficient in terms of computation since it inherently employs some complex operations not necessary for gathering the information on AND-parallelism. In this paper, we propose an abstract domain which can provide a precise and efficient way to use the abstract interpretation for the detection of AND-parallelism of logic programs.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.9
• /
• pp.540-546
• /
• 2003

A fast pattern classification algorithm with Cellular Nonlinear Network-based dynamic programming is proposed. The Cellular Nonlinear Networks is an analog parallel processing architecture and the dynamic programing is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast pattern classification with optimization is formed. On such CNN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The algorithm is similar to the conventional neural network-based method in the use of the exemplar patterns but quite different in the use of the most likely path finding of the dynamic programming. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.05b
• /
• pp.109-114
• /
• 2003

Depth error correction effect for maladjusted stereo cameras with calibrated pixel distance parameter is presented. The camera calibration is a necessary procedure for stereo vision-based depth computation. Intra and extra parameters should be obtain to determine the relation between image and world coordination through experiment. One difficulty is in camera alignment for parallel installation: placing two CCD arrays in a plane. No effective methods for such alignment have been presented before. Some amount of depth error caused from such non-parallel installation of cameras is inevitable. If the pixel distance parameter which is one of intra parameter is calibrated with known points, such error can be compensated in some amount. Such error compensation effect with the calibrated pixel distance parameter is demonstrated with various experimental results.

• 유체기계공업학회:학술대회논문집
• /
• 2004.12a
• /
• pp.462-468
• /
• 2004

Large eddy simulation(LES) methodology used to model isothermal non-swirling and swirling flows in a model gas turbine combustor. The LES solver was implemented on parallel computer consisting 16 processors. To verify the capability of LES code and characterize swirling flow, the results was compared with that of Reynolds Averaged Navier-Stokes(RANS) using k -$\epsilon$ model as well as experimental data. The results showed that the LES and RANS well predicted the mean velocity field of a non-swirling flow. Specially, the LES showed a very excellent prediction performance for the corner recirculation zone. In swirling flow, comparing with the results obtained by RANS, LES showed a better performance in predicting the mean axial and azimuthal velocities, and the central recirculation zone. Finally, unsteady phenomena of turbulent flow was examined with LES methodology.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.51-58
• /
• 1994

Mathematical morphology based on set theory is easy to be implemented in parallel and can be applied to various fields in image analysis. Particularly mophological pattern spectrum can detect critical scales in an image object and quantify various aspects of the shape-size content. In this paper, texture classification using pattern spectrum based on morphological subband decomposition is porposed. The low-low band extracts pattern spectrum features, and the high-low, low-high, and high-high bands extrack the structural information. This approach has the advantages of efficient information extraction, less time-consuming, high accuacy, less computation, and parallel implementation.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.314-317
• /
• 2000

Cluster system provides attractive scalability in terms of computation power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive parallel machines. In parallel processing program, each task load is difficult to predict before running the program and each task is interdependent each other in many ways. Load imbalancing induces an obstacle to system performance. Most of researches in load balancing were concerned with distributed system but researches in cluster system are few. In cluster system, the dynamic load balancing algorithm which evaluates each processor's load in runtime is purpose that the load of each node are evenly distributed. But, if communication cost or node complexity becomes high, it is not effective method for all nodes to attend load balancing process. In that circumstances, it is good to reduce the number of node which attend to load balancing process. We have modeled cluster systems and proposed marginal dynamic load balancing algorithms suitable for that circumstances.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.63-74
• /
• 2011

As a powerful and flexible processor, the Graphic Processing Unit (GPU) can offer a great faculty in solving many high-performance computing applications. Sweep3D, which simulates a single group time-independent discrete ordinates (Sn) neutron transport deterministically on 3D Cartesian geometry space, represents the key part of a real ASCI application. The wavefront process for parallel computation in Sweep3D limits the concurrent threads on the GPU. In this paper, we present multi-dimensional optimization methods for Sweep3D, which can be efficiently implemented on the finegrained parallel architecture of the GPU. Our results show that the overall performance of Sweep3D on the CPU-GPU hybrid platform can be improved up to 4.38 times as compared to the CPU-based implementation.