Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel simulation”

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 91 records · Page 5

RX-PSA

This code is built on top of the ML-PSA utility and implements the ability to implement a multi-fidelity parallel simulated annealing optimization for a range of engineering problems. RX-PSA provides specializations to interact with modern nuclear reactor codes such as VERA to perform assembly and core optimization in a robust way. RX-PSA also provides LWR specific objective functions and constraints to provide a straightforward user interface that reactor designers are familiar with.

Collins, BenjaminS.↗

Matrix-based Parallel Redistribution

MatRed is a parallel redistribution tool for HPC applications. It provides a simple approach that only requires a few relation matrices between entities to build redistribution matrices in parallel simulation codes. In particular, MatRed is well-suited for simulation codes based on finite element/volume methods.

Kalchev, DelyanZ [Lawrence Livermore National Labo↗

Thermal neutron scattering cross sections for amorphous carbon

Carbon materials are commonly found in both nuclear reactors and experimental systems. Various carbon structures occur in nuclear applications ranging from crystalline and nuclear graphite to the amorphous carbon seen in next-generation advanced reactor designs. Amorphous carbon is based on a randomized graphite-like structure and offers the unique ability to disperse impurities throughout the bulk composition. A graphite-like amorphous carbon system was modeled using the classical molecular dynamics (MD) code LAMMPS (Large-scale Atomic/Molecular Massively Parallel Simulator). An improved version of the temperature-dependent Adaptive Intermolecular Reactive Empirical Bond Order (AIREBO) potential was used to model the carbon-carbon atomic interactions for the temperature at 300 K along with densities 1.60, 1.70, 1.85, and 2.23 g/cm{sup 3}. From the normalized velocity autocorrelation function (VACF), the phonon density of state (DOS) was then calculated as the Fourier transform of the normalized VACF. This DOS was then used as the primary input for the evaluation of the thermal scattering law (TSL, i.e. S(α,β)) and associated neutron thermal scattering cross sections. The TSL was analyzed using the Full Law Analysis Scattering System Hub (FLASSH). The amorphous structure results in shifts of the phonon DOS to lower energy modes than typically displayed for ideal crystalline graphite. This impact on the DOS is directly reflected in the TSL. Furthermore, the typical optical peak at 0.25 eV for the ideal graphite disappears for amorphous carbon, in good agreement with the expected structure. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗

Thermal Neutron Scattering Cross Sections for Graphitic Amorphous Carbon

Carbon materials are commonly found in both nuclear reactors and experimental systems. Various carbon structures occur in nuclear applications ranging from crystalline and nuclear graphite to the amorphous carbon seen in next-generation advanced reactor designs. Amorphous carbon is based on a randomized graphite-like structure and offers the unique ability to disperse impurities throughout the bulk composition. A graphite-like amorphous carbon system was modeled using the classical molecular dynamics (MD) code LAMMPS (Large-scale Atomic/Molecular Massively Parallel Simulator). An improved version of the temperature-dependent Adaptive Intermolecular Reactive Empirical Bond Order (AIREBO) potential was used to model the carbon-carbon atomic interactions for the temperature at 300 K along with densities 1.60, 1.70, 1.85, and 2.23 g/cm 3 . From the normalized velocity autocorrelation function (VACF), the phonon density of state (DOS) was then calculated as the Fourier transform of the normalized VACF. This DOS was then used as the primary input for the evaluation of the thermal scattering law (TSL, i.e. S(α,β)) and associated neutron thermal scattering cross sections. The TSL was analyzed using the Full Law Analysis Scattering System Hub (FLASSH). The amorphous structure results in shifts of the phonon DOS to lower energy modes than typically displayed for ideal crystalline graphite. This impact on the DOS is directly reflected in the TSL. Furthermore, the typical features and the optical graphitic peak at 0.25 eV for the ideal graphite DOS disappear for graphite-like amorphous carbon, which shows good agreement with the expected structure.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Differences In High Burnup Fuel Management Strategies to Minimize FFRD and Increase Economic Viability

The nuclear industry is pursuing approval of an increase in the length of the pressurized water reactor (PWR) cycle from 18 months to 24 months to reduce reactor downtime and enhance the economic competitiveness of nuclear energy. Such an increase in reactor cycle length will require that the maximum rod average burnup exceeds the current regulatory limit of 62 GWd/MTU, and it could peak at approximately 75 GWd/MTU, posing potential reactor safety and performance concerns. One such concern is that fuel fragmentation, relocation, and dispersal (FFRD) could occur during a severe loss-of coolant accident (LOCA) in which a fuel rod balloons and bursts, and pulverized fuel fragments are dispersed throughout the reactor’s primary coolant system. Previous analyses have identified which reactor operating conditions leave the core more susceptible to FFRD and have shown that FFRD susceptibility is strongly linked to fuel rod burnup and linear heat rate (LHR) history. The work described in this report uses an optimization strategy known as parallel simulated annealing (PSA) and a coarse mesh Purdue Advanced Reactor Core Simulator (PARCS) reactor physics model to develop two core fuel loading patterns, each with a different optimization objective. One core optimization maximized the core’s cycle length while still respecting regulatory limits on the radial peaking factor and soluble boron concentration with a peak rod average burnup of 75 GWd/MTU. The second optimization was aimed at minimizing FFRD susceptibility while still targeting a 24-month cycle length and respecting regulatory limits. PARCS model predictions were verified using the high-fidelity Virtual Environment for Reactor Applications (VERA). The two core designs were compared to highlight core design strategies to minimize FFRD susceptibility and to maximize economic viability.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

High y + Shear-Stress Turbulence Implementation for High Flux Isotope Reactor Narrow Channel Flows

The research objective of this work was to improve the engineering predictions of the turbulence characteristics of flows in curved narrow channels. Such channel flows are commonly encountered in nuclear research and test reactors, with one of them being the high-flux isotope reactor (HFIR). Research reactors bear high heat fluxes, and the proper computing of turbulence is paramount for safe and reliable reactor operation. The study builds on the results of a previous direct numerical simulation of turbulence to inform a well-known Reynolds-averaged Navier–Stokes shear-stress turbulence model and improves its accuracy in simulating parallel channel flows. A new formulation of the loss term in the dissipation conservation equation is suggested. Combined with high wall distance computational grids, the new implementation provides a fast-running flow solution, suitable for engineering purposes. Model generalization for parallel channel flows, in a broader range of frictional Reynolds numbers, is suggested by introducing a new form of the model constants.

CFD↗

Effect of sintering temperature on adhesion of spray-on piezoelectric transducers

Conventionally sol-gel spray-on transducers require a high-temperature (> 700 ◦C) sintering process; however, this process can affect the microstructure of the substrate material. For mechanical elbows and valves utilized for fluid transport in the energy sector, the components are designed to have a specific microstructure, and deviations from these specifications can create weak points in the system. For this reason it is important to investigate how the temperature of the deposition process affects the substrate. This paper investigates the effect of high-temperature and low-temperature (< 150 ◦C) processing conditions on the surface composition of the substrate. Furthermore, the resultant transducers from high- and low-temperature fabrication processes are compared to determine if a low-temperature processing method is feasible. For these studies a sol-gel spray-on process is employed to deposit piezoelectric ceramics onto a stainless-steel 316L substrate. Energy-dispersive X-ray spectroscopy is utilized to determine the composition of the substrate surface before and after transducer deposition. Results indicate that the high-temperature processing conditions may alter the surface composition of the metal due to a diffusion of the metal into the ceramic, which results in a metal surface that is bonded to the ceramic. Furthermore, it is shown that low-temperature processing of spray-on transducers is a viable method for transducer fabrication where the resultant transducers meet the industry minimum requirement of 30 dB signalto-noise ratio. In parallel simulation calculations, finite-element method (FEM) studies were performed to model the adhesive strength of the low-temperature processed transducer to the substrate surface. Comparisons between the simulations and experiments suggest that the bond strength is much greater than the commercial gel bonds and closer to hardened epoxy glue bonds. These results indicate that spray-on transducers fabricated under lowtemperature processing conditions are a viable solution for leave-in-place monitoring of structures.

M. Sinding, Kyle↗

Alfalfa Virtual Building Service: Software Engineering Best Practices Applied to Runtime Interaction with Building Energy Models

Buildings are active participants in increasingly complex energy systems. Building Energy Modeling (BEM) has a key role to play in planning and de-risking an equitable energy transition, with BEM-backed "virtual buildings" critical path for diverse applications that include workforce training tools, Hardware-in-the-Loop (HIL) experimentation to study equipment performance under a range of conditions, Control-Hardware-in-the-Loop (CHIL) experimentation to de-risk commercial control implementations at equipment through grid orchestration levels, and integration of dynamic load profiles into grid modeling tools for energy system experimentation at the urban scale. Modeling requirements vary across these applications, but many software engineering tasks do not. The Alfalfa Virtual Building Service (AVBS, see https://github.com/NREL/alfalfa/wiki) is an open-source web service that solves these common tasks robustly in one place, providing a foundational platform for power users to bootstrap their own applications. AVBS abstracts the specifics of runtime interaction with OpenStudio, Modelica, and Spawn of EnergyPlus models behind a unified REST API. Additionally, AVBS provides resources for cloud deployment and scaling to 100s of parallel simulations, a growing library of modular Operational Technology (OT) integrations for emulation of real-world interfaces, and scripts to automate the population of communities of virtual buildings from URBANopt, ResStock and ComStock.

building automation↗

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗

Computer Science Research Needs for Parallel Discrete Event Simulation (PDES)

Historically, scientific computing efforts have demonstrated the clear need for, and effective use of, supercomputing with traditional time-stepped simulations. Nevertheless, there are several areas in the mission spaces of the U.S. Department of Energy and other agencies waiting to tap advanced computing research using a different, discrete event style of modeling, simulation, and analysis. These span a wide spectrum of applications including energy grid resilience, urban planning and policy, transportation science, building technologies, emergency response and planning, environmental impact analysis, computational epidemiology, Internet communications, cyber security, and cyber-physical systems, to name only a few. Even within traditional scientific applications, the role of discrete event modes of execution is increasing in the form of new event-based mathematical solvers such as quantized state integration methods and discrete-continuous hybrid system solvers. Co-design of advanced supercomputing hardware systems is another area that exploits discrete event simulation at its core for effective analyses. Complex systems, entity behaviors and interconnections play a significant role in all these applications, which are mapped to large-scale models with discrete event formulations. To make advancements in all the aforementioned scientific areas, many technical aspects need to be more thoroughly studied and deeply understood in parallel discrete event simulation (PDES). The unique dynamics inherent in a discrete event modeling approach, by their very nature, intersect and influence the entire stack of the computing system, including (a) the unique nature of the instruction sets exercised in PDES workloads without a predominance of high-precision floating point operations, (b) virtual time-constrained multi-threaded execution of many logical processes per processor, (c) extremely variable and difficult to predict network traffic characteristics, (d) interfaces and inter-dependencies with machine learning and artificial intelligence codes at higher software layers, and (e) highly challenging load balancing needs, especially in effectively accounting for accelerated/extremely heterogeneous computing in current and future high-performance computing systems. Efficient and accurate parallel execution of PDES workloads is also dominated by challenges in dealing with their asynchronous concurrency fundamentally present at the model level. Conservative synchronization, optimistic/speculative synchronization, and their hybrid schemes open new questions in fundamental computer science with respect to reversibility of computation and prediction (lookahead) of behaviors inherent within model codes. On the implementation front, there are relatively few scalable, general-purpose parallel discrete event simulators in the world, and even fewer have been studied on emerging hardware platforms. To enable scientific advances using PDES, the research needs in computer science must also be pursued and met in the intersection of the algorithmic and hardware-aware aspects of scalable PDES engines. This report is aimed at capturing a computer science-oriented view of this important area of research in PDES, presenting a sample of important applications with their inherent discrete event technology elements. Needs are outlined in core areas of parallel discrete event research as well as cross-cutting directions in computer science research that positively impact scientific advancements across several important application areas. A selection of priority research opportunities in advanced computing for PDES is identified to serve as reference for key research topics and their order of importance for scientific advancements.

97 MATHEMATICS AND COMPUTING↗

PCMS: Parallel Coupler For Multimodel Simulations

This paper presents the Parallel Coupler for Multimodel Simulations (PCMS), a new GPU accelerated generalized coupling framework for coupling simulation codes on leadership class supercomputers. PCMS includes distributed control and field mapping methods for up to five dimensions. For field mapping PCMS can utilize discretization and field information to accommodate physics constraints. PCMS is demonstrated with a coupling of the gyrokinetic microturbulence code XGC with a Monte Carlo neutral transport code DEGAS2 and with a 5D distribution function coupling of an energetic particle transport code (GNET) to a gyrokinetic microturbulence code (GTC). Weak scaling is also demonstrated on up to 2,080 GPUs of Frontier with a weak scaling efficiency of 85%.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Automated Calibration of Parallel and Distributed Computing Simulators: A Case Study

Many parallel and distributed computing research results are obtained in simulation, using simulators that mimic real-world executions on some target system. Each such simulator is configured by picking values for parameters that define the behavior of the underlying simulation models it implements. The main concern for a simulator is accuracy: simulated behaviors should be as close as possible to those observed in the real-world target system. This requires that values for each of the simulator's parameters be carefully picked, or “calibrated,” based on ground-truth real-world executions. Examining the current state of the art shows that simulator calibration, at least in the field of parallel and distributed computing, is often undocumented (and thus perhaps often not performed) and, when documented, is described as a labor-intensive, manual process. In this work we evaluate the benefit of automating simulation calibration using simple algorithms. Specifically, we use a real-world case study from the field of High Energy Physics and compare automated calibration to calibration performed by a domain scientist. Our main finding is that automated calibration is on par with or significantly outperforms the calibration performed by the domain scientist. Furthermore, automated calibration makes it straightforward to operate desirable tradeoffs between simulation accuracy and simulation speed.

Mc donald, Jesse↗

Large-Scale Welding Process Simulation by GPU Parallelized Computing

The computational design of industrially relevant welded structures is extremely time consuming due to coupled physics and high nonlinearity. Previously, most welding distortion and residual stress simulations have been limited to small coupons and reduced order (from three-dimensional [3D] to two-dimensional [2D]), or inherent strain approximations were used for large structures. In this current study, an explicit finite element code based on a graphics processing unit was utilized to perform 3D transient thermomechanical simulation of structural components during welding. Laser brazing of aluminum alloy panels as representative of automotive manufacturing scenarios was simulated to predict out-of-plane distortion under different clamping conditions. The predicted deformation pattern and magnitude were validated by laser scanning data of physical assemblies. In addition, the code was used to investigate residual stresses developed during multipass arc welding of a nuclear industry pressurizer surge nozzle and subsequent welding repair where a 3D simulation was necessary. Taking the experimental data as reference, the 3D model predicted better residual stress distribution than a typical 2D asymmetrical model. Stress evolution in welding repair was also presented and discussed in this study. Furthermore, the efficient numerical model made it feasible to use integrated computational welding engineering to simulate welding processes for large-scale structures.

97 MATHEMATICS AND COMPUTING↗

Parallel quantum computing simulations via quantum accelerator platform virtualization

Quantum circuit execution is a central task in quantum computation. Due to inherent quantum-mechanical constraints, quantum computing workflows often involve a considerable number of independent measurements over a large set of slightly different quantum circuits. Here we discuss a simple model for parallelizing such quantum circuit executions that is based on introducing a large array of virtual quantum processing units (mapped to HPC nodes in our case) as a parallel quantum computing platform. Implemented within the XACC framework, the model can readily take advantage of its backend-agnostic features, enabling parallel quantum computing/simulation over any target backend supported by XACC. We illustrate the performance of this approach by demonstrating strong scaling in two pertinent domain science problems, namely in computing the gradients for the multi-contracted variational quantum eigensolver and in data-driven quantum circuit learning, where we vary the number of qubits and the number of circuit layers. Here, the latter simulation leverages the cuQuantum library to run efficiently on GPU-accelerated HPC platforms.

97 MATHEMATICS AND COMPUTING↗

Computational modeling of graphite degradation in molten salt reactors: Role of infiltration

Molten salt reactors (MSRs) often employ graphite as a moderator and reflector. An important challenge for deploying graphite in these reactors is that, due to limited experimental data, our understanding of graphite’s structural integrity in molten salt environments remains incomplete. Here, this study addresses heat generation from fuel-bearing salt that has infiltrated open pores in the graphite, driven primarily by pressure differentials. This is one of multiple identified physical and chemical mechanisms through which molten salt could potentially degrade graphite. Thermally driven stresses are quantified using the Molten-Salt Reactor Experiment (MSRE) graphite moderator elements as a case study. Finite element simulations predict stress distributions at varying infiltration levels, indicating that thermal stresses increase with higher infiltration. Rare-event simulations using the parallel subset simulation framework identify the combinations and corresponding ranges of input parameters that lead to stresses above a specified threshold. In particular, combinations involving high infiltration amounts, high power density, and low thermal conductivity tend to induce the highest stresses. Under the inputs and assumptions considered in this work, the magnitudes of the thermally driven stresses are quite low, with a very low likelihood of causing failure due to exceeding the graphite’s tensile strength. Additionally, rare-event simulations were performed for two more scenarios: a scaled-up moderator geometry and a localized hotspot in the original geometry. Both cases resulted in increased susceptibility to failure, though not to a detrimental extent. Furthermore, the combined effects of irradiation and infiltration-induced thermal stresses were evaluated. The results showed that thermal stresses from infiltration were negligible compared to those caused by irradiation. The findings of such a study are inherently component-specific, but the methodology presented here could be used for similar assessments of salt-infiltration effects in other graphite components.

36 - MATERIALS SCIENCE↗

Parallel-in-Time Simulation of Lindblad's Equation

Constructing fast quantum logic gates is critical to building a scalable quantum computer. We consider a qudit, a quantum version of a bit that can take an arbitrary number of states, coupled with a cavity. In this project, we wish to force the qudit to reach the 0-state, for any possible initial state. The coupled system changes in time according to Lindblad’s equation, an ordinary differential equation on the density matrix of the quantum system. Lindblad’s equation contains some parameters that we can control, so-called control functions. We seek control functions which force the qudit to the 0-state within 2 microseconds, which is much faster than what is currently done in practice. The search method is gradient descent, a numerical optimization method that uses gradient information to iteratively improve the control parameters. My contribution to this project is an attempt to speed up the computation of the gradient. It currently takes about 40 seconds to compute the gradient which involves solving a set of ODEs sequentially. Current supercomputers have thousands of cores, but sequential computations can only make use of 1 core at a time. We wish to divide up the work better, so that we can use many more cores at once. To this end, we have implemented the Multigrid Reduction in Time (MGRIT) algorithm. We perform a systematic parameter search on how to best apply this algorithm. Results indicate a 25 percent speed up for solving Lindblad’s equation and determining how close the final state is the 0-state.

97 MATHEMATICS AND COMPUTING↗