• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2009.05a
• /
• pp.196-199
• /
• 2009

높아지는 Graphic Processing Unit (GPU)의 연산 성능과 GPU에서의 범용 프로그래밍을 위한 개발 환경의 개발, 보급으로 인해 GPU를 일반연산에 활용하는 연구가 활발히 진행되고 있다. 이와같이 일반 연산에 활용되고 있는 GPU로 nVidia Tesla와 AMD/ATI의 FireStream 들이 있다. 특수목적 연산 장치인 GPU를 일반 연산을 위해 프로그래밍하기 위해서는 그에 맞는 프로그램 개발 환경이 필요한데 nVidia에서 개발한 CUDA (Compute Unified Device Architecture) 환경은 자사의 GPU 프로그램 개발을 위해 제공되는 개발 환경이다. CUDA 개발 환경은 nVidia GPU 프로그래밍 뿐만 아니라 차세대 이종 병렬 프로그램 개발 환경의 공개 표준으로 논의되고 있는 OpenCL (Open Computing Language) 와 유사한 특징을 보일 것으로 예상되기 때문에 그 중요성은 특정 GPU 에만 국한되지 않는다. 본 논문에서는 경로 적분 몬테 카를로 (Path Integral Monte Carlo) 방법을 CUDA 개발 환경을 사용하여 nVidia GPU 상에서 병렬화한 결과를 제시하였다.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.333-336
• /
• 1991

In this paper, Hopfield & Tank model-like artificial neural network structure is proposed, which can be used for the optimal path planning problems such as the unit commitment problems or the maintenance scheduling problems which have been solved by the dynamic programming method or the branch and bound method. To construct the structure of the neural network, an energy function is defined, of which the global minimum means the optimal path of the problem. To avoid falling into one of the local minima during the optimization process, the simulated annealing method is applied via making the slope of the sigmoid transfer functions steeper gradually while the process progresses. As a result, computer(IBM 386-AT 34MHz) simulations can finish the optimal unit commitment problem with 10 power units and 24 hour periods (1 hour factor) in 5 minites. Furthermore, if the full parallel neural network hardware is contructed, the optimization time will be reduced remarkably.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.03a
• /
• pp.172-177
• /
• 2004

In the present work, we have interests on the modification of parallel implemented with MPI(Message Passing Interface) programming method, 3-Dimensional, unsteady, incompressible Navier-Stokes equation solver to analyze the low-Reynolds number flow In order to accurate calculation aerodynamic coefficients in low-Reynolds number flow field, we modified the two-equation turbulence model. This paper describes the development and validation of a new two-equation model for the prediction of flow transition. It is based on Mentor's low Reynolds $\kappa-\omega$ model with modifications to include Total Stresses Limitation (TSL) and Separation Transition Trigger (STT)

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.343-344
• /
• 2012

With the increase of sensitive data and their secure transmission and storage, the use of encryption techniques has become widespread. The performance of encoding majorly depends on the computational time, so a system with less computational time suits more appropriate as compared to its contrary part. Double Random Phase Encoding (DRPE) is an algorithm with many sub functions which consumes more time when executed serially; the computation time can be significantly reduced by implementing important functions in a parallel fashion on Graphics Processing Unit (GPU). Computing convolution using Fast Fourier transform in DRPE is the most important part of the algorithm and it is shown in the paper that by performing this portion in GPU reduced the execution time of the process by substantial amount and can be compared with MATALB for performance analysis. NVIDIA graphic card GeForce 310 is used with CUDA C as a programming language.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.2
• /
• pp.73-78
• /
• 2005

The management of technological systems will become increasingly complex. Safe and reliable software operation is a significant requirement for many types of system. So, with software fault tolerance, we want to prevent failures by tolerating faults whose occurrences are known when errors are detected. This paper presents a fault location algorithm for single-phase-to-ground faults on the teed circuit of a parallel transmission line using software fault tolerance technique. To find the fault location of transmission line, we have to solve the 3rd order transmission line equation. A significant improvement in the identification of the fault location was accomplished using the N-Version Programming (NVP) design paradigm. The delivered new algorithm has been tested with the simulation data obtained from the versatile EMTP simulator.

• Journal of the Korea Society for Simulation
• /
• v.5 no.2
• /
• pp.25-40
• /
• 1996

Modeling of systems for intensive knowledge-based processing requires a modeling methodology that makes efficient access to the information in huge data base models. The proposed level access mothodology is a modeling approach applicable to systems where data is stored in a hierarchical and modular modules of active memory cells(processor/memory pairs). It significantly reduces the effort required to create discrete event simulation models constructed in hierarchical, modular fashion for above application. Level access mothodology achieves parallel access to models within the modular, hierarchical modules(clusters) by broadcasting the desired operations(e.g. querying information, storing data and so on) to all the cells below a certain desired hierarchical level. Level access methodology exploits the capabilities of object-oriented programming to provide a flexible communication paradigm that combines port-to-port coupling with name-directed massaging. Several examples are given to illustrate the utility of the methodology.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.29-49
• /
• 1983

The algorithm developed in this paper utilized kettelle's [1] idea of the undominated allocation sequence and his way of tableau computation to solve the more general spares allocation problem in the system availability optimization. The algorithm is to optimally allocate resources to the independent modules which are connected to be series/parallel/mixed system configurations. It has advantages over the standard dynamic programming algorithm by eliminating the need for backtracking and by solving the allocation problem for any budget size. By careful heuristic inspection the algorithm can be made very efficient for manual calculations because large blocks of cells can be eliminated from computation. A numerical example is provided to illustrate the allocation algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.95-102
• /
• 1996

This paper describes the realization of a rela-time adaptive acoustic echo canceller, which adopts a microprogramming method, for removing acoustical echoes in speakerphone systems using th eADSP-2101 microprocessor with a pipeline and modified harvard architecture. We apply the LMS (least mean square) algorithm to estimate the coefficients of a transversal FIR filter. For the acustic adaptive echo canceller, we propose a parallel operation programming to imrove algorithm execution speed and apply a nonlinear quantization to reduce the quantization error caused by large dynamic range of voice signal.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.5 no.4
• /
• pp.274-283
• /
• 1981

An inexpensive and very simple microcomputer-aided measurement system has been designed for on-line experiments, which perform simultaneously data acquisition, data recorditing, calculations with the data, and positioning of necessary sensors. Interfacting between the microcomputer and the data acquisition board which consists of A/D converter, analog multiplexer, and sample-and-holder, etc. has been done through IEEE-488 interface port and parallel user port both provided by the PET computer's main logic board. Data and control signals are transfered between devices without handshaking. By utilizing BASIC commands PEEK, POKE, SYS, USR which are offered by PET microcomputer, it is possible to link machine code subroutines into the main BASIC program. This facilitates ease of data transfer, programming, and speedy execution of the program. In addition, an X-Y scanning table has been concected to the system in order to automatically position measuring sensors along a pre-determined path of interest.