Search NASA⌕ Search

SEARCH · Search NASA

Results for “GPU accelerators”

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 145 records · Page 8

Fast and Scalable FFT-Based GPU-Accelerated Algorithms for Block-Triangular Toeplitz Matrices with Application to Linear Inverse Problems Governed by Autonomous Dynamical Systems

In this work, we present an efficient and scalable algorithm for performing matrix-vector multiplications (matvecs) for block Toeplitz matrices. Such matrices, which are shift-invariant with respect to their blocks, arise in the context of solving inverse problems governed by autonomous systems, and time-invariant systems in particular. In this article, we consider inverse problems that infer unknown parameters from observational data of a linear time-invariant dynamical system given in the form of partial differential equations (PDEs). Matrix-free Newton-conjugate-gradient methods are often the gold standard for solving these inverse problems, but they require numerous actions of the Hessian on a vector. Matrix-free adjoint-based Hessian matvecs require solution of a pair of linearized forward/adjoint PDE solves per Hessian action, which may be prohibitive for large-scale inverse problems. Time invariance of the forward PDE problem leads to a block Toeplitz structure of the discretized parameter-to-observable (p2o) map defining the mapping from inputs (parameters) to outputs (observables) of the PDEs. This block Toeplitz structure enables us to exploit two key properties: (1) compact storage of the p2o map and its adjoint, and (2) efficient fast Fourier transform–based Hessian matvecs. The proposed algorithm is mapped onto large multi-GPU clusters and achieves more than 80% of peak bandwidth on NVIDIA A100 GPUs. Excellent weak scaling is shown for up to 48 A100 GPUs. For the targeted problems, the implementation executes Hessian matvecs within fractions of a second, which is orders of magnitude faster than can be achieved by conventional matrix-free Hessian matvecs via forward/adjoint PDE solves.

97 MATHEMATICS AND COMPUTING↗

GPU Acceleration of Kernel Density Estimators in Monte Carlo Neutron Transport Simulations

Kernel Density Estimators (KDEs) have recently been explored for use in Monte Carlo radiation transport simulations as an alternative to histogram tallies for capturing spatially-resolved quantities such as neutron flux and reaction rates. Histogram tallies suffer from large uncertainties when detailed spatial resolution of the quantity of interest is required; increasing the resolution of the underlying mesh increases the uncertainty in each histogram bin. KDEs obtain estimates of underlying densities on user-defined points, with the uncertainty at those points being independent of the spatial resolution desired since collisions and particle-track segments are allowed to contribute to the score at multiple tally points. Thus, KDEs show potential for obtaining estimates of a smoother spatially-resolved with reduced variance when compared to a histogram. However, this ability that enables KDEs to obtain lower uncertainties per particle history is more computationally expensive than using a traditional histogram bins on a structured mesh. While KDEs are capable of producing lower tally uncertainties compared to histogram binning for a given number of histories, their increased computational cost may make them less efficient. Even so, it is possible to reduce this additional cost by exporting the KDE tally routines onto Graphics Processing Units (GPUs). GPUs are commonly found on high-performance computing machines as a means of increasing performance without adding additional compute nodes. While it is difficult for existing Monte Carlo radiation transport codes to take advantage of GPUs without rewriting large portions of the code, it is possible to leverage GPUs through heterogeneous computing. This work uses a modified version of OpenMC and exports the KDE tally routines onto a GPU to obtain problem-dependent speedups ranging between 1.6 and 5.0 for the problem studied in this paper. While this methodology is applied to KDEs, the same ideas can be applied to other computationally expensive vectorizable portions of Monte Carlo algorithms. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

GPU Acceleration of the Locally Selfconsistent Multiple Scattering Code for First Principles Calculation of the Ground State and Statistical Physics of Materials

The Locally Self-consistent Multiple Scattering (LSMS) code solves the first principles Density Functional theory Kohn-Sham equation for a wide range of materials with a special focus on metals, alloys and metallic nano-structures. It has traditionally exhibited near perfect scalability on massively parallel high performance computer architectures. We present our efforts to exploit GPUs to accelerate the LSMS code to enable first principles calculations of O(100,000) atoms and statistical physics sampling of finite temperature properties. Using the Cray XK7 system Titan at the Oak Ridge Leadership Computing Facility we achieve a sustained performance of 14.5PFlop/s and a speedup of 8.6 compared to the CPU only code.

Eisenbach, Markus↗

GPU acceleration of the Locally Selfconsistent Multiple Scattering code for first principles calculation of the ground state and statistical physics of materials

The Locally Self-consistent Multiple Scattering (LSMS) code solves the first principles Density Functional theory Kohn–Sham equation for a wide range of materials with a special focus on metals, alloys and metallic nano-structures. It has traditionally exhibited near perfect scalability on massively parallel high performance computer architectures. In this paper, we present our efforts to exploit GPUs to accelerate the LSMS code to enable first principles calculations of O(100,000) atoms and statistical physics sampling of finite temperature properties. We reimplement the scattering matrix calculation for GPUs with a block matrix inversion algorithm that only uses accelerator memory. Finally, using the Cray XK7 system Titan at the Oak Ridge Leadership Computing Facility we achieve a sustained performance of 14.5PFlop/s and a speedup of 8.6 compared to the CPU only code.

36 MATERIALS SCIENCE↗

TeraChem Cloud: A High-Performance Computing Service for Scalable Distributed GPU-Accelerated Electronic Structure Calculations

The encapsulation and commoditization of electronic structure arise naturally as interoperability, and the use of nontraditional compute resources (e.g., new hardware accelerators, cloud computing) remains important for the computational chemistry community. Here, we present TERACHEM CLOUD, a high-performance computing service (HPCS) that offers on-demand electronic structure calculations on both traditional HPC clusters and cloud-based hardware. The framework is designed using off-the-shelf web technologies and containerization to be extremely scalable and portable. Within the HPCS model, users can quickly develop new methods and algorithms in an interactive environment on their laptop while allowing TERACHEM CLOUD to distribute ab initio calculations across all available resources. This approach greatly increases the accessibility of hardware accelerators such as graphics processing units (GPUs) and flexibility for the development of new methods as additional electronic structure packages are integrated into the framework as alternative backends. Cost-performance analysis indicates that traditional nodes are the most cost-effective long-term solution, but commercial cloud providers offer cutting-edge hardware with competitive rates for short-term large-scale calculations. We demonstrate the power of the TERACHEM CLOUD framework by carrying out several showcase calculations, including the generation of 300,000 density functional theory energy and gradient evaluations on medium-sized organic molecules and reproducing 300 fs of nonadiabatic dynamics on the B800-B850 antenna complex in LH2, with the latter demonstration using over 50 Tesla V100 GPUs in a commercial cloud environment in 8 h for approximately $1250.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The FastEddy® Resident-GPU Accelerated Large-Eddy Simulation Framework: Moist Dynamics Extension, Validation and Sensitivities of Modeling Non-Precipitating Shallow Cumulus Clouds

Herein we describe the moist dynamics formulation implemented within the graphics processing unit-resident large-eddy simulation FastEddy® model, which includes a simple saturation adjustment scheme for condensation and evaporation processes. Two LES model intercomparison exercises for non-precipitating shallow cumulus clouds are simulated in order to validate this model extension, including a static forcing and a time-dependent forcing case. Overall, we find our dynamical, thermodynamical and microphysical quantities, along with turbulence variability and fluxes, to be commensurate with the corresponding model intercomparison results. In addition, sensitivities to specific model settings are investigated. Among these settings, it is shown that boundary layer and cloud layer structure and characteristics are sensitive to use of higher-order advection schemes impacting the vertical distribution of cloud content and associated turbulence statistics. Increasing the timescale of the saturation scheme leads to enhanced liquid water presence and decreases vertical velocity variance within the cloud deck. In some cases, these sensitivities agree with the model-to-model variability reported in the intercomparison exercises, highlighting the important role of specific model implementation choices in the context of shallow cumulus convection simulations. These analyses and findings also provide the basis for future extensions and applications of FastEddy® for modeling moist convection and precipitation scenarios.

54 ENVIRONMENTAL SCIENCES↗