Conceptual study of J-PARC Proton Beam Irradiation Facility

Meigo, Shinichiro; Iwamoto, Hiroki; Sugihara, Kenta*; Hirano, Yukinori*; Tsutsumi, Kazuyoshi*; Saito, Shigeru; Maekawa, Fujio

JAEA-Technology 2024-026, 123 Pages, 2025/03

JAEA-Technology-2024-026.pdf:14.22MB

Based on the design of the ADS Target Test Facility (TEF-T) at the J-PARC Transmutation Experimental Facility, a conceptual study was conducted on the J-PARC proton beam irradiation facility. This research was carried out based on the recommendations of the Nuclear Transmutation Technology Evaluation Task Force of the MEXT. The recommendations state that it is desirable to consider facility specifications that can make the most of the benefits of using the existing J-PARC proton accelerator while also solving the engineering issues of the ADS. We considered facilities that could respond to a variety of needs while reducing the facilities that were not needed in the TEF-T design. In order to clarify these diverse needs, we investigated the usage status of representative accelerator facilities around the world. As a result, it became clear that the main purposes of these facilities were (1) Material irradiation, (2) Soft error testing of semiconductor devices using spallation neutrons, (3) Production of RI for medical use, and (4) Proton beam use, and we investigated the facilities necessary for these purposes. In considering the facility concept, we assumed a user community in 2022 and reflected user opinions in the facility design. This report summarizes the results of the conceptual study of the proton irradiation facility, various needs and responses to them, the roadmap for facility construction, and future issues.

Nuclear data as foundation of nuclear research and development

Fukahori, Tokio; Nakayama, Shinsuke; Katabuchi, Tatsuya*; Shigyo, Nobuhiro*

Nihon Genshiryoku Gakkai-Shi ATOMO, 65(12), p.726 - 727, 2023/12

https://doi.org/10.3327/jaesjb.65.12_726

The Investigative Committee on Nuclear Data investigates and observes global trends in nuclear research and development and conducts comprehensive examinations of Japanese nuclear data activities from a broader perspective, as well as cooperation with domestic and foreign academic institutions in a wide range of fields other than the Atomic Energy Society. We aim to establish a system for communication, information exchange, and interdisciplinary cooperation. In this report, we will report on three of the main activities for the 2021-2022 term: a request list site for nuclear data, human resource development, and roadmap production.

Numerical simulation of annular dispersed flow in simplified subchannel of light water cooled fast reactor RBWR

Yoshida, Hiroyuki; Horiguchi, Naoki; Ono, Ayako; Furuichi, Hajime*; Katono, Kenichi*

Proceedings of 29th International Conference on Nuclear Engineering (ICONE 29) (Internet), 7 Pages, 2022/08

Proposal and application of ROM-Lasso method for sensitivity coefficient evaluation

Katano, Ryota; Yamamoto, Akio*; Endo, Tomohiro*

Proceedings of International Conference on Physics of Reactors 2022 (PHYSOR 2022) (Internet), p.2032 - 2041, 2022/05

https://doi.org/10.13182/PHYSOR22-37557

We have proposed the ROM-Lasso method to perform an efficient evaluation of the sensitivity coefficients of ADS core parameters to cross sections without major modification of the core analysis system. In the ROM-Lasso method, the sensitivity coefficient vector is expanded via the subspace bases so-called Active Subspace (AS), and the effective number of unknowns is reduced. Then, the expansion coefficients are determined via the penalized linear regression with the core parameters obtained by the random sampling, and the sensitivity coefficient vector is estimated. Owing to the AS, the required number of the core calculations is dramatically reduced in the ROM-Lasso method. In this work, we take the sensitivity coefficient evaluation of the coolant void reactivity at the end of the cycle for example and demonstrate how estimation accuracy depends on the number of samples and the AS.

Tracer diffusion coefficients measurements on LaPO-dispersed LATP by means of neutron radiography

Song, F.*; Chen, H.*; Hayashida, Hirotoshi*; Kai, Tetsuya; Shinohara, Takenao; Yabutsuka, Takeshi*; Yao, Takeshi*; Takai, Shigeomi*

Solid State Ionics, 377, p.115873_1 - 115873_6, 2022/04

https://doi.org/10.1016/j.ssi.2022.115873

Acceleration of fusion plasma turbulence simulations using the mixed-precision communication-avoiding Krylov method

Idomura, Yasuhiro; Ina, Takuya*; Ali, Y.*; Imamura, Toshiyuki*

Proceedings of International Conference for High Performance Computing, Networking, Storage, and Analysis (SC 2020) (Internet), p.1318 - 1330, 2020/11

https://doi.org/10.1109/SC41405.2020.00097

The multi-scale full- simulation of the next generation experimental fusion reactor ITER based on a five dimensional (5D) gyrokinetic model is one of the most computationally demanding problems in fusion science. In this work, a Gyrokinetic Toroidal 5D Eulerian code (GT5D) is accelerated by a new mixed-precision communication-avoiding (CA) Krylov method. The bottleneck of global collective communication on accelerated computing platforms is resolved using a CA Krylov method. In addition, a new FP16 preconditioner, which is designed using the new support for FP16 SIMD operations on A64FX, reduces both the number of iterations (halo data communication) and the computational cost. The performance of the proposed method for ITER size simulations with 0.1 trillion grids on 1,440 CPUs/GPUs on Fugaku and Summit shows 2.8x and 1.9x speedups respectively from the conventional non-CA Krylov method, and excellent strong scaling is obtained up to 5,760 CPUs/GPUs.

Effects of the Montague resonance on the formation of the beam distribution during multiturn injection painting in a high-intensity proton ring

Hotchi, Hideaki

Physical Review Accelerators and Beams (Internet), 23(5), p.050401_1 - 050401_13, 2020/05

https://doi.org/10.1103/PhysRevAccelBeams.23.050401

no abstracts in English

GPU acceleration of communication avoiding Chebyshev basis conjugate gradient solver for multiphase CFD simulations

Ali, Y.*; Onodera, Naoyuki; Idomura, Yasuhiro; Ina, Takuya*; Imamura, Toshiyuki*

Proceedings of 10th Workshop on Latest Advances in Scalable Algorithms for Large-Scale Systems (ScalA 2019), p.1 - 8, 2019/11

https://doi.org/10.1109/ScalA49573.2019.00006

Iterative methods for solving large linear systems are common parts of computational fluid dynamics (CFD) codes. The Preconditioned Conjugate Gradient (P-CG) method is one of the most widely used iterative methods. However, in the P-CG method, global collective communication is a crucial bottleneck especially on accelerated computing platforms. To resolve this issue, communication avoiding (CA) variants of the P-CG method are becoming increasingly important. In this paper, the P-CG and Preconditioned Chebyshev Basis CA CG (P-CBCG) solvers in the multiphase CFD code JUPITER are ported to the latest V100 GPUs. All GPU kernels are highly optimized to achieve about 90% of the roofline performance, the block Jacobi preconditioner is re-designed to extract high computing power of GPUs, and the remaining bottleneck of halo data communication is avoided by overlapping communication and computation. The overall performance of the P-CG and P-CBCG solvers is determined by the competition between the CA properties of the global collective communication and the halo data communication, indicating an importance of the inter-node interconnect bandwidth per GPU. The developed GPU solvers are accelerated up to 2x compared with the former CPU solvers on KNLs, and excellent strong scaling is achieved up to 7,680 GPUs on the Summit.

Medical applications of the PHITS code, 3; User assistance program for medical physics computation

Furuta, Takuya; Hashimoto, Shintaro; Sato, Tatsuhiko

Igaku Butsuri, 36(1), p.50 - 54, 2016/00

https://doi.org/10.11323/jjmp.36.1_50

An application of Particle and Heavy Ion Transport Code System; PHITS, for medical physics is to simulate treatment planning of radiation therapy. Treatment planning simulation is conducted by constructing patient geometry from patient CT data, calculating radiation transport of external beam, and deducing dose distribution inside patient body. However, it is not easy to extract information such as patient location and CT value distribution from patient CT data or to construct complex accelerator geometry in PHITS format. Therefore, we developed two user assistance programs, DICOM2PHITS and PSFC4PHITS. DICOM2PHITS is a program to construct the voxel PHITS simulation geometry from patient CT DICOM image data. PSFC4PHITS is a program to convert the IAEA phase-space file data to PHITS format to be used as simulation source of PHITS. We explain these two programs by showing some applications in this article.

Condition number estimation of preconditioned matrices

Kushida, Noriyuki

PLOS ONE (Internet), 10(3), p.e0122331_1 - e0122331_16, 2015/03

https://doi.org/10.1371/journal.pone.0122331

The present paper introduces a condition number estimation method for preconditioned matrices. The newly developed method provides reasonable results, while the conventional method which is based on the Lanczos connection gives meaningless results. The Lanczos connection based method provides the condition numbers of coefficient matrices of systems of linear equations with information obtained through the preconditioned conjugate gradient method. Estimating the condition number of preconditioned matrices is sometimes important when describing the effectiveness of new preconditionerers or selecting adequate preconditioners. Operating a preconditioner on a coefficient matrix is the simplest method of estimation. However, this is not possible for large-scale computing, especially if computation is performed on distributed memory parallel computers. This is because, the preconditioned matrices become dense, even if the original matrices are sparse. Although the Lanczos connection method can be used to calculate the condition number of preconditioned matrices, it is not considered to be applicable to large-scale problems because of its weakness with respect to numerical errors. Therefore, we have developed a robust and parallelizable method based on Hager's method. The feasibility studies are curried out for the diagonal scaling preconditioner and the SSOR preconditioner with a diagonal matrix, a tri-daigonal matrix and Pei's matrix. As a result, the Lanczos connection method contains around 10% error in the results even with a simple problem. On the other hand, the new method contains negligible errors. In addition, the newly developed method returns reasonable solutions when the Lanczos connection method fails with Pei's matrix, and matrices generated with the finite element method.