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,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Study of fully coupled three-dimensional envelope instability using automatic differentiation

Automatic differentiation is a powerful tool for computing derivatives of simulation results with respect to given parameters. In this Letter, we have applied this tool to investigate the instability of a dynamical system governed by 21 ordinary differential equations. This second-order instability (named envelope instability) is driven by space-charge effects and has a significant impact on the operational regimes of particle accelerators. Our study delves into the three-dimensional envelope instability, incorporating both transverse and longitudinal coupling. Conventionally, analyzing this complex system would necessitate solving 441 ordinary differential equations, which is computationally intractable. However, by employing automatic differentiation, we were able to track only 21 equations. This approach allowed us to uncover an additional instability stopband, which arises from space-charge-induced coupling and has not been reported in previous studies. This research highlights the significant advantages of automatic differentiation in analyzing complicated dynamical systems involving a large number of ordinary differential equations.

Qiang, Ji [Lawrence Berkeley National Laboratory (↗
DOE OSTI2020

Multigrid Optimization for Large-Scale Ptychographic Phase Retrieval

Ptychography is a popular imaging technique that combines diffractive imaging with scanning microscopy. The technique consists of a coherent beam that is scanned across an object in a series of overlapping positions, leading to reliable and improved reconstructions. Ptychographic microscopes allow for large fields to be imaged at high resolution at the cost of additional computational expense. Herein, we propose a multigrid-based optimization framework to reduce the computational burdens of large-scale ptychographic phase retrieval. Our proposed method exploits the inherent hierarchical structures in ptychography through tailored restriction and prolongation operators for the object and data domains. Our numerical results show that our proposed scheme accelerates the convergence of its underlying solver and outperforms the ptychographical iterative engine, a workhorse in the optics community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Pass-efficient methods for compression of high-dimensional turbulent flow data

The future of high-performance computing, specifically on future Exascale computers, will presumably see memory capacity and bandwidth fail to keep pace with data generated, for instance, from massively parallel partial differential equation (PDE) systems. Current strategies proposed to address this bottleneck entail the omission of large fractions of data, as well as the incorporation of in situ compression algorithms to avoid overuse of memory. To ensure that post-processing operations are successful, this must be done in a way that a sufficiently accurate representation of the solution is stored. Moreover, in situations where the input/output system becomes a bottleneck in analysis, visualization, etc., or the execution of the PDE solver is expensive, the number of passes made over the data must be minimized. In the interest of addressing this problem, this work focuses on the utility of pass-efficient, parallelizable, low-rank, matrix decomposition methods in compressing high-dimensional simulation data from turbulent flows. Additionally, a particular emphasis is placed on using coarse representation of the data – compatible with the PDE discretization grid – to accelerate the construction of the low-rank factorization. This includes the presentation of a novel single-pass matrix decomposition algorithm for computing the so-called interpolative decomposition. The methods are described extensively and numerical experiments on two turbulent channel flow data are performed. In the first (unladen) channel flow case, compression factors exceeding 400 are achieved while maintaining accuracy with respect to first- and second-order flow statistics. In the particle-laden case, compression factors of 100 are achieved and the compressed data is used to recover particle velocities. These results show that these compression methods can enable efficient computation of various quantities of interest in both the carrier and disperse phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Ultra-Fast Non-Volatile Resistive Switching Devices with Over 512 Distinct and Stable Levels for Memory and Neuromorphic Computing

Low-current multilevel programmability with inherent non-volatility and high stability of resistance states is required for both multi-bit memory storage and deep learning accelerators but is difficult to achieve. Here, in a resistive switching system, this work realizes >512 (>9 bits) distinct non-volatile conductance levels with stable retention for each state with current levels down to the nanoampere range, highly promising for potential integration with small processing nodes with ultra-low power consumption requirements. This is achieved by demonstrating a new thin film design concept that encompasses three key features: an ultra-thin epitaxial oxygen ionic switching layer that provides a tunable energy barrier at the bottom electrode, an overcoat amorphous layer that acts as an ion migration barrier for stable state retention, and a partial conductive filament as a localized electronic transport channel to the epitaxial switching layer. A large dynamic resistance range of up to seven orders of magnitude is achieved with reset-free transitions among intermediate states, and programmability is demonstrated with ultra-fast (20 ns) pulses. Artificial neural network (ANN) simulations, based on the experimental performance and its non-idealities, demonstrate close-to-ideal inference accuracies for various Modified National Institute of Standards and Technology (MNIST) data sets.

36 MATERIALS SCIENCE↗
DOE OSTI2020

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗
DOE OSTI2024

Description of FY25 Theory and Simulation Performance Target: Development of an integrated modeling framework for fusion reactor design and assessment

The urgency to deliver fusion power is growing now more than ever, with increasing pressure for both public programs and private companies to meet milestones timelines and overcome significant remaining technical challenges to ensure growth of a nascent fusion industry in time to meet rapidly growing clean energy demands. With incredible advancements in computation and years of investment in fusion model development and validation, integrated modeling is poised to fill a key role in accelerating the timeline to a fusion pilot plant (FPP). Future fusion pilot plants will operate in regimes far beyond current experience, and device design will rely on physics-based prediction and extrapolation. Many concepts will also rely on simulation to assess safety (shielding, tritium management, materials activation and lifetimes), economics and scalability before the decision to build. Importantly, integrated simulation can be used to reveal and solve the complexities of system integration that may otherwise not be apparent in physical components or models developed in isolation. New experimental test facilities that produce relevant conditions to validate and resolve key technical challenges for various subsystems (materials, blankets, fuel cycle, etc.) have been repeatedly called for by the fusion community but are not yet realized. Integrated modeling has an important role in identifying realistic load conditions (thermal, electromagnetic, plasma, neutron and photon loads, etc.) and defining the components and experiments for these test facilities in order to ensure meaningful validation that sufficiently reduces modeling uncertainties and technical risk for the full integrated reactor. The Fusion REactor Design and Assessment (FREDA) SciDAC project is building a component-based integrated modeling framework & data structure to enable self-consistent, multi-fidelity, iterative optimization workflows for the fusion reactor design process. FREDA aims to shorten the time to viable designs by providing a set of flexible workflows to support the various stages of the design process using an integrated model hierarchy, ranging from the simple analytic descriptions to the highest fidelity, theory-based plasma and engineering modeling developed by the fusion and fission communities. These tools are expected to be needed for timely support of FPP design in the milestone program and in the FIRE collaboratives. The plasma simulation backbone of FREDA is IPS-FASTRAN with newly developed coupled Core-Edge Pedestal-SOL (CESOL) workflows, which is being extended to the far-SOL region up to the plasma facing components. FREDA incorporates the FERMI engineering modeling suite and will enable self-consistent evaluation of the thermal shields, limiters, blanket, magnets, and other surrounding structures with predictions of temperatures, erosion, dpa, activation, tritium generation and transport, creep, corrosion, material degradation, etc. Parametric generation of 3D CAD enables rapid iteration of component geometry in response to plasma and loading specifications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Towards Predictive Plasma Science and Engineering through Revolutionary Multi-Scale Algorithms and Models (Final Report)

This report describes the high-level accomplishments from the Plasma Science and Engineering Grand Challenge LDRD at Sandia National Laboratories. The Laboratory has a need to demonstrate predictive capabilities to model plasma phenomena in order to rapidly accelerate engineering development in several mission areas. The purpose of this Grand Challenge LDRD was to advance the fundamental models, methods, and algorithms along with supporting electrode science foundation to enable a revolutionary shift towards predictive plasma engineering design principles. This project integrated the SNL knowledge base in computer science, plasma physics, materials science, applied mathematics, and relevant application engineering to establish new cross-laboratory collaborations on these topics. As an initial exemplar, this project focused efforts on improving multi-scale modeling capabilities that are utilized to predict the electrical power delivery on large-scale pulsed power accelerators. Specifically, this LDRD was structured into three primary research thrusts that, when integrated, enable complex simulations of these devices: (1) the exploration of multi-scale models describing the desorption of contaminants from pulsed power electrodes, (2) the development of improved algorithms and code technologies to treat the multi-physics phenomena required to predict device performance, and (3) the creation of a rigorous verification and validation infrastructure to evaluate the codes and models across a range of challenge problems. These components were integrated into initial demonstrations of the largest simulations of multi-level vacuum power flow completed to-date, executed on the leading HPC computing machines available in the NNSA complex today. These preliminary studies indicate relevant pulsed power engineering design simulations can now be completed in (of order) several days, a significant improvement over pre-LDRD levels of performance.

42 ENGINEERING↗
DOE OSTI2023

FLASH: FPGA-Accelerated Smart Switches with GCN Case Study

Some communication switches, e.g., the Mellanox SHArP and those in the IBM BlueGene clusters, are augmented to process packets at the application level with fixed-function collectives. This approach, however, lacks flexibility, which limits their applicability in diverse and dynamic workloads. Recently, a new type of programmable packet processor, which uses high-level languages, e.g., P4, has emerged as possible candidates. P4-based switches, however, fall short in certain applications, including machine learning, where capabilities not currently supported by P4 are needed. These include more complex calculation, such as sparse computation and fused multiply-accumulate, data-intensive floating point operations, data reuse, and significant memory. The problem addressed here is that such a switch augmentation needs to support: a large amount of state, significant flexible compute capability, and ease of programming, all while maintaining full functionality, including ensuring high throughput, and demonstrating utility. In this work, we propose a programmable look-aside-type accelerator that can be embedded into, or attached to, existing communication switch pipelines and that is capable of processing packets at line-rate. The proposed in-switch accelerator is based on mixing an ISA (subset of RISC-V instructions) with dataflow graphs (found in CGRAs). To augment performance, vector instructions are also supported. To facilitate usability, we have developed a complete toolchain to compile user-provided C/C++ codes to appropriate back-end instructions for configuring the accelerator. While this approach is flexible enough to support various workloads, in this paper, we consider Graph Convolutional Networks (GCNs) as a case study. Experimental results show that this approach considerably improves the performance of distributed GCN applications.

Haghi, Pouya↗
DOE OSTI2023

DGaaS: GPU as a Service on Distributed Computing System

In the rapidly evolving landscape of scientific computing, Graphics Processing Units (GPUs) have become indispensable for their unparalleled ability to handle parallel tasks in complex calculations, simulations, and data analysis. Their utility is further magnified in machine learning and AI applications, where they significantly accelerate model training and predictive analytics. Within this context, the Triton Inference Server emerges as a pivotal open-source tool, specializing in AI inferencing and optimizing GPU utilization across various platforms and frameworks. This paper presents an in-depth study on distributed High Throughput Computing (HTC), specifically focusing on the HTCondor framework and its resource provisioning tools, GlideinWMS and HEPCloud. These systems enable large-scale scientific experiments like CMS and DUNE to efficiently access and utilize vast computational resources. The paper explores the core architectural components of GlideinWMS, including jobs, user pools, and worker nodes, and discusses their integration with GPUs and the Triton server. The primary aim of this research is to develop a solution that optimizes GPU utilization by leveraging Glideins and containers. This approach allows computational jobs, particularly those involving AI models, to use GPUs only when essential, thereby facilitating efficient sharing of limited GPU resources. To validate this architecture, the study conducted three key tests involving custom scripts, container-based servers, and Triton server deployments. However, the study faces challenges, notably in locating the Triton server and ensuring secure remote access. To address these issues, future work will focus on developing a proxy mechanism and enhancing security protocols. In conclusion, this study offers a comprehensive roadmap for effective and efficient GPU utilization in distributed High Throughput Computing. It aims to contribute significantly to the scientific community by solving pressing problems and implementing robust solutions in collaboration with the GlideinWMS and HEPCloud teams. The research sets the stage for a more efficient, scalable, and cost-effective paradigm in scientific computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

GPU acceleration of Swendsen–Wang dynamics

When simulating a lattice system near its critical temperature, local algorithms for modeling the system’s evolution can introduce very large autocorrelation times into sampled data. Here, this critical slowing down places restrictions on the analysis that can be completed in a timely manner of the behavior of systems around the critical point. Because it is often desirable to study such systems around this point, a new algorithm must be introduced. Therefore, we turn to cluster algorithms, such as the Swendsen–Wang algorithm and the Wolff clustering algorithm. They incorporate global updates which generate new lattice configurations with little correlation to previous states, even near the critical point. We look to accelerate the rate at which these algorithm are capable of running by implementing and benchmarking a parallel implementation of each algorithm designed to run on GPUs under NVIDIA’s CUDA framework. A 17 and 90 fold increase in the computational rate was, respectively, experienced when measured against the equivalent algorithm implemented in serial code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Parton physics from a heavy-quark operator product expansion: Lattice QCD calculation of the fourth moment of the pion distribution amplitude

The pion light-cone distribution amplitude (LCDA) is an essential nonperturbative input for a range of high-energy exclusive processes in quantum chromodynamics. Building on our previous work, the continuum limit of the fourth Mellin moment of the pion LCDA is determined in quenched QCD using quark masses which correspond to a pion mass of 𝑚 𝜋 = 550 MeV. This calculation finds ⟨𝜉 2 ⟩ = 0.202⁢(8)⁢(9) and ⟨𝜉 4 ⟩ = 0.039⁢(28)⁢(11) where the first error indicates the combined statistical and systematic uncertainty from the analysis and the second indicates the uncertainty from working with Wilson coefficients computed to next-to-leading order. These results are presented in the $\overline{\textrm{MS}}$ scheme at a renormalization scale of 𝜇 = 2 GeV.

Detmold, William [Massachusetts Inst. of Technolog↗
DOE OSTI2025

Real time computations of cryogenic He properties

The Fermilab PIP-II (proton improvement plan - II) project is being constructed at Fermilab to deliver $800\,MeV$ protons of $>1\,MW$ beam power to replace the present LINAC and provide protons to the remainder of the existing accelerator complex. The new LINAC consists of a warm front end, 23 superconducting RF cryomodules, and a beam transfer line to the existing complex. The cryomodules (CMs) are to be tested at Fermilab's CryoModule Test Facility (CMTF).An important measurement in cryogenic testing is the heat load of each CM. Traditionally, at Fermilab, these measurements were made collecting archived data offline and analyzing it. The new control system for PIP-II is being developed with the EPICS (Experimental Physics and Industrial Control System) framework, which allows us to compute the heat load in real time using the HePak library.We are exploring other $He$ properties, such as flow, where flow meters are not available, which can also be calculated in real time and fed back to the cryogenics engineers.This paper details the real time heat load calculation and $He$ flow software developed for CM testing at CMTF, as well as the first results from the prototype HB650 CM. Future plans for 2-phase $LHe$ flow will also be outlined.

Hanlet, Pierrick [Fermilab]↗
DOE OSTI2025

Modeling laser-wakefield accelerators using the time-averaged ponderomotive approximation in a Lorentz boosted frame

Future, high-fidelity simulations of multi-GeV-class laser Wakefield accelerators (LWFAs) will need to model the propagation of high-intensity laser drivers over meter-scale plasmas with high spatial and temporal resolutions, thus requiring high amounts of computational resources. Various techniques have been devised over the years to reduce the computational cost of such simulations, including the time-averaged ponderomotive approximation, and the use of the Lorentz boosted frame technique. In this paper we discuss the combination of these two computational techniques, highlighting the resulting significant reduction in the computational cost of LWFA simulations and the limitations of this approach. The combination of the two techniques can potentially become essential for the modeling of a multi-TeV, LWFA-based collider.

Laser Wakefield Acceleration↗
DOE OSTI2024

Dynamic mode decomposition of nonequilibrium electron-phonon dynamics: accelerating the first-principles real-time Boltzmann equation

Abstract Nonequilibrium dynamics governed by electron–phonon ( e -ph) interactions plays a key role in electronic devices and spectroscopies and is central to understanding electronic excitations in materials. The real-time Boltzmann transport equation (rt-BTE) with collision processes computed from first principles can describe the coupled dynamics of electrons and atomic vibrations (phonons). Yet, a bottleneck of these simulations is the calculation of e –ph scattering integrals on dense momentum grids at each time step. Here we show a data-driven approach based on dynamic mode decomposition (DMD) that can accelerate the time propagation of the rt-BTE and identify dominant electronic processes. We apply this approach to two case studies, high-field charge transport and ultrafast excited electron relaxation. In both cases, simulating only a short time window of ~10% of the dynamics suffices to predict the dynamics from initial excitation to steady state using DMD extrapolation. Analysis of the momentum-space modes extracted from DMD sheds light on the microscopic mechanisms governing electron relaxation to a steady state or equilibrium. The combination of accuracy and efficiency makes our DMD-based method a valuable tool for investigating ultrafast dynamics in a wide range of materials.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Accelerating gradient descent and Adam via fractional gradients

Here we propose a class of novel fractional-order optimization algorithms. We define a fractional-order gradient via the Caputo fractional derivatives that generalizes integer-order gradient. We refer it to as the Caputo fractional-based gradient, and develop an efficient implementation to compute it. A general class of fractional-order optimization methods is then obtained by replacing integer-order gradients with the Caputo fractional-based gradients. To give concrete algorithms, we consider gradient descent (GD) and Adam, and extend them to the Caputo fractional GD (CfGD) and the Caputo fractional Adam (CfAdam). We demonstrate the superiority of CfGD and CfAdam on several large scale optimization problems that arise from scientific machine learning applications, such as ill-conditioned least squares problem on real-world data and the training of neural networks involving non-convex objective functions. Numerical examples show that both CfGD and CfAdam result in acceleration over GD and Adam, respectively. We also derive error bounds of CfGD for quadratic functions, which further indicate that CfGD could mitigate the dependence on the condition number in the rate of convergence and results in significant acceleration over GD.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Enabling Scientific Applications with Performance-Portability and High-Productivity for Multi-GPU Programming with JACC.Multi

This work bridges the gap between multi-GPU computing and high-productivity, performance-portable programming solutions. Our goal is to enhance scientific applications with a productive and portable solution—program once, deploy everywhere—for multi-GPU programming with no cost to programmability. To accomplish this, we implemented JACC.Multi, which is part of the Julia for ACCelerators (JACC) performance-portable framework. JACC. Multi is the only high-level, portable metaprogramming solution that targets multi-GPU environments and is integrated in a readily accessible programming language (e.g., Julia language). With transparent GPU-to-GPU communication, JACC. Multi is optimized for scientific application workloads and is portable for NVIDIA and AMD accelerators. For the evaluation, we use two modern multi-GPU systems: Hudson, which features two NVIDIA H100 Hopper GPUs per node, and Frontier, which features four AMD MI250X GPUs per node, each with two Graphics Compute Dies (GCDs) for a total of eight GCDs per node. Additionally, as part of the evaluation, we use JACC (one GPU), MPI+JACC, and JACC. Multi codes that implement well-known and widely used scientific algorithms/kernels such as the conjugate gradient algorithm and an explicit forward Euler solver that requires GPU-to-GPU communication. Overall, JACC. Multi codes achieve better performance than MPI+JACC codes and significant speedups over JACC (one GPU), with up to 1.9× on Hudson and 6× on Frontier.

Valero Lara, Pedro [ORNL] (ORCID:0000000214794310)↗