Initialising ...
Initialising ...
Initialising ...
Initialising ...
Initialising ...
Initialising ...
Initialising ...
Yamada, Tomonori; Ogino, Masao*; Yoshimura, Shinobu*
Nihon Keisan Kogakkai Rombunshu (Internet), 2009(14), 7 Pages, 2009/08
Computation efficiency of the balancing domain decomposition method is investigated in this paper. An iterative substructuring method with coarse grid correction is one of the most effective methods for parallel computing of large scale structural finite element analyses. In this study, a prediction curve of parallel computation cost of the balancing domain decomposition method is proposed, and the optimal number of subdomains is estimated. Numerical validation of the optimal number of subdomains is conducted and the measured computation time with the optimal number of subdomains shows better computation performance than those with other numbers of subdomains.
Asahi, Yuichi; Maeyama, Shinya*; Latu, G.*; Garbet, X.*; Watanabe, Tomohiko*; Aoki, Takayuki*; Ogino, Masao*
no journal, ,
Under the JHPCN international collaboration with French researchers, we have integrated a kinetic electron model into the kinetic plasma turbulence code GYSELA developed in France. We also explore a performance portable for a kinetic fusion plasma turbulence code like GYSELA. For this purpose, we extract the key features of GYSELA such as the high dimensionality and the semi-Lagrangian scheme, and encapsulate them into a mini-application which solves the simpler version of Vlasov-Poisson system as GYSELA. We implement the mini-app with Open ACC and Kokkos to evaluate the advantages and disadvantages of each approach, from the view point of performance portability, readability and productivity.
