메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색

논문 기본 정보

자료유형
학술저널
저자정보
Jingang Liang (Tsinghua Univ.) Kan Wang (Tsinghua University) Yishu Qiu (Tsinghua University) Xiaoming Chai (Nuclear Power Institute of China) Shenglong Qiang (Nuclear Power Institute of China)
저널정보
한국원자력학회 Nuclear Engineering and Technology Nuclear Engineering and Technology 제48권 제3호
발행연도
2016.6
수록면
635 - 641 (7page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색

초록· 키워드

오류제보하기
Because of prohibitive data storage requirements in large-scale simulations, the memoryproblem is an obstacle for Monte Carlo (MC) codes in accomplishing pin-wise threedimensional(3D) full-core calculations, particularly for whole-core depletion analyses. Various kinds of data are evaluated and quantificational total memory requirements areanalyzed based on the Reactor Monte Carlo (RMC) code, showing that tally data, materialdata, and isotope densities in depletion are three major parts of memory storage. Thedomain decomposition method is investigated as a means of saving memory, by dividingspatial geometry into domains that are simulated separately by parallel processors. For thevalidity of particle tracking during transport simulations, particles need to be communicatedbetween domains. In consideration of efficiency, an asynchronous particle communicationalgorithm is designed and implemented. Furthermore, we couple the domain decompositionmethod with MC burnup process, under a strategy of utilizing consistent domain partition inboth transport and depletion modules. A numerical test of 3D full-core burnup calculationsis carried out, indicating that the RMC code, with the domain decomposition method, iscapable of pin-wise full-core burnup calculations with millions of depletion regions.

목차

등록된 정보가 없습니다.

참고문헌 (15)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0