Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “high performance space computing”

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 451 records · Page 25

Investigation of SF6 Alternatives in Spark Gap Switches for GWP Reduction

This primary purpose of this project was to evaluate alternative gas mixtures to sulfur hexafluoride (SF6) developed for high voltage power delivery applications for use in high voltage spark gap switches. These SF6 alternatives lower global warming potential emissions and enable improvements to the pressure-voltage design space. A combined experimental, computational, and theoretical study was used to quantify the impact of persistent breakdown products on the breakdown distribution of SF6-replacement gas mixtures. Viable SF6 replacements suitable for use in spark gap switches were studied to enable performance and agility improvements for next-generation pulsed power research relevant to national security missions. Experimental campaign included establishing parameters of switch gases as function of concentration. Various concentrations and pressures were tested for trends in breakdown voltage, repeatability, and durability, and breakdown constituents. A zero-dimensional plasma global model was used to simulate the plasma arc decay and recombination process in spark-gap switches relevant to the Z machine. Finally, a complete and consistent set of electron-neutral collision cross-sections for the novel insulating gas C4F7N is reported.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-fidelity machine-learning with uncertainty quantification and Bayesian optimization for materials design: Application to ternary random alloys

We present a scale-bridging approach based on a multi-fidelity (MF) machine-learning (ML) framework leveraging Gaussian processes (GP) to fuse atomistic computational model predictions across multiple levels of fidelity. Through the posterior variance of the MFGP, our framework naturally enables uncertainty quantification, providing estimates of confidence in the predictions. We used density functional theory as high-fidelity prediction, while a ML interatomic potential is used as low-fidelity prediction. Practical materials’ design efficiency is demonstrated by reproducing the ternary composition dependence of a quantity of interest (bulk modulus) across the full aluminum–niobium–titanium ternary random alloy composition space. The MFGP is then coupled to a Bayesian optimization procedure, and the computational efficiency of this approach is demonstrated by performing an on-the-fly search for the global optimum of bulk modulus in the ternary composition space. The framework presented in this manuscript is the first application of MFGP to atomistic materials simulations fusing predictions between density functional theory and classical interatomic potential calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

TADSim: Discrete Event-based Performance Prediction for Temperature Accelerated Dynamics

Next-generation high-performance computing will require more scalable and flexible performance prediction tools to evaluate software--hardware co-design choices relevant to scientific applications and hardware architectures. Here, we present a new class of tools called application simulators—parameterized fast-running proxies of large-scale scientific applications using parallel discrete event simulation. Parameterized choices for the algorithmic method and hardware options provide a rich space for design exploration and allow us to quickly find well-performing software--hardware combinations. We demonstrate our approach with a TADSim simulator that models the temperature-accelerated dynamics (TAD) method, an algorithmically complex and parameter-rich member of the accelerated molecular dynamics (AMD) family of molecular dynamics methods. The essence of the TAD application is captured without the computational expense and resource usage of the full code. We accomplish this by identifying the time-intensive elements, quantifying algorithm steps in terms of those elements, abstracting them out, and replacing them by the passage of time. We use TADSim to quickly characterize the runtime performance and algorithmic behavior for the otherwise long-running simulation code. We extend TADSim to model algorithm extensions, such as speculative spawning of the compute-bound stages, and predict performance improvements without having to implement such a method. Validation against the actual TAD code shows close agreement for the evolution of an example physical system, a silver surface. Finally, focused parameter scans have allowed us to study algorithm parameter choices over far more scenarios than would be possible with the actual simulation. This has led to interesting performance-related insights and suggested extensions.

97 MATHEMATICS AND COMPUTING↗

An a priori Analysis of Mixture Fraction-Based Modeling of Coal Combustion

Due to the high computational cost associated with using detailed kinetic mechanisms, it is common practice to implement reaction models which rely on relatively small number of variables when simulating turbulent combustion systems. In this study, we perform an a priori assessment of the accuracy of three chemistry models: a Burke-Schumann chemistry model, an equilibrium chemistry model, and a steady laminar flamelet model. All chemistry modeling approaches considered include a mixture fraction for devolatilization products, and a normalized enthalpy deficit as parameters, with scalar dissipation rate as an additional input parameter for the flamelet model. Data used as a basis for the study is generated through One-Dimensional Turbulence (ODT) simulation of a coal combustion system in which high-fidelity models are used for gas phase chemistry and devolatilization. The flamelet model was found to be more accurate than both the equilibrium and Burke-Schumann models over a majority of parameter space. The performance of all models considered declined substantially for sufficiently fuel-rich conditions. Furthermore, the analysis in this work indicate that both differential diffusion and speciation of volatiles have a perceptible negative impact on flamelet reconstructions, though the effect of differential diffusion was more substantial.

97 MATHEMATICS AND COMPUTING↗

Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. Here we present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore chooses shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation, and that these shifts can be used for multiple configurations within the same ensemble with no penalty to performance.

97 MATHEMATICS AND COMPUTING↗

Breaking the mold: Overcoming the time constraints of molecular dynamics on general-purpose hardware

The evolution of molecular dynamics (MD) simulations has been intimately linked to that of computing hardware. For decades following the creation of MD, simulations have improved with computing power along the three principal dimensions of accuracy, atom count (spatial scale), and duration (temporal scale). Since the mid-2000s, computer platforms have, however, failed to provide strong scaling for MD, as scale-out central processing unit (CPU) and graphics processing unit (GPU) platforms that provide substantial increases to spatial scale do not lead to proportional increases in temporal scale. Important scientific problems therefore remained inaccessible to direct simulation, prompting the development of increasingly sophisticated algorithms that present significant complexity, accuracy, and efficiency challenges. While bespoke MD-only hardware solutions have provided a path to longer timescales for specific physical systems, their impact on the broader community has been mitigated by their limited adaptability to new methods and potentials. In this work, we show that a novel computing architecture, the Cerebras wafer scale engine, completely alters the scaling path by delivering unprecedentedly high simulation rates up to 1.144 M steps/s for 200 000 atoms whose interactions are described by an embedded atom method potential. This enables direct simulations of the evolution of materials using general-purpose programmable hardware over millisecond timescales, dramatically increasing the space of direct MD simulations that can be carried out. In this paper, we provide an overview of advances in MD over the last 60 years and present our recent result in the context of historical MD performance trends.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fully-Implicit Orthogonal Reconstructed Discontinuous Galerkin for Fluid Dynamics with Phase Change

A new reconstructed Discontinuous Galerkin (rDG) method, based on orthogonal basis/test functions, is developed for fluid flows on unstructured meshes. Orthogonality of basis functions is essential for enabling robust and efficient fully-implicit Newton-Krylov based time integration. The method is designed for generic partial differential equations, including transient, hyperbolic, parabolic or elliptic operators, which are attributed to many multiphysics problems. We demonstrate the method’s capabilities for solving compressible fluid-solid systems (in the low Mach number limit), with phase change (melting/solidification), as motivated by applications in Additive Manufacturing (AM). We focus on the method’s accuracy (in both space and time), as well as robustness and solvability of the system of linear equations involved in the linearization steps of Newton-based methods. The performance of the developed method is investigated for highly-stiff problems with melting/solidification, emphasizing the advantages from tight coupling of mass, momentum and energy conservation equations, as well as orthogonality of basis functions, which leads to better conditioning of the underlying (approximate) Jacobian matrices, and rapid convergence of the Krylov-based linear solver.

97 MATHEMATICS AND COMPUTING↗

Enhanced Data Efficiency Using Deep Neural Networks and Gaussian Processes for Aerodynamic Design Optimization

Adjoint-based optimization methods are attractive for aerodynamic shape design primarily due to their computational costs being independent of the dimensionality of the input space and their ability to generate high-fidelity gradients that can then be used in a gradient-based optimizer. This makes them very well suited for high-fidelity simulation based aerodynamic shape optimization of highly parametrized geometries such as aircraft wings. However, the development of adjoint-based solvers involve careful mathematical treatment and their implementation require detailed software development. Furthermore, they can become prohibitively expensive when multiple optimization problems are being solved, each requiring multiple restarts to circumvent local optima. In this work, we propose a machine learning enabled, surrogate-based framework that replaces the expensive adjoint solver, without compromising on predicting predictive accuracy. Specifically, we first train a deep neural network (DNN) from training data generated from evaluating the high-fidelity simulation model on a model-agnostic design of experiments on the geometry shape parameters. The optimum shape may then be computed by using a gradient-based optimizer coupled with the trained DNN. Subsequently, we also perform a gradient-free Bayesian optimization, where the trained DNN is used as the prior mean. We observe that the latter framework (DNN-BO) improves upon the DNN-only based optimization strategy for the same computational cost. Overall, this framework predicts the true optimum with very high accuracy, while requiring far fewer high-fidelity function calls compared to the adjoint-based method. Furthermore, we show that multiple optimization problems can be solved with the same machine learning model with high accuracy, to amortize the offline costs associated with constructing our models. Our methodology finds applications in the early stages of aerospace design. (C) 2021 Published by Elsevier Masson SAS.

Renganathan, S. Ashwin↗

Estimate the Electromechanical States Using Particle Filtering and Smoothing

Accurate knowledge of electromechanical states is critical for efficient and reliable control of a power system. This paper proposes a particle filtering approach to estimate the electromechanical states of power systems from Phasor Measurement Unit (PMU) data. Without having to go through laborious linearization procedure, the proposed particle filtering techniques can estimate states of a complex power system, which is often non-linear and has non-Gaussian noise. The proposed method is evaluated using a multi-machine system with both large and small disturbances. Sensitivity studies of the dynamic state estimation performance are also presented to show the robustness of the proposed method. The inherent decoupling properties of particle filtering make it highly scalable and the potential to reduce computational time through parallel implementation is very promising.

Auxiliary Particle Filter↗

Hard Disk/Solid State Drive Synergy in Support of Data-Intensive Computing [Slides]

Data-intensive applications are becoming increasingly common in high-performance computing. Examples include combustion simulation, human genome analysis, and satellite image processing. Efficient access of data sets is critical to the performance of these applications. Because of the size of the data today's economically feasible approach is to store the data files on an array of hard disks or data servers equipped with hard disks and managed by a parallel file system such as PVFS or Lustre wherein the data is striped over a (large) number of disks for high aggregate I/O throughout. With file striping, a request for a segment of logically contiguous file space is decomposed into multiple sub-requests, each to a different server. While the data unit for this striping is usually reasonably large to benefit disk efficiency, the first and/or last sub-requests can be much smaller than the striping unit if the request does not align with the striping pattern, severely compromising hard disk efficiency and thus application performance. We propose to exploit solid state drives (SSD), whose efficiency is much less sensitive to small random accesses, to enable the alignment of requests to disk with the data striping pattern. In this scheme hard disks mainly serve large, aligned, sequential requests, with SSDs serving small or unaligned requests, thus respecting the relative cost, performance, and durability characteristics of the two media, and thereby achieving synergy in performance/cost. We will describe the design of the proposed scheme, its implementation on CCS-7's Darwin cluster, and performance results.

97 MATHEMATICS AND COMPUTING↗

Time-stepping DPG formulations for the heat equation

For a wide range of PDEs, the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan provides discrete stability starting from a coarse mesh and minimization of the residual in a user-controlled norm, among other appealing features. Research on DPG for transient problems has mainly focused on spacetime discretizations, which has theoretical advantages, but practical costs for computations and software implementations. The sole examination of time-stepping DPG formulations was performed by Führer, Heuer, and Gupta, who applied Rothe’s method to an ultraweak formulation of the heat equation to develop an implicit time-stepping scheme; their work emphasized theoretical results, including error estimates in time and space. Here, we follow Führer, Heuer, and Gupta in examining the heat equation; our focus is on numerical experiments, examining the stability and accuracy of several formulations, including primal as well as ultraweak, and explicit as well as implicit and Crank–Nicolson time-stepping schemes. We are additionally interested in communication-avoiding algorithms, and we therefore include a highly experimental formulation that places all the trace terms on the right-hand side of the equation.

97 MATHEMATICS AND COMPUTING↗

An extended Vlasov–Fokker–Planck approach for kinetic simulations of laser plasmas

Vlasov–Fokker–Planck simulation codes occupy an important niche in modeling laser-produced plasmas, since they are well suited to studying the effect of collisions on electron kinetic phenomena, especially energy transport. One of the most important elements of energy transport is the absorption of laser light by the plasma; however, simulating this in detail requires resolving oscillations of the laser light, whose characteristic timescale is orders of magnitude shorter than the simulation time needed to study transport physics. For this reason, most Vlasov–Fokker–Planck codes used to study electron transport in laser plasmas rely on simplified models of the laser–plasma coupling. Their underlying assumptions nominally preclude their use for modeling laser light having short-scale structure in space or time, such as broadband lasers. In this work, we derive a more general computational framework suitable for arbitrarily structured laser fields. Furthermore, our approach is based on an extended set of Vlasov–Fokker–Planck equations that separately solve for the low- and high-frequency plasma response. We implement these extended Vlasov–Fokker–Planck equations in the spherical harmonic code K2 and demonstrate the performance of the method on several laser absorption test problems, with particular attention to the judicious selection of time steps, time integrators, and spherical harmonic truncation, according to the intensity and spectrum of the laser light under consideration. Comparison with the widely used Langdon absorption operator shows the Langdon operator performs remarkably well for predicting laser heating in the simple cases considered here, even in situations that would seem to violate its underlying assumptions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

High Order Finite Difference Methods with Subcell Resolution for Stiff Multispecies Discontinuity Capturing

Here, we extend the high order finite-difference method with subcell resolution (SR) in [34] for two-species stiff one-reaction models to multispecies and multireaction inviscid chemical reactive flows, which are significantly more difficult because of the multiple scales generated by different reactions. For reaction problems, when the reaction time scale is very small, the reaction zone scale is also small and the governing equations become very stiff. Wrong propagation speed of discontinuity may occur due to the underresolved numerical solution in both space and time. The present SR method for reactive Euler system is a fractional step method. In the convection step, any high order shock-capturing method can be used. In the reaction step, an ODE solver is applied but with certain computed flow variables in the shock region modified by the Harten subcell resolution idea. Several numerical examples of multispecies and multireaction reactive flows are performed in both one and two dimensions. Studies demonstrate that the SR method can capture the correct propagation speed of discontinuities in very coarse meshes.

65M06↗

Co-design in ACES and exascale.

The Alliance for Computing at the Extreme Scale (ACES) is a Los Alamos and Sandia collaboration encompassing not only HPC procurements and operations, but also computer science and architecture research and development. One area of focus within ACES relates to the critical technology developments for future high performance computing systems and the applications that would run on them, and ACES is heavily involved in the proposed DOE Exascale Initiative. The proposed Exascale Initiative emphasizes the need for co-design, which is the three-way collaborative and concurrent design of HPC hardware, software, and the applications themselves. Transformational changes will occur not only in HPC hardware, but also in the applications space, and taken together these will require transformation changes in the overall software layers supporting the programming models, tools, runtimes, file systems, and operating systems. Co-design involving all three areas of hardware, software, and applications will be the key to success. This talk will outline key aspects of the Exascale Initiative and its emphasis on co-design. It will provide some examples from LANL & Sandia experiences in co-design including aspects of the innovative Roadrunner architecture and software, a ACES-Cray project studying advanced interconnects within Cray, and Sandia's work in computer system simulators and mini-applications.

99 GENERAL AND MISCELLANEOUS↗

Understanding Dynamical Systems in High-Dimensional Parameter Spaces (Final Report)

In the last few decades, computational models, especially of the complex dynamical systems of greatest interest, i.e., climate, high energy density science, combustion, etc. have become increasingly accurate and sophisticated. Consequently, they are now routinely used to predict outcomes of experiments or to inform design decisions. However, many such simulations depend on a (large) number of parameters in order to, for example, approximate physical phenom whose exact solution is unknown or describe material properties in situations with little or no experimental data. Choosing these parameters and understanding how the outcomes of such a simulation changes with respect to the inputs are rapidly becoming some of the primary challenges in many application areas. Simulations have long been too complex for humans to fully comprehend and thus are often treated as black-box systems. The inputs to the systems are typically a collection of parameters with expert-selected ranges, and the outputs are various quantities of interest (QoIs) describing the performance of the system. Therefore, the fundamental challenge can be described as one of understanding a high-dimensional (many input parameters), multi-variate (many QoIs) function. Unfortunately, existing analysis tools are only of limited use for this task as most techniques can neither deal with many input dimensions nor offer opportunities to jointly study several QoIs. Furthermore, data analysis has long relied on an exploratory process in which scientist first visualize the available data, for example, using scatter plots or 3D renderings, form new hypotheses on some phenomena of interest, and subsequently test these hypotheses using dedicated analysis or statistics approaches. However, for high-dimensional functions this exploration is difficult if not impossible using existing tools as there are too many QoIs to simultaneously observe, and visualizations of high-dimensional spaces are abstract and difficult to understand if they exist at all. The goal of this project is to build new analysis techniques and tool that offer high level insights for exploring high-dimensional scientific data. And to extend existing approach beyond single scalar functions and instead consider multiple QoIs simultaneously.

97 MATHEMATICS AND COMPUTING↗

Multi-Objective Optimization of Uranium Target Assembly–3: A Comparison of Genetic and Traditional Methods

Commonly produced as a byproduct of uranium fission, 99 Mo is a key medical isotope that is in high demand in the United States. An international goal is to switch from medical isotope production technologies that require highly enriched uranium to medical isotope production technologies that require only low-enriched uranium. Niowave Inc. is contributing to this goal by developing an accelerator-driven subcritical assembly called the Uranium Target Assembly (UTA). This work compares the performance of Dakota’s Multi-Objective Genetic Algorithm (MOGA) against traditional sensitivity analysis in the neutronic optimization of the UTA-3 system. The design objectives are k-eigenvalue (k eff ) and natural uranium fission power, which are directly correlated with the amount of 99 Mo produced. Dakota:MOGA did not perform as well as human engineering ingenuity in optimization studies with high numbers of input parameters, such as fuel rod type selection and fuel rod placement. However, Dakota:MOGA did outperform traditional sensitivity analysis in optimization studies with fewer than 20 parameters and revealed the degree to which each parameter influences the optimal design space for k eff and natural uranium fission power (to a lesser extent). As the design model became more complex in the final stage of design, the computational resources required to calculate the design objective values in the Monte Carlo N-Particle transport code from selected input parameter combinations limited Dakota:MOGA’s performance, and, unfortunately, human intervention was required to discern the optimal design space. In conclusion, future work will attempt to reduce computational resource constraints by incorporating areduced-order neutronics model into the optimization cycle.

Accelerator-driven systems↗

Inverse Analysis with Variational Autoencoders: A Comparison of Shallow and Deep Networks

Inverse problems are applied to determine unknown properties by matching observational data with a physical model that often takes many parameters as input. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented involving regularization with a technique known as a variational autoencoder (VAE), which is trained to map a high-dimensional parameter space with a complex structure to a low-dimensional latent space with a simple structure. We apply this approach to unconditioned realizations of the parameters (heterogeneous hydraulic fields) for a hydrogeological inverse problem. Two types of hydraulic conductivity fields are used to evaluate the characterization for the different levels of heterogeneity complexity of the physical inputs. This approach keeps the computational cost of generating the training data low. The reason is unconditioned realizations neither rely on the observational data used to perform the inverse analysis nor require any groundwater flow model forward runs. In addition, this approach applies regularization on a low-dimensional latent space from the VAE and increases optimization efficiency through automatic differentiation. Furthermore, two different neural network (NN) structures are tested for their utility in using the VAE for inverse analysis. The performance of a deep, convolutional neural network strongly depends on the dimensionality of the latent space, which requires tuning. In contrast, a shallow, dense neural network provides consistently accurate characterization without tuning. Furthermore, our approach evaluates the advantages of the shallow, dense neural network over the deep, convolutional one and enables future application to a wide range of inverse problems.

97 MATHEMATICS AND COMPUTING↗