Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Accelerators, 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 793 records · Page 44

Generating clock signals for a cycle accurate, cycle reproducible FPGA based hardware accelerator

A method, system and computer program product are disclosed for generating clock signals for a cycle accurate FPGA based hardware accelerator used to simulate operations of a device-under-test (DUT). In one embodiment, the DUT includes multiple device clocks generating multiple device clock signals at multiple frequencies and at a defined frequency ratio; and the FPG hardware accelerator includes multiple accelerator clocks generating multiple accelerator clock signals to operate the FPGA hardware accelerator to simulate the operations of the DUT. In one embodiment, operations of the DUT are mapped to the FPGA hardware accelerator, and the accelerator clock signals are generated at multiple frequencies and at the defined frequency ratio of the frequencies of the multiple device clocks, to maintain cycle accuracy between the DUT and the FPGA hardware accelerator. In an embodiment, the FPGA hardware accelerator may be used to control the frequencies of the multiple device clocks.

Asaad, Sameh W.↗

Generating clock signals for a cycle accurate, cycle reproducible FPGA based hardware accelerator

A method, system and computer program product are disclosed for generating clock signals for a cycle accurate FPGA based hardware accelerator used to simulate operations of a device-under-test (DUT). In one embodiment, the DUT includes multiple device clocks generating multiple device clock signals at multiple frequencies and at a defined frequency ratio; and the FPG hardware accelerator includes multiple accelerator clocks generating multiple accelerator clock signals to operate the FPGA hardware accelerator to simulate the operations of the DUT. In one embodiment, operations of the DUT are mapped to the FPGA hardware accelerator, and the accelerator clock signals are generated at multiple frequencies and at the defined frequency ratio of the frequencies of the multiple device clocks, to maintain cycle accuracy between the DUT and the FPGA hardware accelerator. In an embodiment, the FPGA hardware accelerator may be used to control the frequencies of the multiple device clocks.

Asaad, Sameh W.↗

Understanding Portability of a High-Level Programming Model on Contemporary Heterogeneous Architectures

Accelerator-based heterogeneous computing is gaining momentum in the high-performance computing arena. However, the increased complexity of heterogeneous architectures demands more generic, high-level programming models. OpenACC is one such attempt to tackle this problem. Although the abstraction provided by OpenACC offers productivity, it raises questions concerning both functional and performance portability. In this article, the authors propose HeteroIR, a high-level, architecture-independent intermediate representation, to map high-level programming models, such as OpenACC, to heterogeneous architectures. They present a compiler approach that translates OpenACC programs into HeteroIR and accelerator kernels to obtain OpenACC functional portability. They then evaluate the performance portability obtained by OpenACC with their approach on 12 OpenACC programs on Nvidia CUDA, AMD GCN, and Intel Xeon Phi architectures. They study the effects of various compiler optimizations and OpenACC program settings on these architectures to provide insights into the achieved performance portability.

97 MATHEMATICS AND COMPUTING↗

FAIR Data and Interpretable AI Framework for Architectured Metamaterials

Our interdisciplinary effort successfully generated FAIR (Findable, Accessible, Interoperable, and Reusable) benchmark datasets for mechanical metamaterials while introducing a novel Artificial Intelligence (AI) framework known as Learning Refined Compositional Rules (LRCR). This framework was specifically designed to bridge the gap across varying computational length scales and extract the underlying physical mechanisms that connect a material's structural geometry to its bulk acoustic properties. Historically, the discovery of such structured materials relied heavily on human intuition or opaque, black-box optimization algorithms that were difficult to generalize. By combining interpretable machine learning techniques with rigorous experimental validation, this project established clear, generalizable design guidelines for tuning wave dispersion and controlling vibrations. Ultimately, the public availability of these structured datasets and algorithms will significantly reduce computational costs and accelerate the design of advanced multi-functional acoustic devices, offering broad societal impacts across fields like aerospace engineering, telecommunications, and biomedical implant design.

36 MATERIALS SCIENCE↗

A physics-constrained neural ordinary differential equations approach for robust learning of stiff chemical kinetics

The high computational cost associated with solving for detailed chemistry poses a significant challenge for predictive computational fluid dynamics (CFD) simulations of turbulent reacting flows. While deep learning techniques have been explored to develop faster surrogate models, they often fail to integrate reliably with CFD solvers. This instability arises because traditional deep learning approaches optimize for training error without ensuring compatibility with ordinary differential equation (ODE) solvers, resulting in accumulation of errors over time. Recently, neuralODE (NODE) based approaches have been shown to be a promising technique to emulate and accelerate detailed chemistry computations. Here, in the present work, we extend this NODE framework for stiff chemical kinetics by incorporating mass conservation constraints directly into the loss function during training. This ensures that the total mass as well as the individual elemental species masses are conserved in an a-posteriori manner. Proof-of-concept studies are performed with the novel physics-constrained NODE (PC-NODE) approach for homogeneous autoignition of hydrogen-air mixture over a range of composition and thermodynamic conditions. It is demonstrated that the PC-NODE framework not only improves the physical consistency of the resulting data-driven model with respect to mass conservation criteria, but also improves training efficiency. PC-NODE is shown to achieve 2–100× speedup relative to the hydrogen-air detailed chemical mechanism depending on the type of the ODE solver (implicit or explicit) used during autoregressive inference tests. Lastly, a-posteriori studies are performed wherein the trained PC-NODE model is coupled with a CFD solver. It is shown that higher accuracy is achieved with PC-NODE relative to the purely data-driven NODE approach. Moreover, PC-NODE also exhibits robustness and generalizability to unseen initial conditions from within (interpolative capability) as well as outside (extrapolative capability) the training regime.

computational combustion↗

Preliminary In-Flight Loads Analysis of In-Line Launch Vehicles using the VLOADS 1.4 Program

To calculate structural loads of in-line launch vehicles for preliminary design, a very useful computer program is VLOADS 1.4. This software may also be used to calculate structural loads for upper stages and planetary transfer vehicles. Launch vehicle inputs such as aerodynamic coefficients, mass properties, propellants, engine thrusts, and performance data are compiled and analyzed by VLOADS to produce distributed shear loads, bending moments, axial forces, and vehicle line loads as a function of X-station along the vehicle's length. Interface loads, if any, and translational accelerations are also computed. The major strength of the software is that it enables quick turnaround analysis of structural loads for launch vehicles during the preliminary design stage of its development. This represents a significant improvement over the alternative-the time-consuming, and expensive chore of developing finite element models. VLOADS was developed as a Visual BASIC macro in a Microsoft Excel 5.0 work book on a Macintosh. VLOADS has also been implemented on a PC computer using Microsoft Excel 7.0a for Windows 95. VLOADS was developed in 1996, and the current version was released to COSMIC, NASA's Software Technology Transfer Center, in 1997. The program is a copyrighted work with all copyright vested in NASA.

Graham, J. B.↗

Quantum magic and multipartite entanglement in the structure of nuclei

Motivated by the Gottesman-Knill theorem, we present a detailed study of the quantum complexity of p -shell and s d -shell nuclei. Valence-space nuclear shell-model wave functions generated by the code are mapped to qubit registers using the Jordan-Wigner mapping (12 qubits for the p shell and 24 qubits for the s d shell), from which measures of the many-body entanglement ( n -tangles) and magic (nonstabilizerness) are determined. While exact evaluations of these measures are possible for nuclei with a modest number of active nucleons, Monte Carlo simulations are required for the more complex nuclei. The broadly applicable Pauli-string I ̂ Z ̂ exact (PSIZe) Markov chain Monte Carlo (MCMC) technique is introduced to accelerate the evaluation of measures of magic in deformed nuclei (with hierarchical wave functions), by factors of ≈ 8 for some nuclei. Significant multinucleon entanglement is found in the s d shell, dominated by proton-neutron configurations, along with significant measures of magic. This is evident not only for the deformed states, but also for nuclei on the path to instability via regions of shape coexistence and level inversion. These results indicate that quantum-computing resources will accelerate precision simulations of such nuclei and beyond. Published by the American Physical Society 2025

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

In Situ Methods, Infrastructures, and Applications on High Performance Computing Platforms, a State-of-the-art (STAR) Report

The considerable interest in the high performance computing (HPC) community regarding analyzing and visualization data without first writing to disk, i.e., in situ processing, is due to several factors. First is an I/O cost savings, where data is analyzed /visualized while being generated, without first storing to a filesystem. Second is the potential for increased accuracy, where fine temporal sampling of transient analysis might expose some complex behavior missed in coarse temporal sampling. Third is the ability to use all available resources, CPU’s and accelerators, in the computation of analysis products. This STAR paper brings together researchers, developers and practitioners using in situ methods in extreme-scale HPC with the goal to present existing methods, infrastructures, and a range of computational science and engineering applications using in situ analysis and visualization.

97 MATHEMATICS AND COMPUTING↗

Synthesis of optimal adsorptive carbon capture processes.

Solid sorbent carbon capture systems have the potential to require significantly lower regeneration energy compared to aqueous monoethanol amine (MEA) systems. To date, the majority of work on solid sorbents has focused on developing the sorbent materials themselves. In order to advance these technologies, it is necessary to design systems that can exploit the full potential and unique characteristics of these materials. The Department of Energy (DOE) recently initiated the Carbon Capture Simulation Initiative (CCSI) to develop computational tools to accelerate the commercialization of carbon capture technology. Solid sorbents is the first Industry Challenge Problem considered under this initiative. An early goal of the initiative is to demonstrate a superstructure-based framework to synthesize an optimal solid sorbent carbon capture process. For a given solid sorbent, there are a number of potential reactors and reactor configurations consisting of various fluidized bed reactors, moving bed reactors, and fixed bed reactors. Detailed process models for these reactors have been modeled using Aspen Custom Modeler; however, such models are computationally intractable for large optimization-based process synthesis. Thus, in order to facilitate the use of these models for process synthesis, we have developed an approach for generating simple algebraic surrogate models that can be used in an optimization formulation. This presentation will describe the superstructure formulation which uses these surrogate models to choose among various process alternatives and will describe the resulting optimal process configuration.

97 MATHEMATICS AND COMPUTING↗

Modeling of Thermal Quench in Superconducting RF Cavities

Superconducting radio frequency (SRF) cavities are often limited by thermal quench, which is an excessive electromagnetic heating that occurs in the high magnetic field area and expands thereafter forcing the cavity to lose its superconducting state. In this paper, we demonstrate how the quench phenomena can be modeled using a coupled electromagnetic thermal analysis. The proposed model takes into account the nonlinearity of the material properties at cryogenic temperature and the effect of Kapitza resistance. The proposed approach is used to compute the thermal quench field of a 3.9 GHz 9-cell accelerating cavity, a 2.815 GHz deflecting cavity, and a 1.3GHz 9-cell accelerating cavity. Here, the computed values of quenchfield are in good agreement with the measured ones observedduring vertical testing at 2 K. Without loss of generality, theproposed methodology can be applied to other cavity geometries.

43 PARTICLE ACCELERATORS↗

Vehicle Transponder for Preemption of Traffic Lights

The purpose of this article is to describe, in more detail, the transponder installed in each vehicle that participates in the emergency traffic-light-preemption system described in the immediately preceding article. The transponder (see figure) is a fully autonomous data--collection, data-processing, information-display, and communication subsystem that performs robustly in preemption of traffic lights and monitoring of the statuses of street intersections. This transponder monitors the condition of the emergency vehicle in which it is installed and determines when the vehicle has been placed in an emergency-response condition with its siren and/or warning lights activated. Upon detection of such a condition, the transponder collects real-time velocity and acceleration data from the onboard diagnostic (OBD) computer of the vehicle. For this purpose, the transponder contains an OBD interface circuit, including a microprocessor that determines the manufacturer and model of the vehicle and then sends the appropriate commands to the OBD computer requesting the speed and acceleration data. At the same time, data from an onboard navigation system are collected to determine the location and the heading of the vehicle. Then acceleration, speed, position, and heading data are processed and combined with a vehicle-identification number and the resulting set of data is transmitted to monitoring and control units located at all intersections within communication range. When the unit at an intersection determines that this vehicle is approaching and has priority to preempt the intersection, it transmits a signal declaring the priority and the preemption to all participating vehicles (including this one) in the vicinity. If the unit at the intersection has determined that other participating vehicles are also approaching the intersection, then this unit also transmits, to the vehicle that has priority, a message that the other vehicles are approaching the same intersection. The texts of these messages, plus graphical symbols that show the directions and numbers of the approaching vehicles, are presented on the display panel of a computer that is part of the transponder.

Foster, Conrad↗

Performance analysis and acceleration of explicit integration for large kinetic networks using batched GPU computations

Abstract—We demonstrate the systematic implementation of recently-developed fast explicit kinetic integration algorithms that solve efficiently N coupled ordinary differential equations (subject to initial conditions) on modern GPUs. We take representative test cases (Type Ia supernova explosions) and demonstrate two or more orders of magnitude increase in efficiency for solving such systems (of realistic thermonuclear networks coupled to fluid dynamics). This implies that important coupled, multiphysics problems in various scientific and technical disciplines that were intractable, or could be simulated only with highly schematic kinetic networks, are now computationally feasible. As examples of such applications we present the computational techniques developed for our ongoing deployment of these new methods on modern GPU accelerators. We show that similarly to many other scientific applications, ranging from national security to medical advances, the computation can be split into many independent computational tasks, each of relatively small-size. As the size of each individual task does not provide sufficient parallelism for the underlying hardware, especially for accelerators, these tasks must be computed concurrently as a single routine, that we call batched routine, in order to saturate the hardware with enough work.

Haidar Ahmad, Azzam↗

Gravitational Acceleration as a Cue for Absolute Size and Distance

When an object's motion is influenced by gravity, such as the rise and fall of a thrown ball, the vertical component of acceleration is roughly constant at 9.8 m/sec2. In principle, an observer could use this information to estimate the absolute size and distance of the object (Saxberg, 1987a; Watson, Banks, von Hofsten, & Royden, 1992). In three experiments, we examined the ability to utilize the size and distance information provided by gravitational acceleration. Observers viewed computer simulations of an object rising and falling on a trajectory parallel to the gravitational vector. The simulated objects were three balls of different diameters presented across a wide range of simulated distances. Observers were asked to identify which ball was presented and the distance at which it was presented. The results of Experiment 1 showed that size and distance judgments were significantly better than chance, but not as accurate as expected if the information contained in the dynamics of free fall were used fully utilized. The results of Experiment 2 showed that acceleration information is used, but that observers can also make use of velocity information. Finally, the results of Experiment 3 showed that observers can use projected size information, but that their size and distance judgments are much more accurate when motion information is present as well. These results show that observers can use the information in the dynamics of free fall to estimate absolute size and distance, but their estimates are not as accurate as they could be if the information were used effectively.

Hecht, Heiko↗

Emerging Jets Search, Triton Server Deployment, and Track Quality Development: Machine Learning Applications in High Energy Physics

Machine learning is becoming prevalent in high energy physics, with numerous applications in physics analyses and event reconstruction showing great improvements compared to traditional computing methods. This thesis studies three projects which each propose new avenues for machine learning applications within the high energy physics CMS experiment located at CERN. In the first project, a search for a dark matter signal called “emerging jets” is performed, using graph neural networks to greatly increase sensitivity to the signal’s signature within the data. The result of this dark matter search sets the most stringent exclusion limits to date on theoretical emerging jet models. Motivated by inefficiencies encountered when processing the emerging jet graph neural network at Fermi National Accelerator Laboratory’s computing centers, the second project re-optimizes the computing centers for machine learning inference. This re-optimization uses NVIDIA Triton Inference Servers to process users’ analysis code heterogeneously, therefore achieving high processing throughput and decreasing user time-to-insight. The last project focuses on an upgrade to the CMS experiment’s real-time event selection system which improves physics object reconstruction under harsh processing conditions. A boosted decision tree is used to quickly and efficiently quantify a reconstructed particle’s “track quality” in order to remove particle tracks reconstructed erroneously. In summary, this thesis will not only present examples of how high energy physics can greatly benefit by leveraging machine learning techniques for physics analysis and reconstruction, but will also provide guidance on how the field can prepare for the inevitable increase in machine learning applications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Generating Smooth Motions For Robotic Manipulators

In improved method for generating trajectory of robotic manipulator, each straight-line segment of trajectory composed of constant-velocity main portion sandwiched between smooth acceleration at start and smooth deceleration at finish. Algorithm implementing method computes velocity in each accelerating portion as sinusoidal function of position along line. This motion chosen for two reasons: closely approximates motion of human hand along straight-line trajectory, and provides very smooth transitions between constant-velocity portion and accelerated and decelerational end portions.

Bejczy, Antal K.↗

The OME Framework for genome-scale systems biology

The life sciences are undergoing continuous and accelerating integration with computational and engineering sciences. The biology that many in the field have been trained on may be hardly recognizable in ten to twenty years. One of the major drivers for this transformation is the blistering pace of advancements in DNA sequencing and synthesis. These advances have resulted in unprecedented amounts of new data, information, and knowledge. Many software tools have been developed to deal with aspects of this transformation and each is sorely needed. However, few of these tools have been forced to deal with the full complexity of genome-scale models along with high throughput genome-scale data. This particular situation represents a unique challenge, as it is simultaneously necessary to deal with the vast breadth of genome-scale models and the dizzying depth of high-throughput datasets. It has been observed time and again that as the pace of data generation continues to accelerate, the pace of analysis significantly lags behind. It is also evident that, given the plethora of databases and software efforts, it is still a significant challenge to work with genome-scale metabolic models, let alone next-generation whole cell models. We work at the forefront of model creation and systems scale data generation. The OME Framework was borne out of a practical need to enable genome-scale modeling and data analysis under a unified framework to drive the next generation of genome-scale biological models. Here we present the OME Framework. It exists as a set of Python classes. However, we want to emphasize the importance of the underlying design as an addition to the discussions on specifications of a digital cell. A great deal of work and valuable progress has been made by a number of communities towards interchange formats and implementations designed to achieve similar goals. While many software tools exist for handling genome-scale metabolic models or for genome-scale data analysis, no implementations exist that explicitly handle data and models concurrently. The OME Framework structures data in a connected loop with models and the components those models are composed of. This results in the first full, practical implementation of a framework that can enable genome-scale design-build-test. Over the coming years many more software packages will be developed and tools will necessarily change. However, we hope that the underlying designs shared here can help to inform the design of future software.

59 BASIC BIOLOGICAL SCIENCES↗

Energy Efficient Biomolecular Simulations with FPGA-based Reconfigurable Computing

Reconfigurable computing (RC) is being investigated as a hardware solution for improving time-to-solution for biomolecular simulations. A number of popular molecular dynamics (MD) codes are used to study various aspects of biomolecules. These codes are now capable of simulating nanosecond time-scale trajectories per day on conventional microprocessor-based hardware, but biomolecular processes often occur at the microsecond time-scale or longer. A wide gap exists between the desired and achievable simulation capability; therefore, there is considerable interest in alternative algorithms and hardware for improving the time-to-solution of MD codes. The fine-grain parallelism provided by Field Programmable Gate Arrays (FPGA) combined with their low power consumption make them an attractive solution for improving the performance of MD simulations. In this work, we use an FPGA-based coprocessor to accelerate the compute-intensive calculations of LAMMPS, a popular MD code, achieving up to 5.5 fold speed-up on the non-bonded force computations of the particle mesh Ewald method and up to 2.2 fold speed-up in overall time-to-solution, and potentially an increase by a factor of 9 in power-performance efficiencies for the pair-wise computations. The results presented here provide an example of the multi-faceted benefits to an application in a heterogeneous computing environment.

99 GENERAL AND MISCELLANEOUS↗