• 제목/요약/키워드: Parallel computation

검색결과 594건 처리시간 0.027초

High Performance Fortran 병렬 프로그래밍 변환기의 구현 및 성능 평가 (Implementation and Performance Evaluation of Parallel Programming Translator for High Performance Fortran)

  • 김중권;홍만표;김동규
    • 한국정보처리학회논문지
    • /
    • 제6권4호
    • /
    • pp.901-915
    • /
    • 1999
  • 분산 메모리 병렬 컴퓨터의 성능을 충분히 활용하고 프로그래밍의 난이도아 기종간 프로그램의 호환성을 해결하기 위하여 시스템 독립적이고 쉽게 프로그래밍 할 수 있는 데이터 병렬 언어에 대한 연구가 최근에 활발히 진행되고 있다. 대표적인 데이터 병렬 언어인 HPF 컴파일러는 사용자가 정의한 정보를 이용하여 데이터와 연산을 프로세서에 분할하여 할당하고, 메시지 패싱을 생성하는 기능을 제공함으로써 프로그램 작성자에게 전역 주소 공간을 이용하여 병렬 프로그램을 쉽게 개발 할 수 있는 기반을 제공한다. 본 논문에서는 데이터 종속성 분석, 데이터 및 연산 분할과 메시지 패싱 코드 생성의 4단계를 통하여, HPf 입력 프로그램을 MPI 메시지 패싱 코드가 삽입된 SPMD 프로그램으로 변환하는 HPF 병렬 프로그래밍 언어 변환기인 PPTran을 구현하고 그 성능을 검증한다.

  • PDF

COMPARISON OF NUMERICAL SCHEMES ON MULTI-DIMENSIONAL BLACK-SCHOLES EQUATIONS

  • Jo, Joonglee;Kim, Yongsik
    • 대한수학회보
    • /
    • 제50권6호
    • /
    • pp.2035-2051
    • /
    • 2013
  • In this paper, we study numerical schemes for solving multi-dimensional option pricing problem. We compare the direct solving method and the Operator Splitting Method(OSM) by using finite difference approximations. By varying parameters of the Black-Scholes equations for the maximum on the call option problem, we observed that there is no significant difference between the two methods on the convergence criterion except a huge difference in computation cost. Therefore, the two methods are compatible in practice and one can improve the time efficiency by combining the OSM with parallel computation technique. We show numerical examples including the Equity-Linked Security(ELS) pricing based on either two assets or three assets by using the OSM with the Monte-Carlo Simulation as the benchmark.

병렬 타부 탐색법을 이용한 발전기 기동정지계획 (Unit Commitment Using Parallel Tabu Search)

  • 김형수;문경준;조덕환;황기현;박준호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 춘계학술대회 논문집 전력기술부문
    • /
    • pp.84-88
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search (PTS). The TS is efficient optimization method using meta-heuristic. In this paper, to reduce the computation time for evaluating the neighborhoods, an evaluating method only on changed part and a path relinking method as diversification strategy are proposed. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with conventional methods. Numerical results show improvements in the generation cost and the computation time compared to previously obtained results.

  • PDF

이중 포트 램을 이용한 PC와 마이크로 콘트롤러 사이의 데이터 병렬처리에 관한 연구 (A Study on the Data Parallel Processing Between a PC and a Micro-Controller Using a Dual Port RAM)

  • 양주호
    • 수산해양기술연구
    • /
    • 제31권3호
    • /
    • pp.264-271
    • /
    • 1995
  • 제어전용 마이크로 프로세서와 PC간에, 본 연구에서 제안하는 이중 포트 램을 이용한 병렬처리 방식으로 하드웨어를 설계 제작하고, 제어응답실험을 행한 결과 기존의 범용 A/D & D/AC 카드로 수행하기 어려웠던 2개 이상의 제어 대상을 제어하고 모니터링 하는 작업을 원활히 수행할 수 있음을 확인하였다

  • PDF

GPGPU의 멀티 쓰레드를 활용한 고성능 병렬 LU 분해 프로그램의 구현 (Implementation of high performance parallel LU factorization program for multi-threads on GPGPUs)

  • 신봉희;김영태
    • 인터넷정보학회논문지
    • /
    • 제12권3호
    • /
    • pp.131-137
    • /
    • 2011
  • GPGPU는 원래 그래픽 계산을 위한 프로세서인 GPU를 일반 계산에 활용하여 저전력으로 고성능의 효율을 보이는 신개념의 계산 장치이다. 본 논문에서는 GPGPU에서 계산을 하기 위한 병렬 LU 분해법의 알고리즘을 제안하였다. Nvidia GPGPU에서 프로그램을 실행하기 위한 CUDA 계산 환경에서는 계산하고자 하는 데이터 도메인을 블록으로 나누고 각 블록을 쓰레드들이 동시에 계산을 하는데, 이 때 블록들의 계산 순서는 무작위로 진행이 되기 때문에 블록간의 데이터 의존성을 가지는 LU 분해 프로그램에서는 결과가 정확하지 않게 된다. 본 논문에서는 병렬 LU 분해법에서 블록간의 계산 순서를 인위적으로 정하는 구현 방식을 제안하며 아울러 LU 분해법의 부분 피벗팅을 계산하기 위한 병렬 reduction 알고리즘도 제안한다. 또한 구현된 병렬프로그램의 성능 분석을 통하여 GPGPU의 멀티 쓰레드 기반으로 고성능으로 계산할 수 있는 병렬프로그램의 효율성을 보인다.

영역분할법과 유한요소해석을 이용한 유동장의 병렬계산 (Parallel Computation of a Flow Field Using FEM and Domain Decomposition Method)

  • 최형권;김범준;강성우;유정열
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2002년도 학술대회지
    • /
    • pp.55-58
    • /
    • 2002
  • Parallel finite element code has been recently developed for the analysis of the incompressible Wavier-Stokes equations using domain decomposition method. Metis and MPI libraries are used for the domain partitioning of an unstructured mesh and the data communication between sub-domains, respectively. For unsteady computation of the incompressible Navier-Stokes equations, 4-step splitting method is combined with P1P1 finite element formulation. Smagorinsky and dynamic model are implemented for the simulation of turbulent flows. For the validation performance-estimation of the developed parallel code, three-dimensional Laplace equation has been solved. It has been found that the speed-up of 40 has been obtained from the present parallel code fir the bench mark problem. Lastly, the turbulent flows around the MIRA model and Tiburon model have been solved using 32 processors on IBM SMP cluster and unstructured mesh. The computed drag coefficient agrees better with the existing experiment as the mesh resolution of the region increases, where the variation of pressure is severe.

  • PDF

병렬 유전알고리즘과 병렬 타부탐색법을 이용한 발전기 기동정지계획 (Unit Commitment Using Parallel Genetic Algorithms and Parallel Tabu Search)

  • 조덕환;강현태;권정욱;김형수;황기현;박준호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2001년도 하계학술대회 논문집 A
    • /
    • pp.327-329
    • /
    • 2001
  • This paper presents the application of Parallel genetic algorithm and parallel tabu search to search an optimal solution of a unit commitment problem. The proposed method previously searches the solution globally using the parallel genetic algorithm, and then searches the solution locally using tabu search which has the good local search characteristic to reduce the computation time. This method combines the benefit of both method, and thus improves the performance. To show the usefulness of the proposed method, we simulated for 10 units system. Numerical results show the improvements of cost and computation time compared to previous obtained results.

  • PDF

병렬 타부 탐색법을 이용한 대규모의 발전기 기동정지계획 (Large Scale Unit Commitment Using Parallel Tabu Search)

  • 김형수;문경준;조덕환;황기현;박준호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제50권11호
    • /
    • pp.528-536
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

  • PDF

Numerical Simulation of Natural Convection in Annuli with Internal Fins

  • Ha, Man-Yeong;Kim, Joo-Goo
    • Journal of Mechanical Science and Technology
    • /
    • 제18권4호
    • /
    • pp.718-730
    • /
    • 2004
  • The solution for the natural convection in internally finned horizontal annuli is obtained by using a numerical simulation of time-dependent and two-dimensional governing equations. The fins existing in annuli influence the flow pattern, temperature distribution and heat transfer rate. The variations of the On configuration suppress or accelerate the free convective effects compared to those of the smooth tubes. The effects of fin configuration, number of fins and ratio of annulus gap width to the inner cylinder radius on the fluid flow and heat transfer in annuli are demonstrated by the distribution of the velocity vector, isotherms and streamlines. The governing equations are solved efficiently by using a parallel implementation. The technique is adopted for reduction of the computation cost. The parallelization is performed with the domain decomposition technique and message passing between sub-domains on the basis of the MPI library. The results from parallel computation reveal in consistency with those of the sequential program. Moreover, the speed-up ratio shows linearity with the number of processor.

A Design of Parallel Processing for Wavelet Transformation on FPGA (ICCAS 2005)

  • Ngowsuwan, Krairuek;Chisobhuk, Orachat;Vongchumyen, Charoen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.864-867
    • /
    • 2005
  • In this paper we introduce a design of parallel architecture for wavelet transformation on FPGA. We implement wavelet transforms though lifting scheme and apply Daubechies4 transform equations. This technique has an advantage that we can obtain perfect reconstruction of the data. We divide our process to high pass filter and low pass filter. With this division, we can find coefficients from low and high pass filters simultaneously using parallel processing properties of FPGA to reduce processing time. From the equations, we have to design real number computation module, referred to IEEE754 standard. We choose 32 bit computation that is fine enough to reconstruct data. After that we arrange the real number module according to Daubechies4 transform though lifting scheme.

  • PDF