Search NASA⌕ Search

SEARCH · Search NASA

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 757 records · Page 42

Investigation of Portable Event-Based Monte Carlo Transport Using the NVIDIA Thrust Library

Power consumption considerations are driving future high performance computing platforms toward many-core computing architectures. Los Alamos National Laboratory's Trinity machine, available in 2016, will use both Intel Xeon Haswell processors and Intel Xeon Phi Knights Landing many integrated core (MIC) architecture coprocessors. Lawrence Livermore National Laboratory's Sierra machine, available in 2018, will use an IBM PowerPC architecture along with Nvidia graphics processing unit (GPU) architecture accelerators. These different advanced architectures make the computing landscape in upcoming years complex. Traditional approaches to Monte Carlo transport do not work efficiently on these new computing platforms. MIC architectures require vectorization to operate efficiently, and vectorization is difficult to achieve in Monte Carlo transport. GPU architectures require additional code to explicitly use the hardware, requiring significant code changes or hardware specific branches in the source code. A significant challenge for Monte Carlo transport projects is to simultaneously support within a single source code base efficient simulations for both the current generation of architectures and the different advanced computing architectures. In order to address these challenges, two important changes are typically required: a new algorithmic approach for solving Monte Carlo transport, and explicit use of hardware specific software. In this paper, we describe initial research investigations of an event-based Monte Carlo transport algorithm implemented using the Nvidia Thrust library on a GPU for a Monte Carlo test code. The event-based algorithm targets many-core architectures by increasing SIMD (single instruction multiple data) parallelism, while Thrust potentially provides portable performance by allowing one source code base to compile code targeted for both CPUs and GPUs. We described preliminary investigations of portable event-based Monte Carlo algorithms implemented using the Nvidia Thrust library in a research Monte Carlo test code. We found that an explicit CUDA implementation of an event-based Monte Carlo algorithm performed significantly more efficiently than a Thrust implementation on GPU platforms, most likely as a result of additional flexibility in access to different memory spaces on the GPU. Additionally, we showed that on GPU platforms and at large enough problem sizes the event-based implementations perform more efficiently than the serial history-based implementation running on the host CPU. While investigating this problem, we also discovered that the performance of the event-based algorithm is affected by what tallies are being used. A zonal scalar flux tally requires atomic operations that significantly impacted the performance of the code, in some cases producing slowdowns instead of speedups. We decided to remove the tally in order to focus on the effectiveness of the event-based algorithm. Future work will be required to research more effective ways of handling such tallies. Additionally, we would like to consider new ways for optimizing both the Thrust and CUDA versions, in order to see how much performance we have yet to achieve. The potential trade-off between portability and performance was demonstrated in this investigation. Thrust provides both CPU and GPU versions of the code in one code base, but it does so at a cost. We discovered approximately a factor of 2-5 performance difference between Thrust and CUDA on each GPU platform we tested. Thrust provides a tool to access the GPUs with less effort and specialization, but it does so by giving up fine grained control where extra performance can be found for this application. Future work will be required to determine whether this performance differential between Thrust and CUDA can be reduced for event-based Monte Carlo transport. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

ASPECT RATIO DEPENDENCE OF THE FREE-FALL TIME FOR NON-SPHERICAL SYMMETRIES

We investigate the collapse of non-spherical substructures, such as sheets and filaments, which are ubiquitous in molecular clouds. Such non-spherical substructures collapse homologously in their interiors but are influenced by an edge effect that causes their edges to be preferentially accelerated. We analytically compute the homologous collapse timescales of the interiors of uniform-density, self-gravitating filaments and find that the homologous collapse timescale scales linearly with the aspect ratio. The characteristic timescale for an edge-driven collapse mode in a filament, however, is shown to have a square-root dependence on the aspect ratio. For both filaments and circular sheets, we find that selective edge acceleration becomes more important with increasing aspect ratio. In general, we find that lower dimensional objects and objects with larger aspect ratios have longer collapse timescales. We show that estimates for star formation rates, based upon gas densities, can be overestimated by an order of magnitude if the geometry of a cloud is not taken into account.

79 ASTRONOMY AND ASTROPHYSICS↗

Enabling Highly Efficient Capsule Networks Processing Through A PIM-Based Architecture Design

In recent years, the CNNs have achieved great successes in the image processing tasks, e.g., image recognition and object detection. Unfortunately, traditional CNN's classication is found to be easily misled by increasingly complex image features due to the usage of pooling operations, hence unable to preserve accurate position and pose information of the objects. To address this challenge, a novel neural network structure called Capsule Network has been proposed, which introduces equivariance through capsules to signicantly enhance the learning ability for image segmentation and object detection. Due to its requirement of performing a high volume of matrix operations, CapsNets have been generally accelerated on modern GPU platforms that provide highly optimized software library for common deep learning tasks. However, based on our performance characterization on modern GPUs, CapsNets exhibit low effciency due to the special program and execution features of their routing procedure, including massive unshareable intermediate variables and intensive syn- chronizations, which are very dicult to optimize at software level. To address these challenges, we propose a hybrid computing architecture design named PIM-CapsNet. It preserves GPU's on-chip computing capability for accelerating CNN types of layers in CapsNet, while pipelining with an off-chip in-memory acceleration solution that effectively tackles routing procedure's ineffciency by leveraging the processing-in-memory capability of today's 3D stacked memory. Using routing procedure's inherent parallellization feature, our design enables hierarchical improvements on CapsNet inference effciency through minimizing data movement and maximizing parallel processing in memory. Evaluation results demonstrate that our proposed design can achieve substantial improvement on both performance and energy savings for CapsNet inference, with almost zero accuracy loss. The results also suggest good performance scalability in optimizing the routing procedure with increasing network size.

Zhang, Xingyao↗

Experimental evaluation of a flexible I/O architecture for accelerating workflow engines in ultrascale environments

The increasing volume of scientific data and the limited scalability and performance of storage systems are currently presenting a significant limitation for the productivity of the scientific workflows running on both high-performance computing (HPC) and cloud platforms. Clearly needed is better integration of storage systems and workflow engines to address this problem. This paper presents and evaluates a novel solution that leverages codesign principles for integrating Hercules—an in-memory data store—with a workflow management system. We consider four main aspects: workflow representation, task scheduling, task placement, and task termination. As a result, the experimental evaluation on both cloud and HPC systems demonstrates significant performance and scalability improvements over existing state-of-the-art approaches.

97 MATHEMATICS AND COMPUTING↗

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↗