• Title/Summary/Keyword: parallel computation

Search Result 594, Processing Time 0.025 seconds

Application of the Method of Moments to the Capacitance Computation of a Parallel-Plate Rectangular Capacitor

  • Roh, Young-Su
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.28 no.11
    • /
    • pp.93-99
    • /
    • 2014
  • The method of moments is applied to numerically compute the electrostatic capacitance of a parallel-plate rectangular capacitor of finite area. Each plate is discretized into 900 patches per unit area to ensure a high accuracy of computation. To further enhance computational results, the impedance matrix elements are additionally evaluated in the case that the observation patch is located above or below the source patch in the vertical direction. To examine the fringing effect at the edges of the capacitor, the normalized capacitances are computed as a function of separation distance. After these results have been verified by Palmer's formula, this method is extended to the computation of capacitances between two different size plates.

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

  • LEE, CHANG-OCK;PARK, JONGHO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.2
    • /
    • pp.161-197
    • /
    • 2020
  • Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

Parallel Design and Implementation of Shot Boundary Detection Algorithm (샷 경계 탐지 알고리즘의 병렬 설계와 구현)

  • Lee, Joon-Goo;Kim, SeungHyun;You, Byoung-Moon;Hwang, DooSung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.76-84
    • /
    • 2014
  • As the number of high-density videos increase, parallel processing approaches are necessary to process a large-scale of video data. When a processing method of video data requires thousands of simple operations, GPU-based parallel processing is preferred to CPU-based parallel processing by way of reducing the time and space complexities of a given computation problem. This paper studies the parallel design and implementation of a shot-boundary detection algorithm. The proposed shot-boundary detection algorithm uses pixel brightness comparisons and global histogram data among the blocks of frames, and the computation of these data is characterized with the high parallelism for the related operations. In order to maximize these operations in parallel, the computations of the pixel brightness and histogram are designed in parallel and implemented in NVIDIA GPU. The GPU-based shot detection method is tested with 10 videos from the set of videos in National Archive of Korea. In experiments, the detection rate is similar but the computation time is about 10 time faster to that of the CPU-based algorithm.

Study on Parallel Processing for Efficient Flexible Multibody Analysis based on Subsystem Synthesis Method (병렬 처리를 이용한 부분 시스템 기반 유연다물체 동역학의 효율적인 해석 연구)

  • Han, Jong-Boo;Song, Hajun;Kim, Sung-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.41 no.6
    • /
    • pp.507-515
    • /
    • 2017
  • Flexible multibody simulations are widely used in the industry to design mechanical systems. In flexible multibody dynamics, deformation coordinates are described either relatively in the body reference frame that is floating in the space or in the inertial reference frame. Moreover, these deformation coordinates are generated based on the discretization of the body according to the finite element approach. Therefore, the formulation of the flexible multibody system always deals with a huge number of degrees of freedom and the numerical solution methods require a substantial amount of computational time. Parallel computational methods are a solution for efficient computation. However, most of the parallel computational methods are focused on the efficient solution of large-sized linear equations. For multibody analysis, we need to develop an efficient formulation that could be suitable for parallel computation. In this paper, we developed a subsystem synthesis method for a flexible multibody system and proposed efficient parallel computational schemes based on the OpenMP API in order to achieve efficient computation. Simulations of a rotating blade system, which consists of three identical blades, were carried out with two different parallel computational schemes. Actual CPU times were measured to investigate the efficiency of the proposed parallel schemes.

The Optimum Design of Airfoil Shape with Parallel Computation (병렬연산을 이용한 익형의 최적 설계)

  • Jo,Jang-Geun;Park,Won-Gyu
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.1
    • /
    • pp.1-7
    • /
    • 2003
  • The aerodynamic optimization method for airfoil design was described in this paper. The Navier-Stokes equations were solved to consider the viscous flow information around an airfoil. The Modified Method of Feasible Direction(MMFD) was used for sensitivity analysis and the polynomial interpolation was used for distance calculation of the minimization. The Message Passing Interface(MPI) library of parallel computation was adopted to reduce the computation time of flow solver by decomposing the entire computational domain into 8 sub-domains and one-to-one allocating 8 processors to 8 sub-domains. The parallel computation was also used to compute the sensitivity analysis by allocating each search direction to each processor. The present optimization reduced the drag of airfoil while the lift is maintained at the tolerable design value.

DEVELOPMENT OF A CORE THERMO-FLUID ANALYSIS CODE FOR PRISMATIC GAS COOLED REACTORS

  • Tak, Nam-Il;Lee, Sung Nam;Kim, Min-Hwan;Lim, Hong Sik;Noh, Jae Man
    • Nuclear Engineering and Technology
    • /
    • v.46 no.5
    • /
    • pp.641-654
    • /
    • 2014
  • A new computer code, named CORONA (Core Reliable Optimization and thermo-fluid Network Analysis), was developed for the core thermo-fluid analysis of a prismatic gas cooled reactor. The CORONA code is targeted for whole-core thermo-fluid analysis of a prismatic gas cooled reactor, with fast computation and reasonable accuracy. In order to achieve this target, the development of CORONA focused on (1) an efficient numerical method, (2) efficient grid generation, and (3) parallel computation. The key idea for the efficient numerical method of CORONA is to solve a three-dimensional solid heat conduction equation combined with one-dimensional fluid flow network equations. The typical difficulties in generating computational grids for a whole core analysis were overcome by using a basic unit cell concept. A fast calculation was finally achieved by a block-wise parallel computation method. The objective of the present paper is to summarize the motivation and strategy, numerical approaches, verification and validation, parallel computation, and perspective of the CORONA code.

Modeling, Identification and Control of a Redundant Planar 2-DOF Parallel Manipulator

  • Zhang, Yao-Xin;Cong, Shuang;Shang, Wei-Wei;Li, Ze-Xiang;Jiang, Shi-Long
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.5
    • /
    • pp.559-569
    • /
    • 2007
  • In this paper, the dynamic controller design problem of a redundant planar 2-dof parallel manipulator is studied. Using the Euler-Lagrange equation, we formulate the dynamic model of the parallel manipulator in the joint space and propose an augmented PD controller with forward dynamic compensation for the parallel manipulator. By formulating the controller in the joint space, we eliminate the complex computation of the Jacobian matrix of joint angles with end-effector coordinate. So with less computation, our controller is easier to implement, and a shorter sampling period can be achieved, which makes the controller more suitable for high-speed motion control. Furthermore, with the combination of static friction model and viscous friction model, the active joint friction of the parallel manipulator is studied and compensated in the controller. Based on the dynamic parameters of the parallel manipulator evaluated by direct measurement and identification, motion control experiments are implemented. With the experiments, the validity of the dynamic model is proved and the performance of the controller is evaluated. Experiment results show that, with forward dynamic compensation, the augmented PD controller can improve the tracking performance of the parallel manipulator over the simple PD controller.

A Parallel Emulation Scheme for Data-Flow Architecture on Loosely Coupled Multiprocessor Systems (이완 결합형 다중 프로세서 시스템을 사용한 데이터 플로우 컴퓨터 구조의 병렬 에뮬레이션에 관 한 연구)

  • 이용두;채수환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1902-1918
    • /
    • 1993
  • Parallel architecture based on the von Neumann computation model has a limitation as a massively parallel architecture due to its inherent drawback of architectural features. The data-flow model of computation has a high programmability in software perspective and high scalability in hardware perspective. However, the practical programming and experimentaion of date-flow architectures are hardly available due to the absence of practical data-flow, we present a programming environment for performing the data-flow computation on conventional parallel machines in general, loosely compled multiprocessor system in particular. We build an emulator for tagged token data-flow architecture on the iPSC/2 hypercube, a loosely coupled multiprocessor system. The emulator is a shallow layer of software executing on an iPSC/2 system, and thus makes the iPSC/2 system work as a data-flow architecture from the programmer`s viewpoint. We implement various numerical and non-numerical algorithm in a data-flow assembler language, and then compare the performance of the program with those of the versions of conventional C language, Consequently, We verify the effectiveness of this programming environment based on the emulator in experimenting the data-flow computation on a conventional parallel machine.

  • PDF

A STATIC IMAGE RECONSTRUCTION ALGORITHM IN ELECTRICAL IMPEDANCE TOMOGRAPHY (임피던스 단층촬영기의 정적 영상 복원 알고리즘)

  • Woo, Eung-Je;Webster, John G.;Tompkins, Willis J.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1991 no.05
    • /
    • pp.5-7
    • /
    • 1991
  • We have developed an efficient and robust image reconstruction algorithm for static impedance imaging. This improved Newton-Raphson method produced more accurate images by reducing the undesirable effects of the ill-conditioned Hessian matrix. We found that our electrical impedance tomography (EIT) system could produce two-dimensional static images from a physical phantom with 7% spatial resolution at the center and 5% at the periphery. Static EIT image reconstruction requires a large amount of computation. In order to overcome the limitations on reducing the computation time by algorithmic approaches, we implemented the improved Newton-Raphson algorithm on a parallel computer system and showed that the parallel computation could reduce the computation time from hours to minutes.

  • PDF

Experimental and Numerical Study on the Binary Fluid Flows in a Micro Channel (마이크로 채널 내의 이상유동에 대한 실험 및 수치해석적 연구)

  • Park, Jae-Hyoun;Heo, Hyeung-Seok;Suh, Young-Kweon
    • 한국가시화정보학회:학술대회논문집
    • /
    • 2006.12a
    • /
    • pp.86-91
    • /
    • 2006
  • In this parer, we present the bubble forming and motion in the micro channel by using the two-dimensional numerical computation and experiment. In the numerical computation, The Lattice Boltzmann method(LBM) and free-energy model is used to treat the interfacial force and deformation of binary fluid system, drawn in to a micro channel and a numerical simulation is carried out by using the parallel computation method. The urn in this investigation is to examine the applicability of LBM to numerical analysis and experimental method of binary fluid separation and motion in the micro channel.

  • PDF