Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “T CODES”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,189 records · Page 66

Benchmarking of massively parallel phase-field codes for directional solidification

We present a detailed benchmark comparing two state-of-the-art phase-field implementations for simulating alloy solidification under experimentally relevant conditions. The study investigates the directional solidification of Al-3wt%Cu under high-velocity solidification conditions and SCN-0.46wt% camphor under microgravity conditions from National Aeronautics and Space Administration (NASA) DECLIC-DSI-R experiments. Both codes, one employing finite-difference discretization with uniform mesh and GPU-acceleration (GPU-PF) and the other one employing finite-element discretization with adaptive-mesh and CPU-parallelization (PRISMS-PF), solve the same quantitative phase-field formulation that incorporates an anti-trapping current for the solidification of dilute alloys. We evaluate the predictions of each code for dendritic morphology, primary spacing, and tip dynamics in both 2D and 3D, as well as their numerical convergence and computational performance. While existing benchmark problems have primarily focused on simplified or small-scale simulations, they do not reflect the computational and modeling challenges posed by employing experimentally relevant time and length scales. Our results provide a practical framework for assessing phase-field code performance as well as validating and facilitating their application in integrated computational materials engineering (ICME) workflows that require integration with realistic experimental data.

36 MATERIALS SCIENCE↗

Dynamic load balancing with enhanced shared-memory parallelism for particle-in-cell codes

Furthering our understanding of many of today’s interesting problems in plasma physics – including plasma based acceleration and magnetic reconnection with pair production due to quantum electrodynamic effects – requires large-scale kinetic simulations using particle-in-cell (PIC) codes. However, these simulations are extremely demanding, requiring that contemporary PIC codes be designed to efficiently use a new fleet of exascale computing architectures. To this end, the key issue of parallel load balance across computational nodes must be addressed. We discuss the implementation of dynamic load balancing by dividing the simulation space into many small, self-contained regions or ‘‘tiles,’’ along with shared-memory (e.g., OpenMP) parallelism both over many tiles and within single tiles. The load balancing algorithm can be used with three different topologies, including two space-filling curves. Here, we tested this implementation in the code Osiris and show low overhead and improved scalability with OpenMP thread number on simulations with both uniform load and severe load imbalance. Compared to other load-balancing techniques, our algorithm gives order-of-magnitude improvement in parallel scalability for simulations with severe load imbalance issues.

97 MATHEMATICS AND COMPUTING↗

Development and performance of a HemeLB GPU code for human-scale blood flow simulation

In recent years, it has become increasingly common for high performance computers (HPC) to possess some level of heterogeneous architecture - typically in the form of GPU accelerators. In some machines these are isolated within a dedicated partition, whilst in others they are integral to all compute nodes - often with multiple GPUs per node - and provide the majority of a machine's compute performance. In light of this trend, it is becoming essential that codes deployed on HPC are updated to execute on accelerator hardware. Here, in this paper, we introduce a GPU implementation of the 3D blood flow simulation code HemeLB that has been developed using CUDA C++. We demonstrate how taking advantage of NVIDIA GPU hardware can achieve significant performance improvements compared to the equivalent CPU only code on which it has been built whilst retaining the excellent strong scaling characteristics that have been repeatedly demonstrated by the CPU version. With HPC positioned on the brink of the exascale era, we use HemeLB as a motivation to provide a discussion on some of the challenges that many users will face when deploying their own applications on upcoming exascale machines.

59 BASIC BIOLOGICAL SCIENCES↗

hPIC2: A hardware-accelerated, hybrid particle-in-cell code for dynamic plasma-material interactions

The exascale era of high performance computing promises to bring the field of computational plasma physics ever closer to the goal of accurate multiscale modeling. Such computers will rely on hardware acceleration to offload work to dedicated components, notably general-purpose graphics processing units (GPUs). However, devices from different manufacturers require software to be written with different parallel programming models, greatly increasing the code maintenance burden of applications designed to perform on more than one such device. hPIC2 is a hybrid plasma simulation code developed with the Kokkos performance portability framework to target the architectures that will drive exascale computing for the foreseeable future. As a hybrid simulation code, hPIC2 investigates the simultaneous use of various plasma models on the same domain, at the same time. hPIC2 also optionally couples to RustBCA, which accurately models ion-material interactions using the binary collision approximation (BCA) method. In conclusion, hPIC2 therefore achieves scalable performance on a variety of computing architectures when simulating complex and diverse plasmas, particularly near plasma-material interfaces.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

EUTERPE: A global gyrokinetic code for stellarator geometry

The current state of the EUTERPE code is described with emphasis on the implemented models and their numerical implementation. The code solves the multi-species electromagnetic gyrokinetic equations in the full volume of a three-dimensional domain. Noise reduction of the particle-in-cell method is achieved by using a δf-method and Fourier filters. The field equations are discretized with B-splines and the resulting system of equations is solved iteratively. For linear simulations a phase-factor transformation is applied in order to strongly reduce the necessary grid resolution. Apart from the full gyrokinetic model, other numerically less expensive hybrid models are also implemented. They are mainly tailored for comparison with fluid theory and for studying the interaction of the bulk plasma with fast particles. The code is parallelized for CPUs by particle and domain decomposition. Good scalability up to several thousand nodes is demonstrated.

97 MATHEMATICS AND COMPUTING↗

SIMULATeQCD: A simple multi-GPU lattice code for QCD calculations

The rise of exascale supercomputers has fueled competition among GPU vendors, driving lattice QCD developers to write code that supports multiple APIs. Moreover, new developments in algorithms and physics research require frequent updates to existing software. These challenges have to be balanced against constantly changing personnel. At the same time, there is a wide range of applications for HISQ fermions in QCD studies. This situation encourages the development of software featuring a HISQ action that is flexible, high-performing, open source, easy to use, and easy to adapt. In this technical paper, we explain the design strategy, provide implementation details, list available algorithms and modules, and show key performance indicators for SIMULATeQCD, a simple multi-GPU lattice code for large-scale QCD calculations, mainly developed and used by the HotQCD collaboration. The code is publicly available on GitHub.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

TRANSP integrated modeling code for interpretive and predictive analysis of tokamak plasmas

This paper provides a comprehensive review of the TRANSP code, a sophisticated tool for interpretive and predictive analysis of tokamak plasmas, detailing its major capabilities and features. It describes the equations for particle, power, and momentum balance analysis, as well as the poloidal field diffusion equations. The paper outlines the spatial and time grids used in TRANSP and details the equilibrium assumptions and solvers. Various models for heating and current drive and radiation, including updates to the NUBEAM model, are discussed. The handling of large-scale events such as sawtooth crashes and pellet injections is examined, along with the predictive capabilities for advancing plasma profiles. The integration of TRANSP with the ITER Integrated Modeling and Analysis Suite (IMAS) is highlighted, demonstrating enhanced data access and analysis capabilities. Additionally, the paper discusses best practices and continuous integration techniques to enhance TRANSP's robustness. The suite of TRANSP tools, designed for efficient data analysis and simulation, further supports the optimization of tokamak operations and coupling with other tokamak codes. Continuous development and support ensure that TRANSP remains a major code for the analysis of experimental data for controlled thermonuclear fusion, maintaining its critical role in supporting the optimization of tokamak operations and advancing fusion research.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Experimental validation of simplified radionuclide transport bubble scrubbing code in sodium coolant pool

Solid radionuclides released following fuel pin failure may become entrained in gaseous fission products and be rapidly transported through the coolant pool to the cover gas region. Sensitivity studies on radionuclide transport have identified this potential pathway as one of both high concern and high uncertainty. The simplified radionuclide transport scrubbing code utilizes classical aerosol scrubbing mechanisms to model this phenomenon and predict aerosol masses reaching the cover gas region. This paper serves to validate this code in a sodium environment while conducting a parametric study to analyze the effects of aerosol size, bubble size, pool temperature, pool depth, aerosol density, and aerosol concentration. Through a series of experimental tests, it was determined that aerosol sizes ranging from 0.001 to 1.0 µm are of primary concern as aerosols in this range have a ratio of aerosol mass entering the sodium pool from the fuel pin to aerosol mass exiting the sodium pool to the cover gas region of less than 10. Further, the experimental results were found to match the trends found in the scrubbing model closely, but significantly more scrubbing was seen experimentally. Decreasing bubble size and increasing pool depth and aerosol density were all found to increase scrubbing both experimentally and theoretically. Pool temperature was found to have a negligible effect on scrubbing amounts; however, this was largely due to a subsequent increase in bubble size corresponding to increasing temperatures which offset the increase in scrubbing due to increased temperature. Varying aerosol concentration was found to have no effect on scrubbing ratios. A final series of tests was conducted for a more prototypic fuel pin failure with a heterogenous bubble swarm. From these tests, it was found that the experimental scrubbing quantities were larger than for the single bubble case. Overall, it was found that the simplified bubble transport scrubbing code accurately models the trends of the bubble scrubbing but provides a conservative estimate of scrubbing quantities. Model limitations fail to model the complex phenomena present for fission product scrubbing via bubble transport, but match trends seen experimentally.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Modelling the nonlinear plasma response to externally applied three-dimensional fields with the Stepped Pressure Equilibrium Code

Small-amplitude, symmetry-breaking magnetic field perturbations, including resonant magnetic perturbations (RMPs) and error fields, can profoundly impact plasma properties in both tokamaks and stellarators. In this work, we perform the first comparison between the Stepped Pressure Equilibrium Code (SPEC) (a comparatively fast and efficient equilibrium code based on energy-minimisation principles) and M3D-C 1 (a high-fidelity albeit computationally expensive initial-value extended-magnetohydro-dynamic (MHD) code) to assess the conditions under which SPEC can be used to model the nonlinear, non-ideal plasma response to an externally applied (m = 2,n = 1) RMP field in an experimentally relevant geometry. We find that SPEC is able to capture the plasma response in the weakly nonlinear regime – meaning perturbation amplitudes below the threshold for break up of the separatrix and onset of secondary magnetic island formation – when around half of the total toroidal flux is enclosed in the volume containing the q = 2 resonant surface. Further, the observed dependence of SPEC solutions on input parameters, including toroidal flux and the number of volumes into which the plasma is partitioned, indicates that additional exploration of the underlying Multi-Region Relaxed MHD physics model is needed to constrain the choice of parameters. Nonetheless, this work suggests promising applications of SPEC to optimisation and fusion plasma design.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The DESC stellarator code suite Part 3: Quasi-symmetry optimization

The DESC stellarator optimization code takes advantage of advanced numerical methods to search the full parameter space much faster than conventional tools. Only a single equilibrium solution is needed at each optimization step thanks to automatic differentiation, which efficiently provides exact derivative information. A Gauss–Newton trust-region optimization method uses second-order derivative information to take large steps in parameter space and converges rapidly. With just-in-time compilation and GPU portability, high-dimensional stellarator optimization runs take orders of magnitude less computation time with DESC compared to other approaches. This paper presents the theory of the DESC fixed-boundary local optimization algorithm along with demonstrations of how to easily implement it in the code. Example quasi-symmetry optimizations are shown and compared to results from conventional tools. Three different forms of quasi-symmetry objectives are available in DESC, and their relative advantages are discussed in detail. In the examples presented, the triple product formulation yields the best optimization results in terms of minimized computation time and particle transport. This paper concludes with an explanation of how the modular code suite can be extended to accommodate other types of optimization problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The DESC stellarator code suite. Part 1. Quick and accurate equilibria computations

Three-dimensional equilibrium codes are vital for stellarator design and operation, and high-accuracy equilibria are also necessary for stability studies. This paper details comparisons of two three-dimensional equilibrium codes: VMEC, which uses a steepest-descent algorithm to reach a minimum-energy plasma state, and DESC, which minimizes the magnetohydrodynamic (MHD) force error in real space directly. Accuracy as measured by satisfaction of MHD force balance is presented for each code, along with the computation time. It is shown that DESC is able to achieve more accurate solutions, especially near axis. The importance of higher-accuracy equilibria is shown in DESC's better agreement of stability metrics with asymptotic formulae. DESC's global Fourier–Zernike basis also yields solutions with analytic derivatives explicitly everywhere in the plasma volume, provides improved accuracy in the radial direction versus conventional finite differences and allows for exponential convergence. Further, DESC can compute a solution with the same accuracy as VMEC in order-of-magnitude less time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

GX: a GPU-native gyrokinetic turbulence code for tokamak and stellarator design

GX is a code designed to solve the nonlinear gyrokinetic system for low-frequency turbulence in magnetized plasmas, particularly tokamaks and stellarators. In GX, our primary motivation and target is a fast gyrokinetic solver that can be used for fusion reactor design and optimization along with wide-ranging physics exploration. Here, this has led to several code and algorithm design decisions, specifically chosen to prioritize time to solution. First, we have used a discretization algorithm that is pseudospectral in the entire phase space, including a Laguerre–Hermite pseudospectral formulation of velocity space, which allows for smooth interpolation between coarse gyrofluid-like resolutions and finer conventional gyrokinetic resolutions and efficient evaluation of a model collision operator. Additionally, we have built GX to natively target graphics processors (GPUs), which are among the fastest computational platforms available today. Finally, we have taken advantage of the reactor-relevant limit of small $\rho _*$ by using the radially local flux-tube approach. In this paper we present details about the gyrokinetic system and the numerical algorithms used in GX to solve the system. We then present several numerical benchmarks against established gyrokinetic codes in both tokamak and stellarator magnetic geometries to verify that GX correctly simulates gyrokinetic turbulence in the small $\rho _*$. Moreover, we show that the convergence properties of the Laguerre–Hermite spectral velocity formulation are quite favourable for nonlinear problems of interest. Coupled with GPU acceleration, which we also investigate with scaling studies, this enables GX to be able to produce useful turbulence simulations in minutes on one (or a few) GPUs and higher fidelity results in a few hours using several GPUs. GX is open-source software that is ready for fusion reactor design studies.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Designing efficient genetic code expansion in Bacillus subtilis to gain biological insights

Abstract Bacillus subtilis is a model gram-positive bacterium, commonly used to explore questions across bacterial cell biology and for industrial uses. To enable greater understanding and control of proteins in B. subtilis , here we report broad and efficient genetic code expansion in B. subtilis by incorporating 20 distinct non-standard amino acids within proteins using 3 different families of genetic code expansion systems and two choices of codons. We use these systems to achieve click-labelling, photo-crosslinking, and translational titration. These tools allow us to demonstrate differences between E. coli and B. subtilis stop codon suppression, validate a predicted protein-protein binding interface, and begin to interrogate properties underlying bacterial cytokinesis by precisely modulating cell division dynamics in vivo. We expect that the establishment of this simple and easily accessible chemical biology system in B. subtilis will help uncover an abundance of biological insights and aid genetic code expansion in other organisms.

59 BASIC BIOLOGICAL SCIENCES↗

Natural switches in behaviour rapidly modulate hippocampal coding

Throughout their daily lives, animals and humans often switch between different behaviours. However, neuroscience research typically studies the brain while the animal is performing one behavioural task at a time, and little is known about how brain circuits represent switches between different behaviours. Here we tested this question using an ethological setting: two bats flew together in a long 135 m tunnel, and switched between navigation when flying alone (solo) and collision avoidance as they flew past each other (cross-over). Bats increased their echolocation click rate before each cross-over, indicating attention to the other bat. Hippocampal CA1 neurons represented the bat’s own position when flying alone (place coding). Notably, during cross-overs, neurons switched rapidly to jointly represent the interbat distance by self-position. This neuronal switch was very fast—as fast as 100 ms—which could be revealed owing to the very rapid natural behavioural switch. The neuronal switch correlated with the attention signal, as indexed by echolocation. Interestingly, the different place fields of the same neuron often exhibited very different tuning to interbat distance, creating a complex non-separable coding of position by distance. Theoretical analysis showed that this complex representation yields more efficient coding. Overall, our results suggest that during dynamic natural behaviour, hippocampal neurons can rapidly switch their core computation to represent the relevant behavioural variables, supporting behavioural flexibility.

60 APPLIED LIFE SCIENCES↗

Evaluating Performance Portability with the CMS Heterogeneous Pixel Reconstruction code

In the past years the landscape of tools for expressing parallel algorithms in a portable way across various compute accelerators has continued to evolve significantly. There are many technologies on the market that provide portability between CPU, GPUs from several vendors, and in some cases even FPGAs. These technologies include C++ libraries such as Alpaka and Kokkos, compiler directives such as OpenMP, the SYCL open specification that can be implemented as a library or in a compiler, and standard C++ where the compiler is solely responsible for the offloading. Given this developing landscape, users have to choose the technology that best fits their applications and constraints. For example, in the CMS experiment the experience so far in heterogeneous reconstruction algorithms suggests that the full application contains a large number of relatively short computational kernels and memory transfer operations. In this work we use a stand-alone version of the CMS heterogeneous pixel reconstruction code as a realistic use case of HEP reconstruction software that is capable of leveraging GPUs effectively. We summarize the experience of porting this code base from CUDA to Alpaka, Kokkos, SYCL, std::par, and OpenMP offloading. We compare the event processing throughput achieved by each version on NVIDIA and AMD GPUs as well as on a CPU, and compare those to what a native version of the code achieves on each platform.

Andriotis, Nikolaos↗

Quantitative metrics for evaluating thermonuclear design codes and physics models applied to the National Ignition Campaign

In this study, physics models and design codes for hot dense plasmas undergoing thermonuclear burn are evaluated objectively using statistical metrics that compare the difference between calculations and data relative to the experimental uncertainties. The analysis is applied to the National Ignition Campaign (NIC) because it is relevant, comprehensive, and well documented. The statistics confirm that a key process afflicting NIC performance is mix driven by hydrodynamic instabilities as approximated here using the KL model [G. Dimonte and R. Tipton, Phys. Fluids 18, 085101 (2006)]. New physics models are also presented for instability-driven magnetic fields [B. Srinivasan et al., Phys. Rev. Lett. 108, 165002 (2012)] and the Coulomb logarithm for electron–ion thermal relaxation [G. Dimonte and J. Daligault, Phys. Rev. Lett. 101, 135001 (2008)]. The plasma-generated magnetic fields improve the agreement between code and data in a statistically significant manner by reducing the electron thermal conduction in the hot-spot via the Hall term. The Coulomb logarithm is presented in a numerically practical form that incorporates recent theoretical advances. However, it does not improve the agreement between the code and data because the thermal relaxation is so fast in non-ignited NIC plasmas that the typical 20% error does not change the tight coupling between electrons and ions. Even with these improved physics models, the one-dimensional simulations presented here are not able to describe the high-convergence NIC implosions in a statistically acceptable manner. Of the heroic multi-dimensional simulations of Clark et al. [Phys. Plasmas 23, 056302 (2016)], only those in three-dimensions satisfy the statistical acceptance criterion.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Modeling of a chain of three plasma accelerator stages with the WarpX electromagnetic PIC code on GPUs

The fully electromagnetic particle-in-cell code WarpX is being developed by a team of the U.S. DOE Exascale Computing Project (with additional non-U.S. collaborators on part of the code) to enable the modeling of chains of tens to hundreds of plasma accelerator stages on exascale supercomputers, for future collider designs. The code is combining the latest algorithmic advances (e.g., Lorentz boosted frame and pseudo-spectral Maxwell solvers) with mesh refinement and runs on the latest computer processing unit and graphical processing unit (GPU) architectures. In this paper, we summarize the strategy that was adopted to port WarpX to GPUs, report on the weak parallel scaling of the pseudo-spectral electromagnetic solver, and then present solutions for decreasing the time spent in data exchanges from guard regions between subdomains. In Sec. IV, we demonstrate the simulations of a chain of three consecutive multi-GeV laser-driven plasma accelerator stages.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Toward exascale whole-device modeling of fusion devices: Porting the GENE gyrokinetic microturbulence code to GPU

GENE solves the five-dimensional gyrokinetic equations to simulate the development and evolution of plasma microturbulence in magnetic fusion devices. The plasma model used is close to first principles and computationally very expensive to solve in the relevant physical regimes. In order to use the emerging computational capabilities to gain new physics insights, several new numerical and computational developments are required. Here, we focus on the fact that it is crucial to efficiently utilize GPUs (graphics processing units) that provide the vast majority of the computational power on such systems. In this paper, we describe the various porting approaches considered and given the constraints of the GENE code and its development model, justify the decisions made, and describe the path taken in porting GENE to GPUs. We introduce a novel library called gtensor that was developed along the way to support the process. Performance results are presented for the ported code, which in a single node of the Summit supercomputer achieves a speed-up of almost 15× compared to running on central processing unit (CPU) only. Typical GPU kernels are memory-bound, achieving about 90% of peak. Our analysis shows that there is still room for improvement if we can refactor/fuse kernels to achieve higher arithmetic intensity. We also performed a weak parallel scalability study, which shows that the code runs well on a massively parallel system, but communication costs start becoming a significant bottleneck.

Germaschewski, K. (ORCID:0000000284956354)↗