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 217 records · Page 12

H-AMR: A New GPU-accelerated GRMHD Code for Exascale Computing with 3D Adaptive Mesh Refinement and Local Adaptive Time Stepping

General relativistic magnetohydrodynamic (GRMHD) simulations have revolutionized our understanding of black hole accretion. Here, we present a GPU-accelerated GRMHD code H-AMR with multifaceted optimizations that, collectively, accelerate computation by 2–5 orders of magnitude for a wide range of applications. First, it introduces a spherical grid with 3D adaptive mesh refinement that operates in each of the three dimensions independently. This allows us to circumvent the Courant condition near the polar singularity, which otherwise cripples high-resolution computational performance. Second, we demonstrate that local adaptive time stepping on a logarithmic spherical-polar grid accelerates computation by a factor of ≲10 compared to traditional hierarchical time-stepping approaches. Jointly, these unique features lead to an effective speed of ~10 9 zone cycles per second per node on 5400 NVIDIA V100 GPUs (i.e., 900 nodes of the OLCF Summit supercomputer). We illustrate H-AMR's computational performance by presenting the first GRMHD simulation of a tilted thin accretion disk threaded by a toroidal magnetic field around a rapidly spinning black hole. With an effective resolution of 13,440 × 4608 × 8092 cells and a total of ≲22 billion cells and ~0.65 × 10 8 time steps, it is among the largest astrophysical simulations ever performed. We find that frame dragging by the black hole tears up the disk into two independently precessing subdisks. The innermost subdisk rotation axis intermittently aligns with the black hole spin, demonstrating for the first time that such long-sought alignment is possible in the absence of large-scale poloidal magnetic fields.

79 ASTRONOMY AND ASTROPHYSICS↗

Navier-Stokes simulation of the supersonic combustion flowfield in a ram accelerator

A computational study of the ram accelerator, a ramjet-in-tube device for accelerating projectiles to ultrahigh velocities, is presented. The analysis is performed using a fully implicit TVD scheme that efficiently solves the Reynolds-averaged Navier-Stokes equations and the species continuity equations associated with a finite rate combustion model. Previous analyses of this concept were based on inviscid assumptions. The present results indicate that viscous effects are of primary importance; in all the cases studied, shock-induced combustion always started in the boundary layer. The effects of Mach number, mixture composition, pressure, and turbulence are investigated for various configurations. Two types of combustion processes, one stable and the other unstable, were observed depending on the inflow conditions. In the unstable case, a detonation wave is formed, which propagates upstream and unstarts the ram accelerator. In the stable case, a solution that converges to steady-state is obtained, in which the combustion wave remains stationary with respect to the ram accelerator projectile. The possibility of stabilizing the detonation wave by means of a backward facing step is also investigated. In addition to these studies, two numerical techniques were tested. These two techniques are vector extrapolation to accelerate convergence, and a diagonal formulation that eliminates the expense of inverting large block matrices that arise in chemically reacting flows.

Yungster, Shaye↗

Navier-Stokes simulation of the supersonic combustion flowfield in a ram accelerator

A computational study of the ram accelerator, a ramjet-in-tube device for accelerating projectiles to ultrahigh velocities, is presented. The analysis is performed using a fully implicit TVD scheme that efficiently solves the Reynolds-averaged Navier-Stokes equations and the species continuity equations associated with a finite rate combustion model. The present results indicate that viscous effects are of primary importance in all the cases studied, shock-induced combustion always started in the boundary layer. The effects of Mach number, mixture composition, pressure and tubulence are investigated for various configurations. Two types of combustion processes, one stable and the other unstable, were observed depending on the inflow conditions. The possibility of stabilizing the detonation wave by means of a backward facing step is also investigated. Two numerical techniques were tested: vector extrapolation, to accelerate convergence, and a diagonal formulation that eliminates the expense of inverting large block matrices which arise in chemically reacting flows.

Yungster, Shaye↗

Computational Workflow for Accelerated Molecular Design Using Quantum Chemical Simulations and Deep Learning Models

Efficient methods for searching the chemical space of molecular compounds are needed to automate and accelerate the design of new functional molecules such as pharmaceuticals. Given the high cost in both resources and time for experimental efforts, computational approaches play a key role in guiding the selection of promising molecules for further investigation. Here, we construct a workflow to accelerate design by combining approximate quantum chemical methods [i.e. density-functional tight-binding (DFTB)], a graph convolutional neural network (GCNN) surrogate model for chemical property prediction, and a masked language model (MLM) for molecule generation. Property data from the DFTB calculations are used to train the surrogate model; the surrogate model is used to score candidates generated by the MLM. The surrogate reduces computation time by orders of magnitude compared to the DFTB calculations, enabling an increased search of chemical space. Furthermore, the MLM generates a diverse set of chemical modifications based on pre-training from a large compound library. We utilize the workflow to search for near-infrared photoactive molecules by minimizing the predicted HOMO-LUMO gap as the target property. Our results show that the workflow can generate optimized molecules outside of the original training set, which suggests that iterations of the workflow could be useful for searching vast chemical spaces in a wide range of design problems.

Blanchard, Andrew↗

An Accelerated Approach for Computationally Efficient Evaluation of Deflagration Time During Abnormal Thermal Events

The challenges of modeling abnormal thermal events for explosives of interest to LLNL can be simplified by an accelerated approach to calculate Prout-Tompkins (P-T) parameters describing autocatalytic deflagration. Rather than depending on detailed modeling in multiphysics codes that include chemical reactivity (e.g. ALE3D), the accelerated approach can calculate P-T parameters based solely on experimental time of deflagration measurements for the explosive of interest. We compare deflagration time for five explosives with previously known P-T parameters at conditions typical of abnormal thermal events and demonstrate that the accelerated approach produces deflagration predictions with a maximum error of 3% and an average error of 1.7%. While the accelerated approach may not be applicable to all experimental conditions, it holds promise of rapid derivation of P-T parameters for accurate modeling of abnormal thermal events of interest to LLNL.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Convergence acceleration of viscous flow computations

A multiple-grid convergence acceleration technique introduced for application to the solution of the Euler equations by means of Lax-Wendroff algorithms is extended to treat compressible viscous flow. Computational results are presented for the solution of the thin-layer version of the Navier-Stokes equations using the explicit MacCormack algorithm, accelerated by a convective coarse-grid scheme. Extensions and generalizations are mentioned.

Johnson, G. M.↗

Genetic algorithms for computational materials discovery accelerated by machine learning

Materials discovery is increasingly being impelled by machine learning methods that rely on pre-existing datasets. Where datasets are lacking, unbiased data generation can be achieved with genetic algorithms. Here a machine learning model is trained on-the-fly as a computationally inexpensive energy predictor before analyzing how to augment convergence in genetic algorithm-based approaches by using the model as a surrogate. This leads to a machine learning accelerated genetic algorithm combining robust qualities of the genetic algorithm with rapid machine learning. The approach is used to search for stable, compositionally variant, geometrically similar nanoparticle alloys to illustrate its capability for accelerated materials discovery, e.g., nanoalloy catalysts. The machine learning accelerated approach, in this case, yields a 50-fold reduction in the number of required energy calculations compared to a traditional “brute force” genetic algorithm. This makes searching through the space of all homotops and compositions of a binary alloy particle in a given structure feasible, using density functional theory calculations.

36 MATERIALS SCIENCE↗

Batched matrix computations on hardware accelerators based on GPUs

Scientific applications require solvers that work on many small size problems that are independent from each other. At the same time, the high-end hardware evolves rapidly and becomes ever more throughput-oriented and thus there is an increasing need for an effective approach to develop energy-efficient, high-performance codes for these small matrix problems that we call batched factorizations. The many applications that need this functionality could especially benefit from the use of GPUs, which currently are four to five times more energy efficient than multicore CPUs on important scientific workloads. This study, consequently, describes the development of the most common, one-sided factorizations, Cholesky, LU, and QR, for a set of small dense matrices. The algorithms we present together with their implementations are, by design, inherently parallel. In particular, our approach is based on representing the process as a sequence of batched BLAS routines that are executed entirely on a GPU. Importantly, this is unlike the LAPACK and the hybrid MAGMA factorization algorithms that work under drastically different assumptions of hardware design and efficiency of execution of the various computational kernels involved in the implementation. Thus, our approach is more efficient than what works for a combination of multicore CPUs and GPUs for the problems sizes of interest of the application use cases. The paradigm where upon a single chip (a GPU or a CPU) factorizes a single problem at a time is not at all efficient in our applications’ context. We illustrate all of these claims through a detailed performance analysis. With the help of profiling and tracing tools, we guide our development of batched factorizations to achieve up to two-fold speedup and three-fold better energy efficiency as compared against our highly optimized batched CPU implementations based on MKL library. Finally, the tested system featured two sockets of Intel Sandy Bridge CPUs and we compared with a batched LU factorizations featured in the CUBLAS library for GPUs, we achieve as high as 2.5× speedup on the NVIDIA K40 GPU.

97 MATHEMATICS AND COMPUTING↗

From Data to Models and Analytics: An Integrated Scientific Computing Platform to Accelerate Environmental Research SBIR Phase I (Final Technical Report)

Phase I research was conducted to investigate the technical feasibility of an integrated open source platform GeoLib to provide turnkey solutions for model-data integration for environmental systems science (ESS), using modern web technologies, advances in HPC and cloud computing and high-performance visualization. A key feature of our platform is that it minimizes and automates data movement between data storage and computing systems. Another critical feature of the design is that it enables users to perform high-fidelity post-processing by performing high-performance visualization server-side and in-situ on the compute cluster close to the data. The investigation, which was performed over a 12-month period ending April 2019, centered on developing prototype software to demonstrate the key enabling technologies required for this system. This included: (i) rapid access to data from multiple remote sources, via a unified data interface; (ii) software for scalable geospatial visualization of raster, vector, and point cloud data on the web; (iii) development of an easy-to-use API for creating simulation and modeling workflows; (iv) remote data visualization and processing on middle-tier servers; and (v) remote data processing on high-performance computing systems. A critical part of this work is that all of these capabilities be accessible to end users through standard desktop tools such as Project Jupyter, which is widely adopted for ESS simulation and modeling.

97 MATHEMATICS AND COMPUTING↗

Real-time dose computation: GPU-accelerated source modeling and superposition/convolution

Purpose: To accelerate dose calculation to interactive rates using highly parallel graphics processing units (GPUs). Methods: The authors have extended their prior work in GPU-accelerated superposition/convolution with a modern dual-source model and have enhanced performance. The primary source algorithm supports both focused leaf ends and asymmetric rounded leaf ends. The extra-focal algorithm uses a discretized, isotropic area source and models multileaf collimator leaf height effects. The spectral and attenuation effects of static beam modifiers were integrated into each source's spectral function. The authors introduce the concepts of arc superposition and delta superposition. Arc superposition utilizes separate angular sampling for the total energy released per unit mass (TERMA) and superposition computations to increase accuracy and performance. Delta superposition allows single beamlet changes to be computed efficiently. The authors extended their concept of multi-resolution superposition to include kernel tilting. Multi-resolution superposition approximates solid angle ray-tracing, improving performance and scalability with a minor loss in accuracy. Superposition/convolution was implemented using the inverse cumulative-cumulative kernel and exact radiological path ray-tracing. The accuracy analyses were performed using multiple kernel ray samplings, both with and without kernel tilting and multi-resolution superposition. Results: Source model performance was <9 ms (data dependent) for a high resolution (400{sup 2}) field using an NVIDIA (Santa Clara, CA) GeForce GTX 280. Computation of the physically correct multispectral TERMA attenuation was improved by a material centric approach, which increased performance by over 80%. Superposition performance was improved by {approx}24% to 0.058 and 0.94 s for 64{sup 3} and 128{sup 3} water phantoms; a speed-up of 101-144x over the highly optimized Pinnacle{sup 3} (Philips, Madison, WI) implementation. Pinnacle{sup 3} times were 8.3 and 94 s, respectively, on an AMD (Sunnyvale, CA) Opteron 254 (two cores, 2.8 GHz). Conclusions: The authors have completed a comprehensive, GPU-accelerated dose engine in order to provide a substantial performance gain over CPU based implementations. Real-time dose computation is feasible with the accuracy levels of the superposition/convolution algorithm.

60 APPLIED LIFE SCIENCES↗

Harnessing High‐Throughput Computational Methods to Accelerate the Discovery of Optimal Proton Conductors for High‐Performance and Durable Protonic Ceramic Electrochemical Cells

Abstract The pursuit of high‐performance and long‐lasting protonic ceramic electrochemical cells (PCECs) is impeded by the lack of efficient and enduring proton conductors. Conventional research approaches, predominantly based on a trial‐and‐error methodology, have proven to be demanding of resources and time‐consuming. Here, this work reports the findings in harnessing high‐throughput computational methods to expedite the discovery of optimal electrolytes for PCECs. This work methodically computes the oxygen vacancy formation energy (E V ), hydration energy (E H ), and the adsorption energies of H 2 O and CO 2 for a set of 932 oxide candidates. Notably, these findings highlight BaSn x Ce 0.8‐x Yb 0.2 O 3‐δ (BSCYb) as a prospective game‐changing contender, displaying superior proton conductivity and chemical resilience when compared to the well‐regarded BaZr x Ce 0.8‐x Y 0.1 Yb 0.1 O 3‐δ (BZCYYb) series. Experimental validations substantiate the computational predictions; PCECs incorporating BSCYb as the electrolyte achieved extraordinary peak power densities in the fuel cell mode (0.52 and 1.57 W cm −2 at 450 and 600 °C, respectively), a current density of 2.62 A cm −2 at 1.3 V and 600 °C in the electrolysis mode while demonstrating exceptional durability for over 1000‐h when exposed to 50% H 2 O. This research underscores the transformative potential of high‐throughput computational techniques in advancing the field of proton‐conducting oxides for sustainable power generation and hydrogen production.

08 HYDROGEN↗

Modeling of advanced accelerator concepts

Computer modeling is essential to research on Advanced Accelerator Concepts (AAC), as well as to their design and operation. This paper summarizes the current status and future needs of AAC systems and reports on several key aspects of (i) high-performance computing (including performance, portability, scalability, advanced algorithms, scalable I/Os and In-Situ analysis), (ii) the benefits of ecosystems with integrated workflows based on standardized input and output and with integrated frameworks developed as a community, and (iii) sustainability and reliability (including code robustness and usability).

47 OTHER INSTRUMENTATION↗

Solving global optimization problems on GPU cluster

The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

97 MATHEMATICS AND COMPUTING↗

Leveraging Afterglow in Scintillation-based x-ray detectors for spacetime-resolved computed tomography for accelerated acquisition and high-speed event capture

Afterglow in x-ray imaging for high-speed radiography is a constraint that limits imaging systems to low-light/fast decay screens which create poor data. Current approaches focus purely on using low-light yield screens with fast decay to avoid multiple exposure pileup due to afterglow. The goal of this work is to develop a statistical estimation approach to leverage afterglow to improve image quality thus allowing for higher quality imaging components to be used. This will allow for bright screens will slow decay to be used, and then a post-processing step applies the statistical estimation to separate each frame with superior signal compared to low-light/fast decay screens.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗