KNKengo Nakajima

Kengo Nakajima

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kengo Nakajima has a total of 67 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Integrating Quantum and HPC: A Prototype Hybrid Implementation and Benchmark of Quantum-Selected Configuration Interaction

    by Ikko Hamamura, Toshiyuki Imamura, Takashi Arakawa, Shinji Sumimoto, Kazuya Yamazaki, Yao Hu, Shinnosuke Furuya, Kengo Nakajima


  • Open Access

    Observability Architecture for Quantum-Centric Supercomputing Workflows

    by Naoki Kanazawa, Yuto Morohoshi, Hitomi Takahashi, Yukio Kawashima, Hiroshi Horii, Kengo Nakajima

    Quantum-centric supercomputing (QCSC) workflows often involve hybrid classical-quantum algorithms that are inherently probabilistic and executed on remote quantum hardware, making them difficult to interpret and limiting the ability to monitor runtime performance and behavior. The high cost of quantum circuit execution and large-scale high-performance computing (HPC) infrastructure further restricts the number of feasible trials, making comprehensive evaluation of execution results essential for iterative development. We propose an observability architecture tailored for QCSC workflows that decouples telemetry collection from workload execution, enabling persistent monitoring across system and algorithmic layers and retaining detailed execution data for reproducible and retrospective analysis, eliminating redundant runs. Applied to a representative workflow involving sample-based quantum diagonalization, our system reveals solver behavior across multiple iterations. This approach enhances transparency and reproducibility in QCSC environments, supporting infrastructure-aware algorithm design and systematic experimentation.

  • Open Access

    A Flow-rate-conserving CNN-based Domain Decomposition Method for Blood Flow Simulations

    by Simon Klaes, Axel Klawonn, Natalie Kubicki, Martin Lanser, Kengo Nakajima, Takashi Shimokawabe, Janine Weber

    This work aims to predict blood flow with non-Newtonian viscosity in stenosed arteries using convolutional neural network (CNN) surrogate models. An alternating Schwarz domain decomposition method is proposed which uses CNN-based subdomain solvers. A universal subdomain solver (USDS) is trained on a single, fixed geometry and then applied for each subdomain solve in the Schwarz method. Results for two-dimensional stenotic arteries of varying shape and length for different inflow conditions are presented and statistically evaluated. One key finding, when using a limited amount of training data, is the need to implement a USDS which preserves some of the physics, as, in our case, flow rate conservation. A physics-aware approach outperforms purely data-driven USDS, delivering improved subdomain solutions and preventing overshooting or undershooting of the global solution during the Schwarz iterations, thereby leading to more reliable convergence.


  • Open Access

    Optimization of communication-computation overlapping in parallel multigrid methods by process/thread allocation

    by Kengo Nakajima

    In large-scale parallel systems, communication overhead in parallel preconditioned Krylov iterative solvers increases with the number of nodes, making its reduction essential. In parallel FEM/FVM, overlapping of halo communication and computation (CC-Overlapping) are commonly utilized, often alongside OpenMP’s dynamic loop scheduling. Previous work applied CC-Overlapping to the IC(0) smoother in the parallel Conjugate Gradient method preconditioned by Multigrid (MGCG), achieving a 40% + performance improvement on Wisteria/BDEC-01 (Odyssey)(ODY) with A64FX using up to 4096 nodes. In the present work, effects of process/thread allocation within an MPI process in OpenMP/MPI Hybrid parallel programming model has been conducted for optimization of CC-Overlapping. It has been observed that even when the number of threads and cores per MPI process is low, as in the cases of HB 3 × 16 and HB 6 × 8, the effects of CC-Overlapping can still be achieved similarly to the traditional HB 12 × 4 configuration in the previous works on ODY. HB 3 × 16 and HB 6 × 8, are much better for smaller problem size per CPU/node and number of CPU’s/nodes is less than 1,024 on ODY. Furthermore, effects of unused cores in multi-threading have been also investigated. For small problem sizes per CPU/node, reducing the number of threads in the MPI process can improve performance by approximately 10–20%.


  • Open Access

    Accelerating Heterogeneous Coupling Computing with WaitIO Using RDMA

    by Shinji Sumimoto, Takashi Arakawa, Yoshio Sakaguchi, Hiroya Matsuba, Satoshi Ohshima, Hisashi Yashiro, Toshihiro Hanawa, Kengo Nakajima


  • Open Access

    Large Scale Ensemble Coupling of Non-hydrostatic Atmospheric Model NICAM

    by Takashi Arakawa, Hisashi Yashiro, Shinji Sumimoto, Kengo Nakajima


  • Open Access

    Speeding up MPM calculations in MPM-FEM hybrid method incorporating inconsistent domain decomposition patterns for solid and fluid phases

    by Shaoyuan Pan, Soma Hidano, Reika Nomura, Lu Jing, Yohei Miki, Masatoshi Kawai, Shuji Moriguchi, Kengo Nakajima, Kenjiro Terada

    A new method is developed to improve the computational efficiency of MPM calculations in MPM-FEM hybrid analyses with the help of a dynamic load balancing (DLB) technique. This method achieves proper communication between control points associated with the B-spline basis functions assigned to the cores corresponding to not only the adaptively located subdomains for the MPM, which change with the deformation of the solid phase, but also the separately located subdomains for the MPM and stabilized FEM. Since higher-order B-spline functions are used in the MPM-FEM to reduce the cell-crossing error that often arises in the MPM with linear basis functions, material points and control points that need to communicate variable values are not always located at domain boundaries, further increasing the complexity of interdomain communication. A novel contribution of this study is the high computational efficiency of the MPM calculations, which allow for proper communication under this complexity. The first example is an MPM run for the solid phase only aimed at investigating the scalability and parallel efficiency of the developed DLB. The second and third examples show that the DLB technique for MPM calculations achieves excellent computational efficiency even when the MPM-FEM hybrid method results in inconsistent domain decomposition patterns for the fluid and solid phases.


  • Open Access

    B-spline-based material point method with dynamic load balancing technique for large-scale simulation

    by Soma Hidano, Shaoyuan Pan, Keina Yoshida, Reika Nomura, Yohei Miki, Masatoshi Kawai, Shuji Moriguchi, Kengo Nakajima, Kenjiro Terada

    In this study, a dynamic load-balancing (DLB) technique based on the sampling method is developed for MPMs using higher-order B-spline basis functions for parallel MPI calculations based on domain decomposition, in order to perform large-scale, long-duration landslide simulations in realistic computation time. Higher-order B-spline basis functions use a range of influence across cells compared to general basis functions, but this DLB technique dynamically adjusts the size of the computational domain according to the material point distribution, so that the material points are almost equally distributed across all cores. This allows the load bias between cores to be mitigated and the advantages of parallel computation to be fully exploited. Specifically, the novel contribution of this study is that the domain decomposition allows for proper communication between control points, even if the physical regions of the cores are staggered or non-adjacent, and even if the area of influence of B-spline basis functions spans multiple subdomains at this time. In numerical examples, the quasi-3D benchmark solid column collapse problem is computed for multiple core configurations to verify the effectiveness of the DLB method in terms of scalability and parallelization efficiency. The simulation of the full 3D column collapse problem also illustrates the applicability of the proposed DLB method to large-scale disaster simulations. Finally, to demonstrate the promise and capability of the DLB technique in the MPM algorithm, a full-scale size landslide disaster simulation is carried out to illustrate that it can withstand some practical size calculations.


  • Open Access

    Xabclib:A Fully Auto-tuned Sparse Iterative Solver

    by Takahiro Katagiri, Takao Sakurai, Mitsuyoshi Igai, Shoji Itoh, Satoshi Ohshima, Hisayasu Kuroda, Ken Naono, Kengo Nakajima

    In this paper, we propose a general application programming interface named OpenATLib for auto-tuning (AT). OpenATLib is designed to establish the reusability of AT functions. By using OpenATLib, we develop a fully auto-tuned sparse iterative solver named Xabclib. Xabclib has several novel run-time AT functions. First, the following new implementations of sparse matrix-vector multiplication (SpMV) for thread processing are implemented:(1) non-zero elements; (2) omission of zero-elements computation for vector reduction; (3) branchless segmented scan (BSS). According to the performance evaluation and the comparison with conventional implementations, the following results are obtained: (1) 14x speedup for non-zero elements and zero-elements computation omission for symmetric SpMV; (2) 4.62x speedup by using BSS. We also develop a "numerical computation policy" that can optimize memory space and computational accuracy. Using the policy, we obtain the following: (1) an averaged 1/45 memory space reduction; (2) avoidance of the "fault convergence" situation, which is a problem of conventional solvers.