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,405 records · Page 78
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

BETO 2021 Peer Review - ChemCatBio Data Hub 2.6.2.500

The goal of the ChemCatBio DataHub project is to accelerate the catalyst and process development cycle by developing transformational tools for prediction and collaboration in catalyst R&D. The project is currently focused on the development of the Catalyst Property Database (CPD), a free and public resource released in September 2020. The CPD was designed in response to the observation that when data, such as computed reaction energetics, is used in catalyst design, it is almost always generated by the researchers seeking to use it, even if similar data has been published previously. One barrier to data reuse that results in this duplication of effort is the difficult process of finding and applying published data, which can be slow, error-prone, and manual. The CPD seeks to overcome these challenges by creating a centralized, searchable database of quality catalyst property data. At present, the CPD contains computed adsorption energies for intermediates along catalytic pathways. During FY21 and FY22, development of the CPD continues with a focus on external users and meeting their requirements. A batch upload capability, training and curation procedures, user interviews, and a demonstration of the CPD's utility in accelerating catalyst research are planned. Overall, the Data Hub project and CPD aim to reduce the time and cost of catalyst research by harnessing the power of data in catalyst discovery.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

A survey of techniques for optimizing transformer inference

Recent years have seen a phenomenal rise in the performance and applications of transformer neural networks. The family of transformer networks, including Bidirectional Encoder Representations from Transformer (BERT), Generative Pretrained Transformer (GPT) and Vision Transformer (ViT), have shown their effectiveness across Natural Language Processing (NLP) and Computer Vision (CV) domains. Transformer-based networks such as ChatGPT have impacted the lives of common men. However, the quest for high predictive performance has led to an exponential increase in transformers' memory and compute footprint. Researchers have proposed techniques to optimize transformer inference at all levels of abstraction. Further, this paper presents a comprehensive survey of techniques for optimizing the inference phase of transformer networks. We survey techniques such as knowledge distillation, pruning, quantization, neural architecture search and lightweight network design at the algorithmic level. We further review hardware-level optimization techniques and the design of novel hardware accelerators for transformers. We summarize the quantitative results on the number of parameters/FLOPs and the accuracy of several models/techniques to showcase the tradeoff exercised by them. We also outline future directions in this rapidly evolving field of research. We believe that this survey will educate both novice and seasoned researchers and also spark a plethora of research efforts in this field.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Low synchronization Gram–Schmidt and generalized minimal residual algorithms

The Gram–Schmidt process uses orthogonal projection to construct the A = QR factorization of a matrix. When Q has linearly independent columns, the operator P = I - Q(QTQ)-1QT defines an orthogonal projection onto Q⊥. In finite precision, Q loses orthogonality as the factorization progresses. A family of approximate projections is derived with the form P = I - QTQT, with correction matrix T. When T = (QTQ)-1, and T is triangular, it is postulated that the best achievable orthogonality is $\mathcal{O}(ε)\mathcal{K}(A)$. We present new variants of modified (MGS) and classical Gram–Schmidt algorithms that require one global reduction step. An interesting form of the projector leads to a compact WY representation for MGS. In particular, the inverse compact WY MGS algorithm is equivalent to a lower triangular solve. Our main contribution is to introduce a backward normalization lag into the compact WY representation, resulting in a $\mathcal{O}(ε)\mathcal{K}[r_0, AV_m])$ stable Generalized Minimal Residual Method (GMRES) algorithm that requires only one global reduce per iteration. Finally, further improvements in performance are achieved by accelerating GMRES on GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

pycalceff

A Python project for calculating (binomial) efficiencies and their uncertainties. The mathematical theory and derivation of the formulas can be found in FERMILAB-TM-2286-CD. If you use this software for published work, please cite this note. The default algorithm for finding the shortest interval is based on Hyndman, R. J. (1996). Computing and graphing highest density regions, The American Statistician, 50(2), 120-126.

Paterno, Marc [Fermi National Accelerator Laborato↗
DOE OSTI2021

Optimizing and Extending the Functionality of EXARL for Scalable Reinforcement Learning [Slides]

The main goal of the Co-Design Summer School 2021 is to provide algorithmic improvements to EXARL framework by improving performance and by adding functionalities. This presentation includes an introduction to reinforcement learning and to EXARL. The researchers expanded the capability of EXARL by including additional agents like (Asynchronized) Advantage Actor Critic (A2C/A3C) and Twin Delayed Deep Deterministic Policy Gradient (TD3). They also explored algorithmic improvements such as v-trace and Prioritized Experience Replay. They found that A2C/A3C performed best with v-trace and outperformed Deep Q-Network (DQN) on both the CartPole game and the ExaBooster scientific environment. Additionally, they found that TD3 performed as good as the existing Deep Deterministic Policy Gradient (DDPG) agent and that adding Prioritized Experience Replay to DDPG accelerated convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Strong Coupling of Hydrodynamics and Reactions in Nuclear Statistical Equilibrium for Modeling Convection in Massive Stars

We build on the simplified spectral deferred corrections (SDC) coupling of hydrodynamics and reactions to handle the case of nuclear statistical equilibrium (NSE) and electron/positron captures/decays in the cores of massive stars. Our approach blends a traditional reaction network on the grid with a tabulated NSE state from a very large, ${\mathcal O }(100)$ nuclei network. We demonstrate how to achieve second-order accuracy in the simplified-SDC framework when coupling NSE to hydrodynamics, with the ability to evolve the star on the hydrodynamics time step. We discuss the application of this method to convection in massive stars leading up to core collapse. We also show how to initialize the initial convective state from a 1D model in a self-consistent fashion. All of these developments are done in the publicly available Castro simulation code and the entire simulation methodology is fully GPU-accelerated.

Explosive nucleosynthesis↗
DOE OSTI2025

Developing machine learning for heterogeneous catalysis with experimental and computational data

Machine learning techniques have emerged as a useful tool for identifying complex patterns and correlations in large datasets, such as associating catalyst performance to its physicochemical properties. In the heterogeneous catalysis communities, machine learning models have mostly been developed using high-throughput quantum chemistry calculations, with only a few case studies resulting in experimentally validated catalyst improvements. This limited success may be due to the use of simplified catalyst structures in computational studies and the lack of comprehensive experimental datasets. In this Review, we bring together studies integrating high-throughput approaches and machine learning for the advancement of solid heterogeneous catalysis, leveraging both experimental and computational data. We systematically analyze trends in the field, based on the descriptors used as model input and output; the materials, devices, or reactions investigated; the dataset size; and the overall achievements. Furthermore, for models reporting unitless R 2 values, we compare the performances based on these mentioned trends.

Computational chemistry↗
DOE OSTI2026

Two-Level Sketching Alternating Anderson Acceleration for Complex Physics Applications

We present a novel two-level sketching extension of the Alternating Anderson–Picard (AAP) method for accelerating fixed-point iterations in challenging single- and multiphysics simulations governed by discretized PDEs. Our approach combines a static, physics-based projection that reduces the least-squares (LS) problem to the most informative field (e.g., via Schur-complement insight) with a dynamic, algebraic sketching stage driven by a backward stability analysis under Lipschitz continuity. We introduce inexpensive estimators for stability thresholds and cache-aware randomized selection strategies to balance computational cost against memory access overhead. The resulting algorithm solves reduced LS systems in place, minimizes memory footprints, and seamlessly alternates between low-cost Picard updates and Anderson mixing. Implemented in Julia, our two-level sketching AAP achieves up to 50% time-to-solution reductions compared to standard Anderson acceleration—without degrading convergence rates—on benchmark problems including Stokes, 𝑝-Laplacian, bidomain, and Navier–Stokes formulations at varying problem sizes. These results demonstrate the method’s robustness, scalability, and potential for integration into high-performance scientific computing frameworks. Our implementation is available open source in the AAP.jl library.

Barnafi, Nicolas [University of Chile, Santiago]↗
DOE OSTI2023

A simple, flexible technique for RF cavity wake-field calculations

It is typical in the accelerator field to model machine components, especially RF cavities, as parallel RLC resonators. In the interest of simulating and diagnosing beam instabilities, knowledge of the time-domain voltage waveform over an equivalent resonator by a bunch current often proves useful. This waveform may be found by convolving the bunch current with the RLC resonator impulse response. While analytical and quasi-analytical expressions are available in this regime for common distributions such as the Gaussian, analogous results for less standard distributions are difficult to obtain using direct methods, which opens the door for the development of a more generalized technique. In this paper, a formulation is created that allows for the simple computation of the time-domain voltage waveform of and RLC resonator. The formulation uses the Cauchy Residue Theorem to extract the convolution result from the Fourier Domain, and it only requires that the current distribution Fourier Transform be holomorphic and known at one specific evaluation point. This greatly simplifies the computation of the time domain voltage for a large amount of bunch distributions both common and uncommon.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

HTESP (High-throughput electronic structure package): A package for high-throughput ab initio calculations

High-throughput ab initio calculations are the indispensable parts of data-driven discovery of new materials with desirable properties, as reflected in the establishment of several online material databases. The accumulation of extensive theoretical data through computations enables data-driven discovery by constructing machine learning and artificial intelligence models to predict novel compounds and forecast their properties. Efficient usage and extraction of data from these existing online material databases can accelerate the next stage materials discovery that targets different and more advanced properties, such as electron–phonon coupling for phonon-mediated superconductivity. However, extracting data from these databases, generating tailored input files for different ab initio calculations, performing such calculations, and analyzing new results can be demanding tasks. Here, in this work, we introduce a software package named “HTESP” (High-Throughput Electronic Structure Package) written in Python and Bash languages, which automates the entire workflow including data extraction, input file generation, calculation submission, result collection and plotting. Our HTESP will help speed up future computational materials discovery processes.

36 MATERIALS SCIENCE↗
DOE OSTI2022

HPC Molecular Simulation Tries Out a New GPU: Experiences on Early AMD Test Systems for the Frontier Supercomputer

Molecular simulation is an important tool for nu- merous efforts in physics, chemistry, and the biological sciences. Simulating molecular dynamics requires extremely rapid cal- culations to enable sufficient sampling of simulated temporal molecular processes. The Hewlett Packard Enterprise (HPE) Cray EX Frontier supercomputer installed at the Oak Ridge Leadership Computing Facility (OLCF) will provide an exascale resource for open science, and will feature graphics processing units (GPUs) from Advanced Micro Devices (AMD). The future LUMI supercomputer in Finland will be based on an HPE Cray EX platform as well. Here we test the ports of several widely used molecular dynamics packages that have each made substantial use of acceleration with NVIDIA GPUs, on Spock, the early Cray pre-Frontier testbed system at the OLCF which employs AMD GPUs. These programs are used extensively in industry for pharmaceutical and materials research, as well as academia, and are also frequently deployed on high-performance computing (HPC) systems, including national leadership HPC resources. We find that in general, performance is competitive and installation is straightforward, even at these early stages in a new GPU ecosystem. Our experiences point to an expanding arena for GPU vendors in HPC for molecular simulation.

Sedova, Ada↗
DOE OSTI2024

Implications of stop-and-go traffic on training learning-based car-following control

Learning-based car-following control (LCC) of connected and autonomous vehicles (CAVs) is gaining significant attention with the advancement of computing power and data accessibility. While the flexibility and large model capacity of model-free architecture enable LCC to potentially outperform the model-based car-following (CF) model in improving traffic efficiency and mitigating congestion, the generalizability of LCC for traffic conditions different from the training environment/dataset is not well-understood. Herein, this study seeks to explore the impact of stop-and-go traffic in the training dataset on the generalizability of LCC. It uses the characteristics of lead vehicle trajectories to describe stop-and-go traffic, and links the theory of identifiability (i.e., obtaining a unique parameter estimation result using sensor measurements) to the generalizability of behavior cloning (BC) and policy-based deep reinforcement learning (DRL). Correspondingly, the study shows theoretically that: (i) stop-and-go traffic can enable the property of identifiability and enhance the control performance of BC-based LCC in different traffic conditions; (ii) stop-and-go traffic is not necessary for DRL-based LCC to generalize to different traffic conditions; (iii) DRL-based LCC trained with only constant-speed lead vehicle trajectories (not sufficient to ensure identifiability) can be generalized to different traffic conditions; and (iv) stop-and-go traffic increases variance in the training dataset, which improves the convergence of parameter estimation while negatively impacting the convergence of DRL to the optimal control policy. Numerical experiments validate the above findings, illustrating that BC-based LCC entails comprehensive training datasets for generalizing to different traffic conditions, while DRL-based LCC can achieve generalization with simple free-flow traffic training environments. This further suggests DRL as a more promising and cost-effective LCC approach to reduce operational costs, mitigate traffic congestion, and enhance safety and mobility, which can accelerate the deployment and acceptance of CAVs.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2022

Accelerated steady-state electrostatic particle-in-cell simulation of Langmuir probes

First-principles particle-in-cell (PIC) simulation is a powerful tool for understanding plasma behavior, but this power often comes at great computational expense. Artificially reducing the ion/electron mass ratio is a time-honored practice to reduce simulation costs. Usually, this is a severe approximation. However, for steady-state collisionless, electrostatic (Vlasov–Poisson) systems, the solution with reduced mass ratio can be scaled to the solution for the real mass ratio, with no approximation. This “scaled mass” method, which works with already-existing PIC codes, can reduce the computation time for a large class of electrostatic PIC simulations by the square root of the mass ratio. The particle distributions of the resulting steady state must be trivially rescaled to yield the true distributions, but the self-consistent electrostatic field is independent of the mass ratio. This method is equivalent to “numerical timestepping,” an approach that evolves electron and ion populations with different time steps. Numerical timestepping can be viewed as a special case of the speed-limited PIC (SLPIC) method, which is not restricted to steady-state phenomena. Although the scaled-mass approach is simplest, numerical timestepping and SLPIC more easily generalize to include other effects, such as collisions. The equivalence of these new approaches is demonstrated by applying them to simulate a cylindrical Langmuir probe in electron–argon plasma, speeding up simulation by two orders of magnitude. Methods such as SLPIC can therefore play an invaluable role in interpreting probe measurements by including geometric effects, collisions, secondary emission, and non-Maxwellian distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Nitrogen‐Nitrogen Bond Breaking in Irradiation Products of Hexanitrohexaazaisowurtzitane (CL‐20)

While the primary result of an interaction of ionizing radiation with an organic material is the ejection of electrons from molecular orbitals producing cations, the free electrons can further interact, yielding excited states; and, potentially, anions. In this work, we computed reaction barriers and energies for N−N bond breaking in the CL-20 cation, anion, and excited state to investigate if CL-20 degradation is accelerated after radiation exposure. We focused on N−N bond dissociation because it is the rate-determining step in the thermal degradation of CL-20. We found that N−N cleavage rapidly takes place in the CL-20 cation and anion with greatly reduced reaction energies as compared to CL-20. We also outlined a potential path for photodissociation of the N−N bond. While CL-20 is kinetically stable, initial degradation occurs readily in its irradiation products. In conclusion, this is of importance for the performance of the explosive after high-dose exposure and influences aging if CL-20 is irradiated at a low dose over extended periods of time.

CL-20 anion↗
DOE OSTI2024

Hutchinson Trace Estimation for high-dimensional and high-order Physics-Informed Neural Networks

Physics-Informed Neural Networks (PINNs) have proven effective in solving partial differential equations (PDEs), especially when some data are available by seamlessly blending data and physics. However, extending PINNs to high-dimensional and even high-order PDEs encounters significant challenges due to the computational cost associated with automatic differentiation in the residual loss function calculation. Herein, we address the limitations of PINNs in handling high-dimensional and high-order PDEs by introducing the Hutchinson Trace Estimation (HTE) method. Starting with the second-order high-dimensional PDEs, which are ubiquitous in scientific computing, HTE is applied to transform the calculation of the entire Hessian matrix into a Hessian vector product (HVP). This approach not only alleviates the computational bottleneck via Taylor-mode automatic differentiation but also significantly reduces memory consumption from the Hessian matrix to an HVP’s scalar output. We further showcase HTE’s convergence to the original PINN loss and its unbiased behavior under specific conditions. Comparisons with the Stochastic Dimension Gradient Descent (SDGD) highlight the distinct advantages of HTE, particularly in scenarios with significant variability and variance among dimensions. We further extend the application of HTE to higher-order and higher-dimensional PDEs, specifically addressing the biharmonic equation. By employing tensor-vector products (TVP), HTE efficiently computes the colossal tensor associated with the fourth-order high-dimensional biharmonic equation, saving memory and enabling rapid computation. The effectiveness of HTE is illustrated through experimental setups, demonstrating comparable convergence rates with SDGD under memory and speed constraints. Additionally, HTE proves valuable in accelerating the Gradient-Enhanced PINN (gPINN) version as well as the Biharmonic equation. Overall, HTE opens up a new capability in scientific machine learning for tackling high-order and high-dimensional PDEs.

Curse of dimensionality↗
DOE OSTI2019

Tuning Catalytic Bias of Hydrogen Gas Producing Hydrogenases

Hydrogenases show a wide range of catalytic rates and biases in reversible hydrogen gas oxidation catalysis. The interactions of the iron-sulfur-containing catalytic site with the local protein environment are thought to contribute to differences in catalytic reactivity, but this has not been demonstrated. The microbe Clostridium pasteurianum produces three [FeFe]-hydrogenases that differ in 'catalytic bias' by exerting a disproportionate rate acceleration in one direction or the other that spans a remarkable 6 orders of magnitude. The combination of high-resolution structural work, biochemical analyses, and computational modeling indicates that protein secondary interactions directly influence the relative stabilization/destabilization of different oxidation states of the active site metal cluster. This selective stabilization or destabilization of oxidation states can preferentially promote hydrogen oxidation or proton reduction and represents a simple yet elegant model by which a protein catalytic site can confer catalytic bias.

08 HYDROGEN↗
DOE OSTI2022

A Length Adaptive Algorithm-Hardware Co-design of Transformer on FPGA Through Sparse Attention and Dynamic Pipelining

Transformers are considered one of the most important deep learning models since 2018, in part because it establishes state-of-the-art (SOTA) records and could potentially replace existing Deep Neural Networks (DNNs). Despite the remarkable triumphs, the prolonged turnaround time of Transformer models is a widely recognized roadblock. The variety of sequence lengths imposes additional computing overhead where inputs need to be zero-padded to the maximum sentence length in the batch to accommodate the parallel computing platforms. This paper targets the field-programmable gate array (FPGA) and proposes a coherent sequence length adaptive algorithm–hardware co-design for Transformer acceleration. Particularly, we develop a hardware-friendly sparse attention operator and a length-aware hardware resource scheduling algorithm. The proposed sparse attention operator brings the complexity of attention-based models down to linear complexity and alleviates the off-chip memory traffic. The proposed length-aware resource hardware scheduling algorithm dynamically allocates the hardware resources to fill up the pipeline slots and eliminates bubbles for NLP tasks. Experiments show that our design has very small accuracy loss and has 80.2 × and 2.6 × speedup compared to CPU and GPU implementation, and 4 × higher energy efficiency than state-of-the-art GPU accelerator optimized via CUBLAS GEMM.

Peng, Hongwu↗
DOE OSTI2023

optimas v0.1

optimas is a Python library that can coordinate a large number of numerical simulations on high-performance computing resources, with the aim of optimizing a given simulation result. More specifically, this library is currently used for design optimization of laser-plasma particle accelerators. In this context, the performance of particle accelerator designs are often evaluated with large-scale simulation codes, and many separate simulations need to be run - with different design parameters - in order to find the most performant design. optimas facilitates this process by providing a convenient interface to advanced optimizers (e.g. Bayesian optimization), and by coordinating the execution of the different simulations on HPC resources. (This is done by leveraging the library libensemble.) Compared to other open-source optimization libraries (e.g. Ax), optimas is more tailored towards execution on DOE HPC resources (e.g. Perlmutter, Summit, etc.) and is specialized for the type of simulation codes and workflows that are used in the community of laser-plasma acceleration.

Lehe, Remi↗