Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “accelerated 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 1,477 records · Page 82

Evolution of artificial intelligence for application in contemporary materials science

Abstract Contemporary materials science has seen an increasing application of various artificial intelligence techniques in an attempt to accelerate the materials discovery process using forward modeling for predictive analysis and inverse modeling for optimization and design. Over the last decade or so, the increasing availability of computational power and large materials datasets has led to a continuous evolution in the complexity of the techniques used to advance the frontier. In this Review, we provide a high-level overview of the evolution of artificial intelligence in contemporary materials science for the task of materials property prediction in forward modeling. Each stage of evolution is accompanied by an outline of some of the commonly used methodologies and applications. We conclude the work by providing potential future ideas for further development of artificial intelligence in materials science to facilitate the discovery, design, and deployment workflow. Graphical abstract

Materials Science↗

FPGA-accelerated SpeckleNN with SNL for real-time X-ray single-particle imaging

We present the implementation of a specialized version of our previously published unified embedding model, SpeckleNN, for real-time speckle pattern classification in X-ray Single-Particle Imaging (SPI), using the SLAC Neural Network Library (SNL) on an FPGA platform. This hardware realization transitions SpeckleNN from a prototypic model into a practical edge solution, optimized for running inference near the detector in high-throughput X-ray free-electron laser (XFEL) facilities, such as those found at the Linac Coherent Light Source (LCLS). To address the resource constraints inherent in FPGAs, we developed a more specialized version of SpeckleNN. The original model, which was designed for broader classification across multiple biological samples, comprised ~5.6 million parameters. The new implementation, while reducing the parameter count to 64.6K (a 98.8% reduction), focuses on maintaining the model's essential functionality for real-time operation, achieving an accuracy of 90%. Furthermore, we compressed the latent space from 128 to 50 dimensions. This implementation was demonstrated on the KCU1500 FPGA board, utilizing 71% of available DSPs, 75% of LUTs, and 48% of FFs, with an average power consumption of 9.4W according to the Vivado post-implementation report. The FPGA performed inference on a single image with a latency of 45.015 microseconds at a 200 MHz clock rate. In comparison, running the same inference on an NVIDIA A100 GPU resulted in an average power consumption of ~73W and an image processing latency of around 400 microseconds. Our FPGA-accelerated version of SpeckleNN demonstrated significant improvements, achieving an 8.9 × speedup and a 7.8 × reduction in power consumption compared to the GPU implementation. Key advancements include model specialization and dynamic weight loading through SNL, which eliminates the need for time-consuming FPGA design re-synthesis, allowing fast and continuous deployment of models (re)trained online. These innovations enable real-time adaptive classification and efficient vetoing of speckle patterns, making SpeckleNN more suited for deployment in XFEL facilities. This implementation has the potential to significantly accelerate SPI experiments and enhance adaptability to evolving experimental conditions.

47 OTHER INSTRUMENTATION↗

FPGA-based computing system for processing data in size, weight, and power constrained environments

Technologies that are well-suited for use in size, weight, and power (SWAP)-constrained environments are described herein. A host controller dispatches data processing instructions to hardware acceleration engines (HAEs) of one or more field programmable gate arrays (FPGAs) and further dispatches data transfer instructions to a memory controller, such that the HAEs perform processing operations on data stored in local memory devices of the HAEs in parallel with other data being transferred from external memory devices coupled to the FPGA(s) to the local memory devices.

Napier, Matthew↗

Supercomputing Pipelines Search for Therapeutics Against COVID-19

The urgent search for drugs to combat SARS-CoV-2 has included the use of supercomputers. The use of general-purpose graphical processing units (GPUs), massive parallelism, and new software for high-performance computing (HPC) has allowed researchers to search the vast chemical space of potential drugs faster than ever before. We developed a new drug discovery pipeline using the Summit supercomputer at Oak Ridge National Laboratory to help pioneer this effort, with new platforms that incorporate GPU-accelerated simulation and allow for the virtual screening of billions of potential drug compounds in days compared to weeks or months for their ability to inhibit SARS-COV-2 proteins. Here, this effort will accelerate the process of developing drugs to combat the current COVID-19 pandemic and other diseases.

60 APPLIED LIFE SCIENCES↗

Simulation of Proton Beams in the AGS Booster with Space Charge

As higher intensity accelerators are designed, built and operated, the resonances and instabilities caused by space charge can become dominant effects in limiting the intensity of the beam that can be delivered. Particle loss has many causes but space charge can be a major factor in reducing beam intensity and generating emittance growth, particularly at low energies and in the lower energy stages of accelerators such as the AGS Booster. Successful operation relies on a good understanding of basic particle dynamics and it becomes an important challenge to ascertain how the beam evolves when charged particles experience both external forces through the fields of the magnets combined with internal forces through Coulomb interactions. A possible approach to such a study is to include calculations of space charge in computer simulation codes that track the motions of charged particles in 6D phase space. Unfortunately, repeated space charge calculations in 6D phase space are computationally intensive even with the most modern computing facilities. Study with traditional models of space charge is then either limited to a short real-time scale, or sacrifices accuracy and often omits some of the physics. The study described in this report attempts to explore all aspects of the Booster from injection, through RF capture and acceleration to the extraction energy. The simulations are allied to real machine settings. They do not attempt to model effects that are well known and for which accurate experimental data are available, but they try in many cases to extend beyond the normal Booster parameter range so as to understand the limitations on operations and suggest areas for improvement.

43 PARTICLE ACCELERATORS↗

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗

Computing Reaction Kinetics with MC-PDFT–OPESf: Combining Multireference Electronic Structure Theory and Enhanced Sampling

Accurate rate constants are crucial for understanding and optimizing catalytic reactions mediated by enzymes, metalloproteins, and heterogeneous catalysts. These systems frequently present a dual computational challenge. Multiconfigurational reaction sites require multireference techniques for the accurate treatment of the electronic structure, and high activation barriers prevent efficient sampling of unbiased reactive transitions. In this work, we combine multiconfiguration pair-density functional theory (MC-PDFT) as an accurate and efficient multireference electronic structure method with on-the-fly probability-enhanced sampling flooding (OPESf) as an enhanced sampling method capable of accelerating reactive transitions. We demonstrate the approach on the Diels–Alder [4+2] cycloaddition between cis-butadiene and ethene as a reaction characterized by a large activation barrier and multireference character. MC-PDFT–OPESf provides reaction rates in agreement with experiments at a fraction of the computational cost required by conventional unbiased ab initio calculations. Here, we propose MC-PDFT–OPESf as an efficient approach for computing kinetics in strongly correlated molecular systems.

Chemical calculations↗

ERF: Energy Research and Forecasting Model

High performance computing (HPC) architectures have undergone rapid development in recent years. As a result, established software suites face an ever increasing challenge to remain performant on and portable across modern systems. Many of the widely adopted atmospheric modeling codes cannot fully (or in some cases, at all) leverage the acceleration provided by General-Purpose Graphics Processing Units, leaving users of those codes constrained to increasingly limited HPC resources. Energy Research and Forecasting (ERF) is a regional atmospheric modeling code that leverages the latest HPC architectures, whether composed of only Central Processing Units (CPUs) or incorporating GPUs. ERF contains many of the standard discretizations and basic features needed to model general atmospheric dynamics. The modular design of ERF provides a flexible platform for exploring different physics parameterizations and numerical strategies. ERF is built on a state-of-the-art, well-supported, software framework (AMReX) that provides a performance portable interface and ensures ERF's long-term sustainability on next generation computing systems. This paper details the numerical methodology of ERF, presents results for a series of verification/validation cases, and documents ERF's performance on current HPC systems. The roughly 5× speed up of ERF (using GPUs) over Weather Research and Forecasting (CPUs only) for a 3D squall line test case highlights the significance of leveraging GPU acceleration.

17 WIND ENERGY↗

GAHLS: an optimized graph analytics based high level synthesis framework

The urgent need for low latency, high-compute and low power on-board intelligence in autonomous systems, cyber-physical systems, robotics, edge computing, evolvable computing, and complex data science calls for determining the optimal amount and type of specialized hardware together with reconfigurability capabilities. With these goals in mind, we propose a novel comprehensive graph analytics based high level synthesis (GAHLS) framework that efficiently analyzes complex high level programs through a combined compiler-based approach and graph theoretic optimization and synthesizes them into message passing domain-specific accelerators. This GAHLS framework first constructs a compiler-assisted dependency graph (CaDG) from low level virtual machine (LLVM) intermediate representation (IR) of high level programs and converts it into a hardware friendly description representation. Next, the GAHLS framework performs a memory design space exploration while account for the identified computational properties from the CaDG and optimizing the system performance for higher bandwidth. The GAHLS framework also performs a robust optimization to identify the CaDG subgraphs with similar computational structures and aggregate them into intelligent processing clusters in order to optimize the usage of underlying hardware resources. Finally, the GAHLS framework synthesizes this compressed specialized CaDG into processing elements while optimizing the system performance and area metrics. Evaluations of the GAHLS framework on several real-life applications (e.g., deep learning, brain machine interfaces) demonstrate that it provides 14.27× performance improvements compared to state-of-the-art approaches such as LegUp 6.2.

97 MATHEMATICS AND COMPUTING↗

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.

97 MATHEMATICS AND COMPUTING↗

Analysis of RF Surface Loss in a Planar 2D Qubit

The Josephson junction and shunt capacitor form a transmon qubit, which is the cornerstone of modern quantum computing platforms. For reliable quantum computing, it is important how long a qubit can remain in a superposition of quantum states, which is determined by the coherence time (T1). The coherence time of a qubit effectively sets the "lifetime" of usable quantum information, determining how long quantum computations can be performed before errors occur and information is lost. There are several sources of decoherence in transmon qubits, but the predominant one is generally considered to be dielectric losses in the natural oxide layer formed on the surface of the superconductor. In this paper, we present a numerical study of microwave surface losses in planar superconducting antennas of different transmon qubit designs. An asymptotic method for estimating the energy participation ratio in ultrathin films of nanometer scales is proposed, and estimates are given for the limits of achievable minimum RF losses depending on the electrical properties of the surface oxide and the interface of the qubit with the substrate material.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Automated phase segmentation and quantification of high-resolution TEM image for alloy design

In the alloy design and development process, a wealth of atomically resolved structural high-resolution transmission electron microscopy (HRTEM) images are produced. Identifying the different nano-precipitate phases and tracking their evolution under various compositions and during manufacturing or post-processing requires hundreds of HRTEM images and thousands of precipitates. The nanoscopic phase information labeling and analysis purely relies on humans are prohibitively costly and time-consuming, sometimes not reliable because of the lack of authoritative knowledge. Here, in this work, we develop a novel unsupervised machine learning approach coupled with adaptive computer vision techniques with features in the Fourier space to automatically determine the number of phases and segment/quantify the phases with nanoscale resolution, allowing for quantitative correlation between nanostructure formation, processing and functional properties. To automate the phase extraction/quantification and ascertain its applicability, we have applied the developed framework to the HRTEM images from several alloy systems, processing conditions, image magnifications, and phase types and morphologies (precipitates, nano-twins, stacking faults, crystalline matrix, and amorphous structures) for verification. This study paves the road for compression, visualization, and translation of raw image structural data into physically relevant information in real-time with minimal human supervision. It shows the promise of enabling high-throughput materials characterization for the acceleration of alloy manufacturing and design.

36 MATERIALS SCIENCE↗

Accelerating high-strain continuum-scale brittle fracture simulations with machine learning

Failure in brittle materials under dynamic loading conditions is a result of the propagation and coalescence of microcracks. Simulating this discrete crack evolution at the continuum level is computationally expensive or, in some cases, intractable, resulting in the need to make broad assumptions or neglect key physics. In this work, we have developed an approach using machine learning that overcomes the current inability to represent meso-scale physics at the macro-scale. Our approach leverages damage and stress data from a computationally expensive high-fidelity model that explicitly resolves microcrack behavior to build an inexpensive machine learning emulator. Once trained, the machine learning emulator is used to predict the evolution of crack length statistics, which then informs a continuum-scale constitutive model. This results in a significant speed-up of the workflow by four orders of magnitude. Both the machine learning emulator and the continuum-scale model are validated against the high-fidelity model and experimental data, respectively, showing excellent agreement. There are two key findings. The first is that we can reduce the dimensionality of the problem, establishing that the machine learning emulator only needs the length of the longest crack and one of the maximum stress components to capture the necessary physics. Another compelling finding is that the emulator can be trained in one experimental setting and transferred successfully to predict behavior in a different setting.

36 MATERIALS SCIENCE↗

Mechanistic Insights into the Origins of Selectivity in a Cu-Catalyzed C–H Amidation Reaction

The catalytic transformation of C-H to C-N bonds offers rapid access to fine chemicals and high-performance materials, but achieving high selectivity from undirected aminations of unactivated C(sp 3 )-H bonds remains an outstanding challenge. Here, we report the origins of the reactivity and selectivity of a Cu-catalyzed C-H amidation of simple alkanes. Using a combination of experimental and computational mechanistic studies and energy decomposition techniques, we uncover a switch in mechanism from inner-sphere to outer-sphere coupling between alkyl radicals and the active Cu(II) catalyst with increasing substitution of the alkyl radical. The combination of computational predictions and detailed experimental validation shows that simultaneous minimization of both Cu-C covalency and alkyl radical size increases the rate of reductive elimination and that both strongly electron-donating and electron-withdrawing substituents on the catalyst accelerate the selectivity-determining C-N bond formation process as a result of a change in mechanism. These findings offer design principles for the development of improved catalyst scaffolds for radical C-H functionalization reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Efficient Bayesian Approach to Learning Droplet Collision Kernels: Proof of Concept Using “Cloudy,” a New n -Moment Bulk Microphysics Scheme

The small-scale microphysical processes governing the formation of precipitation particles cannot be resolved explicitly by cloud resolving and climate models. Instead, they are represented by microphysics schemes that are based on a combination of theoretical knowledge, statistical assumptions, and fitting to data (“tuning”). Historically, tuning was done in an ad hoc fashion, leading to parameter choices that are not explainable or repeatable. Recent work has treated it as an inverse problem that can be solved by Bayesian inference. The posterior distribution of the parameters given the data—the solution of Bayesian inference—is found through computationally expensive sampling methods, which require over $\mathcal{O}$(10 5 ) evaluations of the forward model; this is prohibitive for many models. We present a proof of concept of Bayesian learning applied to a new bulk microphysics scheme named “Cloudy,” using the recently developed Calibrate-Emulate-Sample (CES) algorithm. Cloudy models collision-coalescence and collisional breakup of cloud droplets with an adjustable number of prognostic moments and with easily modifiable assumptions for the cloud droplet mass distribution and the collision kernel. The CES algorithm uses machine learning tools to accelerate Bayesian inference by reducing the number of forward evaluations needed to $\mathcal{O}$(10 2 ). It also exhibits a smoothing effect when forward evaluations are polluted by noise. In a suite of perfect-model experiments, we show that CES enables computationally efficient Bayesian inference of parameters in Cloudy from noisy observations of moments of the droplet mass distribution. In an additional imperfect-model experiment, a collision kernel parameter is successfully learned from output generated by a Lagrangian particle-based microphysics model.

54 ENVIRONMENTAL SCIENCES↗

Multiscale modeling and cinematic visualization of photosynthetic energy conversion processes from electronic to cell scales

We report conversion of sunlight into chemical energy, namely photosynthesis, is the primary energy source of life on Earth. A visualization depicting this process, based on multiscale computational models from electronic to cell scales, is presented in the form of an excerpt from the fulldome show Birth of Planet Earth. This accessible visual narrative shows a lay audience, including children, how the energy of sunlight is captured, converted, and stored through a chain of proteins to power living cells. The visualization is the result of a multi-year collaboration among biophysicists, visualization scientists, and artists, which, in turn, is based on a decade-long experimental-computational collaboration on structural and functional modeling that produced an atomic detail description of a bacterial bioenergetic organelle, the chromatophore. Software advancements necessitated by this project have led to significant performance and feature advances, including hardware-accelerated cinematic ray tracing and instanced visualizations for efficient cell-scale modeling. The energy conversion steps depicted feature an integration of function from electronic to cell levels, spanning nearly 12 orders of magnitude in time scales. This atomic detail description uniquely enables a modern retelling of one of humanity’s earliest stories—the interplay between light and life.

97 MATHEMATICS AND COMPUTING↗

Suppressing the sample variance of DESI-like galaxy clustering with fast simulations

Ongoing and upcoming galaxy redshift surveys, such as the Dark Energy Spectroscopic Instrument (DESI) survey, will observe vast regions of sky and a wide range of redshifts. In order to model the observations and address various systematic uncertainties, N-body simulations are routinely adopted, however, the number of large simulations with sufficiently high mass resolution is usually limited by available computing time. Therefore, achieving a simulation volume with the effective statistical errors significantly smaller than those of the observations becomes prohibitively expensive. In this study, we apply the Convergence Acceleration by Regression and Pooling (CARPool) method to mitigate the sample variance of the DESI-like galaxy clustering in the AbacusSummit simulations, with the assistance of the quasi-N-body simulations FastPM. Based on the halo occupation distribution (HOD) models, we construct different FastPM galaxy catalogs, including the luminous red galaxies (LRGs), emission line galaxies (ELGs), and quasars, with their number densities and two-point clustering statistics well matched to those of AbacusSummit. We also employ the same initial conditions between AbacusSummit and FastPM to achieve high cross-correlation, as it is useful in effectively suppressing the variance. Our method of reducing noise in clustering is equivalent to performing a simulation with volume larger by a factor of 5 and 4 for LRGs and ELGs, respectively. We also mitigate the standard deviation of the LRG bispectrum with the triangular configurations k 2 = 2k 1 = 0.2 h Mpc -1 by a factor of 1.6. With smaller sample variance on galaxy clustering, we are able to constrain the baryon acoustic oscillations (BAO) scale parameters to higher precision. The CARPool method will be beneficial to better constrain the theoretical systematics of BAO, redshift space distortions (RSD) and primordial non-Gaussianity (NG).

79 ASTRONOMY AND ASTROPHYSICS↗

Prediction of performance and turbulence in ITER burning plasmas via nonlinear gyrokinetic profile prediction

Burning plasma performance, transport, and the effect of hydrogen isotope (H, D, D-T fuel mix) on confinement has been predicted for ITER baseline scenario (IBS) conditions using nonlinear gyrokinetic profile predictions. Accelerated by surrogate modeling (Rodriguez-Fernandez et al 2022 Nucl. Fusion 62 076036), high fidelity, nonlinear gyrokinetic simulations performed with the CGYRO code (Candy et al 2016 J. Comput. Phys. 324 73), were used to predict profiles of T i , T e , and n e while including the effects of alpha heating, auxiliary power (NBI + ECH), collisional energy exchange, and radiation losses inside of $r/a$ = 0.9. Predicted profiles and resulting energy confinement are found to produce fusion power and gain that are approximately consistent with mission goals ($P_\textrm{fusion} = 500$ MW at Q = 10) for the baseline scenario and exhibit energy confinement that is within 1σ of the H-mode energy confinement scaling. The power of the surrogate modeling technique is demonstrated through the prediction of alternative ITER scenarios with reduced computational cost. These scenarios include conditions with maximized fusion gain and an investigation of potential resonant magnetic perturbation (RMP) effects on performance with a minimal number of gyrokinetic profile iterations required (3–6). These predictions highlight the stiff ITG nature of the core turbulence predicted in the ITER baseline and demonstrate that $Q \gt$ 17 conditions may be accessible by reducing auxiliary input power while operating in IBS conditions. Prediction of full kinetic profiles allowed for the projection of hydrogen isotope effects around ITER baseline conditions. The gyrokinetic fuel ion species was varied from H, D, and 50/50 D-T and kinetic profiles were predicted. Results indicate that a weak or negligible isotope effect will be observed to arise from core turbulence in IBS conditions. The resulting energy confinement, turbulence, and density peaking, and the implications for ITER operations will be discussed.

gyrokinetics↗