• Title/Summary/Keyword: Parallel Decomposition

Search Result 186, Processing Time 0.023 seconds

Manipulability Analysis of a Parallel Machine Tool: Application to Optimal Link Parameters Design (병렬형 공작기계의 조작성 해석: 기구부 최적설계에 적용)

  • Kim, Jeom-Goo;Hong, Keum-Shik;Park, Frank-C.;Kim, Jong-Won
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.16 no.11
    • /
    • pp.213-223
    • /
    • 1999
  • In this paper, input-output transmission characteristics of the Eclipse, which is a parallel machine tool capable of 5 face rapid machining, are investigated. By splitting the weighted Jacobian matrix into two parts, the force and moment transmission characteristics together with the velocity and angular velocity transmission characteristics are analyzed. A new manipulability measure, which combines the volume of the manipulability ellipsoid and the condition number of the splitted Jcobian matrix, is proposed. Two link parameters, the ratio of upper and lower platforms' radii and the length of a supporting link of the Eclipse, are designed by applying the new manipulability measure derived. Computer simulations are provided.

  • PDF

Development of a drift-flux model based core thermal-hydraulics code for efficient high-fidelity multiphysics calculation

  • Lee, Jaejin;Facchini, Alberto;Joo, Han Gyu
    • Nuclear Engineering and Technology
    • /
    • v.51 no.6
    • /
    • pp.1487-1503
    • /
    • 2019
  • The methods and performance of a pin-level nuclear reactor core thermal-hydraulics (T/H) code ESCOT employing the drift-flux model are presented. This code aims at providing an accurate yet fast core thermal-hydraulics solution capability to high-fidelity multiphysics core analysis systems targeting massively parallel computing platforms. The four equation drift-flux model is adopted for two-phase calculations, and numerical solutions are obtained by applying the Finite Volume Method (FVM) and the Semi-Implicit Method for Pressure-Linked Equation (SIMPLE)-like algorithm in a staggered grid system. Constitutive models involving turbulent mixing, pressure drop, and vapor generation are employed to simulate key phenomena in subchannel-scale analyses. ESCOT is parallelized by a domain decomposition scheme that involves both radial and axial decomposition to enable highly parallelized execution. The ESCOT solutions are validated through the applications to various experiments which include CNEN $4{\times}4$, Weiss et al. two assemblies, PNNL $2{\times}6$, RPI $2{\times}2$ air-water, and PSBT covering single/two-phase and unheated/heated conditions. The parameters of interest for validation include various flow characteristics such as turbulent mixing, spacer grid pressure drop, cross-flow, reverse flow, buoyancy effect, void drift, and bubble generation. For all the validation tests, ESCOT shows good agreements with measured data in the extent comparable to those of other subchannel-scale codes: COBRA-TF, MATRA and/or CUPID. The execution performance is examined with a mini-sized whole core consisting of 89 fuel assemblies and for an OPR1000 core. It turns out that it is about 1.5 times faster than a subchannel code based on the two-fluid three field model and the axial domain decomposition scheme works as well as the radial one yielding a steady-state solution for the OPR1000 core within 30 s with 104 processors.

Multi-DNN Acceleration Techniques for Embedded Systems with Tucker Decomposition and Hidden-layer-based Parallel Processing (터커 분해 및 은닉층 병렬처리를 통한 임베디드 시스템의 다중 DNN 가속화 기법)

  • Kim, Ji-Min;Kim, In-Mo;Kim, Myung-Sun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.6
    • /
    • pp.842-849
    • /
    • 2022
  • With the development of deep learning technology, there are many cases of using DNNs in embedded systems such as unmanned vehicles, drones, and robotics. Typically, in the case of an autonomous driving system, it is crucial to run several DNNs which have high accuracy results and large computation amount at the same time. However, running multiple DNNs simultaneously in an embedded system with relatively low performance increases the time required for the inference. This phenomenon may cause a problem of performing an abnormal function because the operation according to the inference result is not performed in time. To solve this problem, the solution proposed in this paper first reduces the computation by applying the Tucker decomposition to DNN models with big computation amount, and then, make DNN models run in parallel as much as possible in the unit of hidden layer inside the GPU. The experimental result shows that the DNN inference time decreases by up to 75.6% compared to the case before applying the proposed technique.

Parallelization of Multi-Block Flow Solver with Multi-Block/Multi-Partitioning Method (다중블록/다중영역분할 기법을 이용한 유동해석 코드 병렬화)

  • Ju, Wan-Don;Lee, Bo-Sung;Lee, Dong-Ho;Hong, Seung-Gyu
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.7
    • /
    • pp.9-14
    • /
    • 2003
  • In this work, a multi-block/multi-partitioning method is suggested for a multi-block parallelization. It has an advantage of uniform load balance via subdividing of each block on each processor. To make a comparison of parallel efficiency according to domain decomposition method, a multi-block/single-partitioning and a multi-block/ multi-partitioning methods are applied to the flow analysis solver. The multi-block/ multi-partitioning method has more satisfactory parallel efficiency because of optimized load balancing. Finally, it has applied to the CFDS code. As a result, the computing speed with sixteen processors is over twelve times faster than that of sequential solver.

A framework for parallel processing in multiblock flow computations (다중블록 유동해석에서 병렬처리를 위한 시스템의 구조)

  • Park, Sang-Geun;Lee, Geon-U
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.21 no.8
    • /
    • pp.1024-1033
    • /
    • 1997
  • The past several years have witnessed an ever-increasing acceptance and adoption of parallel processing, both for high performance scientific computing as well as for more general purpose applications. Furthermore with increasing needs to perform the complex flow calculations in an efficient manner, the use of the message passing model on distributed networks has emerged as an important alternative to the expensive supercomputers. This work attempts to provide a generic framework to enable the parallelization of all CFD-related works using the master-slave model. This framework consists of (1) input geometry, (2) domain decomposition, (3) grid generation, (4) flow computations, (5) flow visualization, and (6) output display as the sequential components, but performs computations for (2) to (5) in parallel on the workstation clustering. The flow computations are parallized by having multiple copies of the flow-code to solve a PDE on different spatial regions on different processors, while their flow data are exchanged across the region boundaries, and the solution is time-stepped. The Parallel Virtual Machine (PVM) is used for distributed communication in this work.

Parallel Finite Element Simulation of the Incompressible Navier-stokes Equations (병렬 유한요소 해석기법을 이용한 유동장 해석)

  • Choi H. G.;Kim B. J.;Kang S. W.;Yoo J. Y.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2002.05a
    • /
    • pp.8-15
    • /
    • 2002
  • For the large scale computation of turbulent flows around an arbitrarily shaped body, a parallel LES (large eddy simulation) code has been recently developed in which domain decomposition method is adopted. METIS and MPI (message Passing interface) libraries are used for domain partitioning and data communication between processors, respectively. For unsteady computation of the incompressible Wavier-Stokes equation, 4-step splitting finite element algorithm [1] is adopted and Smagorinsky or dynamic LES model can be chosen fur the modeling of small eddies in turbulent flows. For the validation and performance-estimation of the parallel code, a three-dimensional laminar flow generated by natural convection inside a cube has been solved. Then, we have solved the turbulent flow around MIRA (Motor Industry Research Association) model at $Re = 2.6\times10^6$, which is based on the model height and inlet free stream velocity, using 32 processors on IBM SMP cluster and compared with the existing experiment.

  • PDF

Domain Decomposition Strategy for Pin-wise Full-Core Monte Carlo Depletion Calculation with the Reactor Monte Carlo Code

  • Liang, Jingang;Wang, Kan;Qiu, Yishu;Chai, Xiaoming;Qiang, Shenglong
    • Nuclear Engineering and Technology
    • /
    • v.48 no.3
    • /
    • pp.635-641
    • /
    • 2016
  • Because of prohibitive data storage requirements in large-scale simulations, the memory problem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise three-dimensional (3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements are analyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, material data, and isotope densities in depletion are three major parts of memory storage. The domain decomposition method is investigated as a means of saving memory, by dividing spatial geometry into domains that are simulated separately by parallel processors. For the validity of particle tracking during transport simulations, particles need to be communicated between domains. In consideration of efficiency, an asynchronous particle communication algorithm is designed and implemented. Furthermore, we couple the domain decomposition method with MC burnup process, under a strategy of utilizing consistent domain partition in both transport and depletion modules. A numerical test of 3D full-core burnup calculations is carried out, indicating that the RMC code, with the domain decomposition method, is capable of pin-wise full-core burnup calculations with millions of depletion regions.

Raining Image Enhancement and Its Processing Acceleration for Better Human Detection (사람 인식을 위한 비 이미지 개선 및 고속화)

  • Park, Min-Woong;Jeong, Geun-Yong;Cho, Joong-Hwee
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.6
    • /
    • pp.345-351
    • /
    • 2014
  • This paper presents pedestrian recognition to improve performance for vehicle safety system or surveillance system. Pedestrian detection method using HOG (Histograms of Oriented Gradients) has showed 90% recognition rate. But if someone takes a picture in the rain, the image may be distorted by rain streaks and recognition rate goes down by 62%. To solve this problem, we applied image decomposition method using MCA (Morphological Component Analysis). In this case, rain removal method improves recognition rate from 62% to 70%. However, it is difficult to apply conventional image decomposition method using MCA on vehicle safety system or surveillance system as conventional method is too slow for real-time system. To alleviate this issue, we propose a rain removal method by using low-pass filter and DCT (Discrete Cosine Transform). The DCT helps separate the image into rain components. The image is removed rain components by Butterworth filtering. Experimental results show that our method achieved 90% of recognition rate. In addition, the proposed method had accelerated processing time to 17.8ms which is acceptable for real-time system.

A Decomposition Based MDO by Coordination of Disciplinary Subspace Optimization (분야별 하부시스템의 최적화를 통합한 분해기반 MDO 방법론)

  • Jeong, Hui-Seok;Lee, Jong-Su
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.26 no.9
    • /
    • pp.1822-1830
    • /
    • 2002
  • The paper describes the development of a decomposition based multidisciplinary design optimization (MDO) method that coordinates each of disciplinary subspace optimization (DSO). A multidisciplinary design system considered in the present study is decomposed into a number of subspaces based on their own design objective and constraints associated with engineering discipline. The coupled relations among subspaces are identified by interdisciplinary design variables. Each of subsystem level optimization, that is DSO would be performed in parallel, and the system level coordination is determined by the first order optimal sensitivities of subspace objective functions with respect to interdisciplinary design variables. The central of the present work resides on the formulation of system level coordination strategy and its capability in decomposition based MDO. A fluid-structure coupled design problem is explored as a test-bed to support the proposed MDO method.

Fuzzy Rule Reduction Algorithms and the Reconstruction of Fuzzy System using Decomposition of Nonlinear Functions (비선형 함수의 분해를 이용한 퍼지시스템의 재구성과 퍼지규칙수 줄임 알고리즘)

  • 유병국
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.2 no.2
    • /
    • pp.95-102
    • /
    • 2001
  • Fuzzy system is capable of uniformly approximating any nonlinear function over compact input space. The applications of fuzzy system, however, have been primarily limited by the need for large number of fuzzy rules, in particular, for the high-order nonlinear system. In this paper, we propose the reconstruction methods of fuzzy systems, parallel type and cascade, based on the decomposition of some classes of high-order nonlinear functions. Using the both types appropriately, we can reduce the number of fuzzy rules geometrically. It can be applied to the fuzzy system that has an online adaptive structure. Two examples of adaptive fuzzy sliding mode control are shown in the computer simulations to verify the validity of the proposed algorithm.

  • PDF