• Title/Summary/Keyword: System code benchmark

Search Result 59, Processing Time 0.038 seconds

Verification of SARAX code system in the reactor core transient calculation based on the simplified EBR-II benchmark

  • Jia, Xiaoqian;Zheng, Youqi;Du, Xianna;Wang, Yongping;Chen, Jianda
    • Nuclear Engineering and Technology
    • /
    • v.54 no.5
    • /
    • pp.1813-1824
    • /
    • 2022
  • This paper shows the verification work of SARAX code system in the reactor core transient calculation based on the simplified EBR-II Benchmark. The SARAX code system is an analysis package developed by Xi'an Jiaotong University and aims at the advanced reactor R&D. In this work, a neutron-photon coupled power calculation model and a spatial-dependent reactivity feedback model were introduced. To verify the models used in SARAX, the EBR-II SHRT-45R test was simplified to an ULOF transient with an input flowrate change curve by fitting from reference. With the neutron-photon coupled power calculation model, SARAX gave close results in both power fraction and peak power prediction to the reference results. The location of the hottest assembly from SARAX and reference are the same and the relative power deviation of the hottest assembly is 2.6%. As for transient analysis, compared with experimental results and other calculated results, SARAX presents coincident results both in trend and absolute value. The minimum value of core net reactivity during the transient agreed well with the reported results, which ranged from -0.3$ to -0.35$. The results verify the models in SARAX, which are correct and able to simulate the in-core transient with reliable accuracy.

The applicability study and validation of TULIP code for full energy range spectrum

  • Wenjie Chen;Xianan Du;Rong Wang;Youqi Zheng;Yongping Wang;Hongchun Wu
    • Nuclear Engineering and Technology
    • /
    • v.55 no.12
    • /
    • pp.4518-4526
    • /
    • 2023
  • NECP-SARAX is a neutronics analysis code system for advanced reactor developed by Nuclear Engineering Computational Physics Laboratory of Xi'an Jiaotong University. In past few years, improvements have been implemented in TULIP code which is the cross-section generation module of NECP-SARAX, including the treatment of resonance interface, considering the self-shielding effect in non-resonance energy range, hyperfine group method and nuclear library with thermal scattering law. Previous studies show that NECP-SARAX has high performance in both fast and thermal spectrum system analysis. The accuracy of TULIP code in fast and thermal spectrum system analysis is demonstrated preliminarily. However, a systematic verification and validation is still necessary. In order to validate the applicability of TULIP code for full energy range, 147 fast spectrum critical experiment benchmarks and 170 thermal spectrum critical experiment benchmarks were selected from ICSBEP and used for analysis. The keff bias between TULIP code and reference value is less than 300 pcm for all fast spectrum benchmarks. And that bias keeps within 200 pcm for thermal spectrum benchmarks with neutron-moderating materials such as polyethylene, beryllium oxide, etc. The numerical results indicate that TULIP code has good performance for the analysis of fast and thermal spectrum system.

McCARD/MIG stochastic sampling calculations for nuclear cross section sensitivity and uncertainty analysis

  • Ho Jin Park
    • Nuclear Engineering and Technology
    • /
    • v.54 no.11
    • /
    • pp.4272-4279
    • /
    • 2022
  • In this study, a cross section stochastic sampling (S.S.) capability is implemented into both the McCARD continuous energy Monte Carlo code and MIG multiple-correlated data sampling code. The ENDF/B-VII.1 covariance data based 30 group cross section sets and the SCALE6 covariance data based 44 group cross section sets are sampled by the MIG code. Through various uncertainty quantification (UQ) benchmark calculations, the McCARD/MIG results are verified to be consistent with the McCARD stand-alone sensitivity/uncertainty (S/U) results and the XSUSA S.S. results. UQ analyses for Three Mile Island Unit 1, Peach Bottom Unit 2, and Kozloduy-6 fuel pin problems are conducted to provide the uncertainties of keff and microscopic and macroscopic cross sections by the McCARD/MIG code system. Moreover, the SNU S/U formulations for uncertainty propagation in a MC depletion analysis are validated through a comparison with the McCARD/MIG S.S. results for the UAM Exercise I-1b burnup benchmark. It is therefore concluded that the SNU formulation based on the S/U method has the capability to accurately estimate the uncertainty propagation in a MC depletion analysis.

Benchmark Test and Adjustment of an Updated Library from ENDF/B-IV (ENDF/B-IV로 생산된 열중성자로용 라이브러리의 벤치마크 계산 및 수정)

  • Jung-Do Kim;Jong Tai Lee
    • Nuclear Engineering and Technology
    • /
    • v.13 no.3
    • /
    • pp.130-138
    • /
    • 1981
  • A LEOPARD library was updated from the ENDF/B-IV evaluated data using ETOT-3-ETOG-3 code system. The applicability of the library was assessed through benchmark tests for many light water-moderated critical assemblies, and adjustment techniques were applied to group constants to fit critical experiments. It is confirmed that the library from ENDF/B-IV, coupled with the use of LEOPARD code, leads to reasonable results for light water-moderated UO$_2$ fueled cores with the above adjustments.

  • PDF

An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System (임베디드 시스템에서 DSP를 위한 메모리 접근 변수 저장의 최적화 ILP 알고리즘)

  • Chang, Jeong-Uk;Lin, Chi-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.59-66
    • /
    • 2013
  • In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. Therefor, we proved to reduce the execution time of programs.

NUCLEAR DATA UNCERTAINTY AND SENSITIVITY ANALYSIS WITH XSUSA FOR FUEL ASSEMBLY DEPLETION CALCULATIONS

  • Zwermann, W.;Aures, A.;Gallner, L.;Hannstein, V.;Krzykacz-Hausmann, B.;Velkov, K.;Martinez, J.S.
    • Nuclear Engineering and Technology
    • /
    • v.46 no.3
    • /
    • pp.343-352
    • /
    • 2014
  • Uncertainty and sensitivity analyses with respect to nuclear data are performed with depletion calculations for BWR and PWR fuel assemblies specified in the framework of the UAM-LWR Benchmark Phase II. For this, the GRS sampling based tool XSUSA is employed together with the TRITON depletion sequences from the SCALE 6.1 code system. Uncertainties for multiplication factors and nuclide inventories are determined, as well as the main contributors to these result uncertainties by calculating importance indicators. The corresponding neutron transport calculations are performed with the deterministic discrete-ordinates code NEWT. In addition, the Monte Carlo code KENO in multi-group mode is used to demonstrate a method with which the number of neutron histories per calculation run can be substantially reduced as compared to that in a calculation for the nominal case without uncertainties, while uncertainties and sensitivities are obtained with almost the same accuracy.

Application of Coupled Reactor Kinetics Method to a CANDU Reactor Kinetics Problem.

  • Kim, Hyun-Dae-;Yeom, Choong-Sub;Park, Kyung-Seok-
    • Proceedings of the Korea Society for Energy Engineering kosee Conference
    • /
    • 1994.11a
    • /
    • pp.141-145
    • /
    • 1994
  • A computer code for solving the 3-D time-dependent multigroup neutron diffusion equation by a coupled reactor kinetics method recently developed has been developed and for evaluating its applicability in CANDU transient analysis applied to a 3-D kinetics benchmark problem which reveals non-uniform loss of coolant accident followed by an asymmetric insertion of shutdown devices. The performance of the method and code has been compared with the CANDU design code, CERBERUS, employing a finite difference improved quasistatic method.

  • PDF

Development of a Computer Code for Low-and Intermediate-Level Radioactive Waste Disposal Safety Assessment

  • Park, J.W.;Kim, C.L.;Lee, E.Y.;Lee, Y.M.;Kang, C.H.;Zhou, W.;Kozak, M.W.
    • Journal of Radiation Protection and Research
    • /
    • v.29 no.1
    • /
    • pp.41-48
    • /
    • 2004
  • A safety assessment code, called SAGE (Safety Assessment Groundwater Evaluation), has been developed to describe post-closure radionuclide releases and potential radiological doses for low- and intermediate-level radioactive waste (LILW) disposal in an engineered vault facility in Korea. The conceptual model implemented in the code is focused on the release of radionuclide from a gradually degrading engineered barrier system to an underlying unsaturated zone, thence to a saturated groundwater zone. The radionuclide transport equations are solved by spatially discretizing the disposal system into a series of compartments. Mass transfer between compartments is by diffusion/dispersion and advection. In all compartments, radionuclides ate decayed either as a single-member chain or as multi-member chains. The biosphere is represented as a set of steady-state, radionuclide-specific pathway dose conversion factors that are multiplied by the appropriate release rate from the far field for each pathway. The code has the capability to treat input parameters either deterministically or probabilistically. Parameter input is achieved through a user-friendly Graphical User Interface. An application is presented, which is compared against safety assessment results from the other computer codes, to benchmark the reliability of system-level conceptual modeling of the code.

ASSESSMENT OF A NEW DESIGN FOR A REACTOR CAVITY COOLING SYSTEM IN A VERY HIGH TEMPERATURE GAS-COOLED REACTOR

  • PARK GOON-CHERL;CHO YUN-JE;CHO HYOUNGKYU
    • Nuclear Engineering and Technology
    • /
    • v.38 no.1
    • /
    • pp.45-60
    • /
    • 2006
  • Presently, the VHTGR (Very High Temperature Gas-cooled Reactor) is considered the most attractive candidate for a GEN-IV reactor to produce hydrogen, which will be a key resource for future energy production. A new concept for a reactor cavity cooling system (RCCS), a critical safety feature in the VHTGR, is proposed in the present study. The proposed RCCS consists of passive water pool and active air cooling systems. These are employed to overcome the poor cooling capability of the air-cooled RCCS and the complex cavity structures of the water-cooled RCCS. In order to estimate the licensibility of the proposed design, its performance and integrity were tested experimentally with a reduced-scale mock-up facility, as well as with a separate-effect test facility (SET) for the 1/4 water pool of the RCCS-SNU to examine the heat transfer and pressure drop and code capability. This paper presents the test results for SET and validation of MARS-GCR, a system code for the safety analysis of a HTGR. In addition, CFX5.7, a computational fluid dynamics code, was also used for the code-to-code benchmark of MARS-GCR. From the present experimental and numerical studies, the efficacy of MARS-GCR in application to determining the optimal design of complicated systems such as a RCCS and evaluation of their feasibility has been validated.

Pattern Matching Optimizer for Virtual Machine Codes (가상 기계 코드를 위한 패턴 매칭 최적화기)

  • Yi Chang-Hwan;Oh Se-Man
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.9
    • /
    • pp.1247-1256
    • /
    • 2006
  • VM(Virtual Machine) can be considered as a software processor which interprets the abstract machine code. Also, it is considered as a conceptional computer that consists of logical system configuration. But, the execution speed of VM system is much slower than that of a real processor system. So, it is very important to optimize the code for virtual machine to enhance the execution time. In this paper, we designed and implemented the optimizer for the virtual(or abstract) machine code(VMC) which is actually SIL(Standard Intermediate Language) that is an intermediate code of EVM(Embedded Virtual Machine). The optimizer uses the pattern matching optimization techniques reflecting the characteristics of the VMC as well as adopting the existing optimization methodology. Also, we tried a benchmark test for the VMC optimizer and obtained reasonable results.

  • PDF