Search NASA⌕ Search

SEARCH · Search NASA

Results for “GPU graphics processing units”

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

Accelerating high-order continuum kinetic plasma simulations using multiple GPUs

Kinetic plasma simulations solve the Vlasov-Poisson or Vlasov-Maxwell equations to evolve scalar-variable distribution functions in position-velocity phase space and vector-variable electromagnetic fields in configuration space. The immense computational cost of evolving high-dimensional variables, and their large number of degrees of freedom, often limits the utility of continuum kinetic simulations and presents a challenge when it comes to accurately simulating real-world physical phenomena. To address this challenge, we present techniques that accelerate and minimize the computational work required for a scalable Vlasov-Poisson solver. We show theoretical hardware compute and communication bounds for solving a fourth-order finite-volume Vlasov-Poisson system. These bounds are then used to inform and evaluate the design of performance portable algorithms for a multiple graphics processing unit (GPU) accelerated version of the Vlasov-Poisson solver VCK-CPU [1]. We demonstrate that the multi-GPU Vlasov solver implementation, VCK-GPU, simultaneously minimizes required inter-process data transfer while also being bounded by the machine network performance limits. This results in an overall strong scaling speedup per timestep of up to 40x in three-dimensional phase space (one position, two velocity coordinates) and 54x in four dimensional phase space (two position, two velocity coordinates) and a 341x increase in simulation throughput of the GPU accelerated code over the existing CPU code. The GPU code is also able to weak scale up to 256 compute nodes and 1024 GPUs. In conclusion, we demonstrate that the improved compute performance enables exploring configurations which were previously computationally infeasible, including resolving fine-scale distribution function filamentation and multi-species dynamics with realistic electron-proton mass ratios.

Continuum kinetics↗

Kernel fusion in atomistic spin dynamics simulations on Nvidia GPUs using tensor core

In atomistic spin dynamics simulations, the time cost of constructing the space- and time-displaced pair correlation function in real space increases quadratically as the number of spins N, leading to significant computational effort. The GEMM subroutine can be adopted to accelerate the calculation of the dynamical spin-spin correlation function, but the computational cost of simulating large spin systems (>40000 spins) on CPUs remains expensive. In this work, we perform the simulation on the graphics processing unit (GPU), a hardware solution widely used as an accelerator for scientific computing and deep learning. Here we show that GPUs can accelerate the simulation up to 25-fold compared to multi-core CPUs when using the GEMM subroutine on both. To hide memory latency, we fuse the element-wise operation into the GEMM kernel using CUTLASS that can improve the performance by 26% ~ 33% compared to implementation based on cuBLAS. Furthermore, we perform the on-the-fly calculation in the epilogue of the GEMM subroutine to avoid saving intermediate results on global memory, which makes the large-scale atomistic spin dynamics simulation feasible and affordable.

97 MATHEMATICS AND COMPUTING↗

Dosimetric evaluation of total marrow irradiation using 2 different planning systems

This study compared 2 different treatment planning systems (TPSs) for quality and efficiency of total marrow irradiation (TMI) plans. The TPSs used in this study were VOxel-Less Optimization (VoLO) (Accuray Inc, Sunnyvale, CA) using helical dose delivery on a Tomotherapy Hi-Art treatment unit and Eclipse (Varian Medical Systems Inc, Palo Alto, CA) using volumetric modulated arc therapy (VMAT) dose delivery on a Varian iX treatment unit. A total dose of 1200 cGy was prescribed to cover 95% of the planning target volume (PTV). The plans were optimized and calculated based on a single CT data and structure set using the Alderson Rando phantom (The Phantom Laboratory, Salem, NY) and physician contoured target and organ at risk (OAR) volumes. The OARs were lungs, heart, liver, kidneys, brain, and small bowel. The plans were evaluated based on plan quality, time to optimize the plan and calculate the dose, and beam on time. The resulting mean and maximum doses to the PTV were 1268 and 1465 cGy for VoLO and 1284 and 1541 cGy for Eclipse, respectively. For 5 of 6 OAR structures the VoLO system achieved lower mean and D10 doses ranging from 22% to 52% and 3% to 44%, respectively. Total computational time including only optimization and dose calculation were 0.9 hours for VoLO and 3.8 hours for Eclipse. These times do not include user-dependent target delineation and field setup. Both planning systems are capable of creating high-quality plans for total marrow irradiation. The VoLO planning system was able to achieve more uniform dose distribution throughout the target volume and steeper dose fall off, resulting in superior OAR sparing. VoLO's graphics processing unit (GPU)–based optimization and dose calculation algorithm also allowed much faster creation of TMI plans.

61 RADIATION PROTECTION AND DOSIMETRY↗

A parallel strategy for density functional theory computations on accelerated nodes

Using the Löwdin orthonormalization of tall-skinny matrices as a proxy-app for wavefunction-based Density Functional Theory solvers, we investigate a distributed memory parallel strategy focusing on Graphics Processing Unit (GPU)-accelerated nodes as available on some of the top ranked supercomputers at the present time. Here we present numerical results in the strong limit regime, as it is particularly relevant for First-Principles Molecular Dynamics. We also examine how matrix product-based iterative solvers provide a competitive alternative to dense eigensolvers on GPUs, allowing to push the strong scaling limit of these computations to a larger number of distributed tasks. Our strategy, which relies on replicated Gram matrices and efficient collective communications using the NCCL library, leads to a time-to-solution under 0.5 s for the Löwdin orthonormalization of a tall-skinny matrix of 3000 columns on Summit at Oak Ridge Leadership Facility (OLCF). Given the similarity in computational operations between one iteration of a DFT solver and this proxy-app, this shows the possibility of solving accurately the DFT equations well under a minute for 3000 electronic wave functions, and thus perform First-Principles molecular dynamics of physical systems much larger than traditionally solved on CPU systems.

97 MATHEMATICS AND COMPUTING↗

SPH modeling of biomass granular flow: Theoretical implementation and experimental validation

The commercialization of biomass-derived energy is impeded by flowability challenges arising from the feeding and handling of granular biomass materials in full-scale biorefineries. To overcome these obstacles, a robust and accurate model to simulate the flow of granular biomass is indispensable. However, conventional mesh-based numerical codes are limited by inherent mesh distortion in simulating large deformation that commonly occurs in granular biomass handling. Here, in this study, we propose a graphics processing unit (GPU)-accelerated meshless Smoothed Particle Hydrodynamics (SPH) code to model the flow of granular biomass materials. A modified void ratio-based mass conversation, a hybrid particle-to-particle/surface frictional boundary treatment, and a hypoplastic constitutive model are implemented. Four numerical examples, an elastic block sliding on inclined planes, sand column collapse, Angle of Repose, and axial compression tests for pine chips, were simulated using the developed SPH code. The results demonstrate good agreement between numerical predictions and analytical and experimental data for all four examples, validating the SPH code and increasing confidence that it can be applied to simulate more complex granular biomass handling processes, such as hopper feeding or auger conveyance.

09 BIOMASS FUELS↗

Accelerating Time Integration for the Shallow Water Equations on the Sphere Using GPUs

The push towards larger and larger computational platforms has made it possible for climate simulations to resolve climate dynamics across multiple spatial and temporal scales. This direction in climate simulation has created a strong need to develop scalable time-stepping methods capable of accelerating throughput on high performance computing. This work details the recent advances in the implementation of implicit time stepping on a spectral element cube-sphere grid using graphical processing units (GPU) based machines. We demonstrate how solvers in the Trilinos project are interfaced with ACME and GPU kernels can significantly increase computational speed of the residual calculations in the implicit time stepping method for the shallow water equations on the sphere. We show the optimization gains and data structure reorganization that facilitates the performance improvements.

54 ENVIRONMENTAL SCIENCES↗

Uncertainty quantification for Multiphase-CFD simulations of bubbly flows: a machine learning-based Bayesian approach supported by high-resolution experiments

In this paper, we developed a machine learning-based Bayesian approach to inversely quantify and reduce the uncertainties of multiphase computational fluid dynamics (MCFD) simulations for bubbly flows. The proposed approach is supported by high-resolution two-phase flow measurements, including those by double-sensor conductivity probes, high-speed imaging, and particle image velocimetry. Local distributions of key physical quantities of interest (QoIs), including the void fraction and phasic velocities, are obtained to support the Bayesian inference. In the process, the epistemic uncertainties of the closure relations are inversely quantified while the aleatory uncertainties from stochastic fluctuations of the system are evaluated based on experimental uncertainty analysis. The combined uncertainties are then propagated through the MCFD solver to obtain uncertainties of the QoIs, based on which probability-boxes are constructed for validation. The proposed approach relies on three machine learning methods: feedforward neural networks and principal component analysis for surrogate modeling, and Gaussian processes for model form uncertainty modeling. The whole process is implemented within the framework of an open-source deep learning library PyTorch with graphics processing unit (GPU) acceleration, thus ensuring the efficiency of the computation. The results demonstrate that with the support of high-resolution data, the uncertainties of MCFD simulations can be significantly reduced. The proposed approach has the potential for other applications that involve numerical models with empirical parameters.

42 ENGINEERING↗

I ntera C hem : Exploring Excited States in Virtual Reality with Ab Initio Interactive Molecular Dynamics

InteraChem is an ab initio interactive molecular dynamics (AI-IMD) visualizer that leverages recent advances in virtual reality hardware and software, as well as the graphical processing unit (GPU)-accelerated TeraChem electronic structure package, in order to render quantum chemistry in real time. We introduce the exploration of electronically excited states via AI-IMD using the floating occupation molecular orbital-complete active space configuration interaction method. The optimization tools in InteraChem enable identification of excited state minima as well as minimum energy conical intersections for further characterization of excited state chemistry in small- to medium-sized systems. We demonstrate that finite-temperature Hartree–Fock theory is an efficient method to perform ground state AI-IMD. InteraChem allows users to track electronic properties such as molecular orbitals and bond order in real time, resulting in an interactive visualization tool that aids in the interpretation of excited state chemistry data and makes quantum chemistry more accessible for both research and educational purposes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Simulating Electron Dynamics of Complex Molecules with Time-Dependent Complete Active Space Configuration Interaction

In this paper, time-dependent electronic structure methods are growing in popularity as tools for modeling ultrafast and/or nonlinear processes, for computing spectra, and as the electronic structure component of mean-field molecular dynamics simulations. Time-dependent configuration interaction (TD-CI) offers several advantages over the widely used real-time time-dependent density functional theory: namely, that it correctly models Rabi oscillations; it offers a spin-pure description of open-shell systems; and a hierarchy of TD-CI methods can be defined that systematically approach the exact solution of the time-dependent Schrodinger equation (TDSE). In this work, we present a novel TD-CI approach that extends TD-CI to large complete active-space configuration expansions. Such extension is enabled by use of a direct configuration interaction approach that eliminates the need to explicitly build, store, or diagonalize the Hamiltonian matrix. Graphics processing unit (GPU) acceleration enables fast solution of the TDSE even for large active spaces—up to 12 electrons in 12 orbitals (853776 determinants) in this work. A symplectic split operator propagator yields long-time norm conservation. We demonstrate the applicability of our approach by computing the response of a large molecule with a strongly correlated ground state, decacene (C 42 H 24 ), to various pulses (δ-function, transform limited, chirped). Our simulations predict that chirped pulses can be used to induce dipole-forbidden transitions. Simulations of decacene using the 6-31G(d) basis set and a 12 electrons/12 orbitals active space took 20.1 h to propagate for 100 fs with a 1 attosecond time step on a single NVIDIA K40 GPU. Convergence with respect to time step is found to depend on the property being computed and the chosen active space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Large-Scale Electron Correlation Calculations: Rank-Reduced Full Configuration Interaction

Here, we present the rank-reduced full configuration interaction (RR-FCI) method, a variational approach for the calculation of extremely large full configuration interaction (FCI) wave functions. In this report, we show that RR-FCI can provide ground state singlet and triplet energies within kcal/mol accuracy of full CI (FCI) with computational effort scaling as the square root of the number of determinants in the CI space (compared to conventional FCI methods which scale linearly with the number of determinants). Fast graphical processing unit (GPU) accelerated projected σ = Hc matrix–vector product formation enables calculations with configuration spaces as large as 30 electrons in 30 orbitals, corresponding to an FCI calculation with over 2.4 × 10 16 configurations. We apply this method in the context of complete active space configuration interaction calculations to acenes with 2–5 aromatic rings, comparing absolute energies against FCI when possible and singlet/triplet excitation energies against both density matrix renormalization group (DMRG) and experimental results. The dissociation of molecular nitrogen was also examined using both FCI and RR-FCI. In each case, we found that RR-FCI provides a low cost alternative to FCI, with particular advantages when relative energies are desired.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Chapter 6: Modeling and Simulation of Wind-Farm Flows

The subject of this chapter is the modeling and simulation of the flow through full wind farms, also known as wind plants, which are collections of many wind turbines within a region working together to supply power to the grid like any other type of power plant. This topic is interesting and exciting because of the increasing variety of and uses for wind plant flow modeling and simulation. For example, Figure 6.1 shows the computed flow field from a high-fidelity simulation of the Lillgrund offshore wind farm using computational fluid dynamics (CFD) with large-eddy simulation (LES) turbulence modeling and actuator line rotor aerodynamics models. There are many ways to model this type of flow, ranging from very simple models of wind turbine wakes and their interactions that can run in a matter of seconds on a laptop to high-fidelity, turbulence -resolving LES of the atmospheric flow and wakes that require days of use of thousands of cores on a high-performance computing cluster. The uses of wind plant flow simulations are equally varied. Wind plant layout designers run hundreds or thousands of simulations over all possible wind directions and speeds using simple models to predict a future wind plant's annual energy production. Researchers use LESs of the wind plant to study phenomena such as wind turbine wake interactions with each other and with the atmospheric boundary layer (ABL). As computational resources become more readily available, it is even becoming common for turbine manufacturers to use CFD of some form to model wind plants in complex terrain to help in the wind turbine siting and selection process. We are beginning to see the expensive, high-fidelity tools being used to create data and knowledge that improves or enables the creation of new cheaper, lower fidelity tools. We are also beginning to see the low- and high-fidelity tools used together to perform uncertainty quantification of energy estimates and optimization of wind plant layouts. As new computing technologies mature, such as graphics processing unit (GPU)-based computing, the future of full wind plant flow modeling is exciting.

17 WIND ENERGY↗

Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs

For over a decade now, physical and energy constraints have limited clock speed improvements in commodity microprocessors. Instead, chipmakers have been pushed into producing lower-power, multi-core processors such as Graphical Processing Units (GPU), ARM CPUs, and Intel MICs. Broad-based efforts from manufacturers and developers have been devoted to making these processors user-friendly enough to perform general computations. However, extracting performance from a larger number of cores, as well as specialized vector or SIMD units, requires special care in algorithm design and code optimization. One of the most computationally challenging problems in high-energy particle experiments is finding and fitting the charged-particle tracks during event reconstruction. This is expected to become by far the dominant problem at the High-Luminosity Large Hadron Collider (HL-LHC), for example. Today the most common track finding methods are those based on the Kalman filter. Experience with Kalman techniques on real tracking detector systems has shown that they are robust and provide high physics performance. This is why they are currently in use at the LHC, both in the trigger and offine. Previously we reported on the significant parallel speedups that resulted from our investigations to adapt Kalman filters to track fitting and track building on Intel Xeon and Xeon Phi. Here, we discuss our progresses toward the understanding of these processors and the new developments to port the Kalman filter to NVIDIA GPUs.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Bringing heterogeneity to the CMS software framework

The advent of computing resources with co-processors, for example Graphics Processing Units (GPU) or Field-Programmable Gate Arrays (FPGA), for use cases like the CMS High-Level Trigger (HLT) or data processing at leadership-class supercomputers imposes challenges for the current data processing frameworks. These challenges include developing a model for algorithms to offload their computations on the co-processors as well as keeping the traditional CPU busy doing other work. The CMS data processing framework, CMSSW, implements multithreading using the Intel Threading Building Blocks (TBB) library, that utilizes tasks as concurrent units of work. In this paper we will discuss a generic mechanism to interact effectively with non-CPU resources that has been implemented in CMSSW. In addition, configuring such a heterogeneous system is challenging. In CMSSW an application is configured with a configuration file written in the Python language. The algorithm types are part of the configuration. The challenge therefore is to unify the CPU and co-processor settings while allowing their implementations to be separate. We will explain how we solved these challenges while minimizing the necessary changes to the CMSSW framework. We will also discuss on a concrete example how algorithms would offload work to NVIDIA GPUs using directly the CUDA API.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Performance of Heterogeneous Algorithm Scheduling in CMSSW

The CMS experiment started to utilize Graphics Processing Units (GPU) to accelerate the online reconstruction and event selection running on its High Level Trigger (HLT) farm in the 2022 data taking period. The projections of the HLT farm to the High-Luminosity LHC foresee a significant use of compute accelerators in the LHC Run 4 and onwards in order to keep the cost, size, and power budget of the farm under control. This direction of leveraging compute accelerators has synergies with the increasing use of HPC resources in HEP computing, as HPC machines are employing more and more compute accelerators that are predominantly GPUs today. In this work we review the features developed for the CMS data processing framework, CMSSW, to support the effective utilization of both compute accelerators and many-core CPUs within a highly concurrent task-based framework. We measure the impact of various design choices for the scheduling of heterogeneous algorithms on the event processing throughput, using the Run-3 HLT application as a realistic use case.

Bocci, Andrea↗

Fast, multi-channel real-time processing of signals with microsecond latency using graphics processing units

Fast, digital signal processing (DSP) has many applications. Typical hardware options for performing DSP are field-programmable gate arrays (FPGAs), application-specific integrated DSP chips, or general purpose personal computer systems. This paper presents a novel DSP platform that has been developed for feedback control on the HBT-EP tokamak device. The system runs all signal processing exclusively on a Graphics Processing Unit (GPU) to achieve real-time performance with latencies below 8 μs. Signals are transferred into and out of the GPU using PCI Express peer-to-peer direct-memory-access transfers without involvement of the central processing unit or host memory. Tests were performed on the feedback control system of the HBT-EP tokamak using forty 16-bit floating point inputs and outputs each and a sampling rate of up to 250 kHz. Signals were digitized by a D-TACQ ACQ196 module, processing done on an NVIDIA GTX 580 GPU programmed in CUDA, and analog output was generated by D-TACQ AO32CPCI modules.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Communication: A reduced scaling J-engine based reformulation of SOS-MP2 using graphics processing units

We present a low-prefactor, cubically scaling scaled-opposite-spin second-order Møller-Plesset perturbation theory (SOS-MP2) method which is highly suitable for massively parallel architectures like graphics processing units (GPU). The scaling is reduced from O(N{sup 5}) to O(N{sup 3}) by a reformulation of the MP2-expression in the atomic orbital basis via Laplace transformation and the resolution-of-the-identity (RI) approximation of the integrals in combination with efficient sparse algebra for the 3-center integral transformation. In contrast to previous works that employ GPUs for post Hartree-Fock calculations, we do not simply employ GPU-based linear algebra libraries to accelerate the conventional algorithm. Instead, our reformulation allows to replace the rate-determining contraction step with a modified J-engine algorithm, that has been proven to be highly efficient on GPUs. Thus, our SOS-MP2 scheme enables us to treat large molecular systems in an accurate and efficient manner on a single GPU-server.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Forces and stress in second order Møller-Plesset perturbation theory for condensed phase systems within the resolution-of-identity Gaussian and plane waves approach

The forces acting on the atoms as well as the stress tensor are crucial ingredients for calculating the structural and dynamical properties of systems in the condensed phase. Here, these derivatives of the total energy are evaluated for the second-order Møller-Plesset perturbation energy (MP2) in the framework of the resolution of identity Gaussian and plane waves method, in a way that is fully consistent with how the total energy is computed. This consistency is non-trivial, given the different ways employed to compute Coulomb, exchange, and canonical four center integrals, and allows, for example, for energy conserving dynamics in various ensembles. Based on this formalism, a massively parallel algorithm has been developed for finite and extended system. The designed parallel algorithm displays, with respect to the system size, cubic, quartic, and quintic requirements, respectively, for the memory, communication, and computation. All these requirements are reduced with an increasing number of processes, and the measured performance shows excellent parallel scalability and efficiency up to thousands of nodes. Additionally, the computationally more demanding quintic scaling steps can be accelerated by employing graphics processing units (GPU’s) showing, for large systems, a gain of almost a factor two compared to the standard central processing unit-only case. In this way, the evaluation of the derivatives of the RI-MP2 energy can be performed within a few minutes for systems containing hundreds of atoms and thousands of basis functions. With good time to solution, the implementation thus opens the possibility to perform molecular dynamics (MD) simulations in various ensembles (microcanonical ensemble and isobaric-isothermal ensemble) at the MP2 level of theory. Geometry optimization, full cell relaxation, and energy conserving MD simulations have been performed for a variety of molecular crystals including NH{sub 3}, CO{sub 2}, formic acid, and benzene.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗