• Title/Summary/Keyword: 큐피드 코드

Search Result 2, Processing Time 0.015 seconds

ASSESSMENT OF THE CUPIDCODE APPLICABILITY TO SUBCHANNEL FLOW IN 2×2 ROD BUNDLE (CUPID 코드를 활용한 2×2 봉다발 부수로 유동 해석)

  • Lee, J.R.;Park, I.K.;Kim, J.
    • Journal of computational fluids engineering
    • /
    • v.21 no.4
    • /
    • pp.71-77
    • /
    • 2016
  • The CUPID code is a transient, three-dimensional, two-fluid, thermal-hydraulic code designed for a component-scale analysis of nuclear reactor components. The primary objective of this study is to assess the applicability of CUPID to single-phase turbulent flow analyses of $2{\times}2$ rod bundle subchannel. The bulk velocity at the inlet varies from 1.0 m/s up to 2.0 m/s which is equivalent to the fully turbulent flow with the range of Re=12,500 to 25,000. Adiabatic single-phase flow is assumed. The velocity profile at the exit region is quantitatively compared with both experimental measurement and commercial CFD tool. Three different boundary conditions are simulated and quantitatively compared each other. The calculation results of CUPID code shows a good agreement with the experimental data. It is concluded that the CUPID code has capability to reproduce the turbulent flow behavior for the $2{\times}2$ rod bundle geometry.

Performance Analysis of the Parallel CUPID Code for Various Parallel Programming Models in Symmetric Multi-Processing System (Symmetric Multi-Processing 시스템에서 다양한 병렬 기법 모델을 적용한 병렬 CUPID 코드의 성능분석)

  • Jeon, Byoung Jin;Lee, Jae Ryong;Yoon, Han Young;Choi, Hyoung Gwon
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.38 no.1
    • /
    • pp.71-79
    • /
    • 2014
  • A parallelization of the bi-conjugate gradient solver for the pressure equation of the CUPID (component unstructured program for interfacial dynamics) code, which was developed for analyzing the components of a pressurized water-cooled reactor, was studied in a symmetric multi-processing system. The parallel performance was investigated for three typical parallel programming models (MPI, OpenMP, Hybrid) by solving incompressible backward-facing step flow at various grid resolutions. It was confirmed that parallel performance was low when problem size was small or the memory requirement for each thread was considerably higher than the cache memory. Furthermore, it was shown that MPI was better than OpenMP regardless of the problem size, and Hybrid was the best when the number of threads was relatively small.