Search NASA⌕ Search

SEARCH · Search NASA

Results for “strong scaling”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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↗
DOE OSTI2020

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↗
DOE OSTI2021

Immortal rays: Rethinking random ray neutron transport on GPU architectures

The Random Ray Method (TRRM) is a recently developed adaptation of the Method of Characteristics for neutral particle transport simulations. TRRM has demonstrated excellent performance on 3D nuclear reactor benchmark problems using CPU-based compute systems. When porting to GPU-based systems, however, new performance challenges arise that are unique to processors targeting massive fine-grained parallelism. For smaller problems, or for large problems that are domain decomposed across many computational nodes, the problem size per node has insufficient parallelism to saturate GPU node resources, thus greatly limiting speedup. In this study, we report on a newly developed “immortal ray” variant of TRRM. Here, the immortal ray technique exposes significantly more fine-grained parallelism by fundamentally reformulating the numerical details of ray discretization, resulting in performance tradeoffs with significant overall benefit on GPUs. For very small 2D simulation problems we found the new immortal ray variant allowed for up to a 4.4x speedup when run on a single GPU. For larger 3D simulation problems we found the new variant improved strong scaling by 3x when run on the Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A High-Performance Discrete-Element Framework for Simulating Flow and Jamming of Moisture Bearing Biomass Feedstocks

We developed and verified a high-performance open-source discrete element method (DEM) solver with simultaneously-supported feedstock-specific interaction models, including bonded-sphere, liquid bridge, cohesion, and non-linear contact models. Our solver uses parallel data structures on hybrid central and graphics processing unit (CPU/GPU) architectures, with favorable strong scaling performance observed for large problem sizes comprised of (100 M particles), and 4X single-node GPU speedup. The particles for corn stover feedstock were conceptualized and calibrated based on experimental measurements and results. Sensitivity analyses demonstrate that the mass flow rate from a wedge hopper is governed primarily by moisture content, friction coefficient, and cohesion energy density. The model is used to reproduce experimentally observed hopper jamming results, highlighting that the experimental no-flow trends can only be achieved by using non-spherical particles, liquid bridge and cohesion models, highlighting the importance of using concurrent feedstock specialized models for the effective representation of biomass material handling problems.

bioenergy↗
DOE OSTI2024

The Effective Fragment Molecular Orbital Method: Achieving High Scalability and Accuracy for Large Systems

The effective fragment molecular orbital (EFMO) method has been developed to predict the total energy of a very large molecular system accurately (with respect to the underlying quantum mechanical method) and efficiently by taking advantage of the locality of strong chemical interactions and employing a two-level hierarchical parallelism. The accuracy of the EFMO method is partly attributed to the accurate and robust intermolecular interaction prediction between distant fragments, in particular, the many-body polarization and dispersion effects, which require the generation of static and dynamic polarizability tensors by solving the coupled perturbed Hartree–Fock (CPHF) and time-dependent HF (TDHF) equations, respectively. Solving the CPHF and TDHF equations is the main EFMO computational bottleneck due to the inefficient (serial) and I/O-intensive implementation of the CPHF and TDHF solvers. In this work, the efficiency and scalability of the EFMO method are significantly improved with a new CPU memory-based implementation for solving the CPHF and TDHF equations that are parallelized by either message passing interface (MPI) or hybrid MPI/OpenMP. Here, the accuracy of the EFMO method is demonstrated for both covalently bonded systems and noncovalently bound molecular clusters by systematically examining the effects of basis sets and a key distance-related cutoff parameter, R cut . R cut determines whether a fragment pair (dimer) is treated by the chosen ab initio method or calculated using the effective fragment potential (EFP) method (separated dimers). Decreasing the value of Rcut increases the number of separated (EFP) dimers, thereby decreasing the computational effort. It is demonstrated that excellent accuracy (<1 kcal/mol error per fragment) can be achieved when using a sufficiently large basis set with diffuse functions coupled with a small R cut value. With the new parallel implementation, the total EFMO wall time is substantially reduced, especially with a high number of MPI ranks. Given a sufficient workload, nearly ideal strong scaling is achieved for the CPHF and TDHF parts of the calculation. For the first time, EFMO calculations with the inclusion of long-range polarization and dispersion interactions on a hydrated mesoporous silica nanoparticle with explicit water solvent molecules (more than 15k atoms) are achieved on a massively parallel supercomputer using nearly 1000 physical nodes. In addition, EFMO calculations on the carbinolamine formation step of an amine-catalyzed aldol reaction at the nanoscale with explicit solvent effects are presented.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

A molecular dynamics study of laser-excited gold

The structural evolution of laser-excited systems of gold has previously been measured through ultrafast MeV electron diffraction. However, there has been a long-standing inability of atomistic simulations to provide a consistent picture of the melting process, leading to large discrepancies between the predicted threshold energy density for complete melting, as well as the transition between heterogeneous and homogeneous melting. We make use of two-temperature classical molecular dynamics simulations utilizing three highly successful interatomic potentials and reproduce electron diffraction data presented by Mo et al. [Science 360, 1451–1455 (2018)]. We recreate the experimental electron diffraction data, employing both a constant and temperature-dependent electron–ion equilibration rate. In all cases, we are able to match time-resolved electron diffraction data, and find consistency between atomistic simulations and experiments, only by allowing laser energy to be transported away from the interaction region. This additional energy-loss pathway, which scales strongly with laser fluence, we attribute to hot electrons leaving the target on a timescale commensurate with melting.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Interacting quantum and classical waves: Resonant and non-resonant energy transfer to electrons immersed in an intense electromagnetic wave

Dynamics of electrons subjected to a constant amplitude classical electromagnetic (EM) wave is investigated as a fundamental, representative problem in the physics of interacting quantum and classical waves. In the nonrelativistic regime (electrons as Schrödinger waves), the electron energy acquires a constant and a time dependent part. Driven by EM waves, both parts scale strongly with the amplitude, but we expect no resonant enhancement since the parallel electron “speed” of nonrelativistic electrons could never match the wave phase velocity. In the relativistic regime (electron as a Klein–Gordon wave), however, a class of electron waves (with parallel speed matching the EM phase speed) are resonantly excited to extremely high energies. Such a direct resonant energy transfer from intense electromagnetic waves constitutes a mechanism that could, in principle, power the most energetic of cosmic rays (this mechanism will work on protons just as well). Some predictions of the theory will, hopefully, be tested in laboratory laser experiments. In conclusion, the nonrelativistic calculations will also be examined in the context of recent experiments using photon-induced near-field electron microscopy in detail.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Cross slip of extended dislocations in face-centered cubic metals through phase-field modeling

Cross slip is a dislocation mechanism that significantly impacts the mechanical behavior of engineering alloys. Here, in this work, we advance a 3D phase-field dislocation dynamics (PFDD) mesoscale technique to simulate cross slip across a broad range of face-centered cubic (FCC) metals. The formulation incorporates elastic anisotropy, an FCC numerical grid, and a high-fidelity representation of the entire γ -surface from density functional theory for eight FCC metals and no adjustable parameters or rules. The relaxed core structures under zero stress for all metals are predicted to extend in plane. The analytical model for stacking fault width agrees well with the PFDD result under the assumption of elastic isotropy but overestimates it under elastic anisotropy, when the degree of anisotropy is large. The dynamic simulations are designed to elucidate the material parameters that influence the propensity for cross slip. Whether cross slip occurs under a non-Schmid stress or to bypass a hard obstacle, the critical stress to cross slip scales strongly with the anisotropic energy coefficient for a screw dislocation.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Physics-inspired spatiotemporal-graph AI ensemble for the detection of higher order wave mode signals of spinning binary black hole mergers

We present a new class of AI models for the detection of quasi-circular, spinning, non-precessing binary black hole mergers whose waveforms include the higher order gravitational wave modes ($\ell$, |m|) = {(2,2), (2,1), (3,3), (3,2), (4,4)}, and mode mixing effects in the $\ell$ = 3, |m| = 2 harmonics. These AI models combine hybrid dilated convolution neural networks to accurately model both short- and long-range temporal sequential information of gravitational waves; and graph neural networks to capture spatial correlations among gravitational wave observatories to consistently describe and identify the presence of a signal in a three detector network encompassing the Advanced LIGO and Virgo detectors. We first trained these spatiotemporal-graph AI models using synthetic noise, using 1.2 million modeled waveforms to densely sample this signal manifold, within 1.7 h using 256 NVIDIA A100 GPUs in the Polaris supercomputer at the Argonne Leadership Computing Facility. This distributed training approach exhibited optimal classification performance, and strong scaling up to 512 NVIDIA A100 GPUs. With these AI ensembles we processed data from a three detector network, and found that an ensemble of 4 AI models achieves state-of-the-art performance for signal detection, and reports two misclassifications for every decade of searched data. We distributed AI inference over 128 GPUs in the Polaris supercomputer and 128 nodes in the Theta supercomputer, and completed the processing of a decade of gravitational wave data from a three detector network within 3.5 h. Finally, we fine-tuned these AI ensembles to process the entire month of February 2020, which is part of the O3b LIGO/Virgo observation run, and found 6 gravitational waves, concurrently identified in Advanced LIGO and Advanced Virgo data, and zero false positives. This analysis was completed in one hour using one NVIDIA A100 GPU.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Optical selection bias and projection effects in stacked galaxy cluster weak lensing

ABSTRACT Cosmological constraints from current and upcoming galaxy cluster surveys are limited by the accuracy of cluster mass calibration. In particular, optically identified galaxy clusters are prone to selection effects that can bias the weak lensing mass calibration. We investigate the selection bias of the stacked cluster lensing signal associated with optically selected clusters, using clusters identified by the redMaPPer algorithm in the Buzzard simulations as a case study. We find that at a given cluster halo mass, the residuals of redMaPPer richness and weak lensing signal are positively correlated. As a result, for a given richness selection, the stacked lensing signal is biased high compared with what we would expect from the underlying halo mass probability distribution. The cluster lensing selection bias can thus lead to overestimated mean cluster mass and biased cosmology results. We show that the lensing selection bias exhibits a strong scale dependence and is approximately 20–60 per cent for ΔΣ at large scales. This selection bias largely originates from spurious member galaxies within ±20–60 $h^{-1}\, \rm Mpc$ along the line of sight, highlighting the importance of quantifying projection effects associated with the broad redshift distribution of member galaxies in photometric cluster surveys. While our results qualitatively agree with those in the literature, accurate quantitative modelling of the selection bias is needed to achieve the goals of cluster lensing cosmology and will require synthetic catalogues covering a wide range of galaxy–halo connection models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Survey of Gravitationally lensed objects in HSC Imaging (SuGOHI). VIII. New galaxy-scale lenses from the HSC SSP

Abstract We conduct a search for galaxy-scale strong gravitational lens systems in Data Release 4 of the Hyper Suprime-Cam Subaru Strategic Program (HSC SSP), consisting of data taken up to the S21A semester. We select 103191 luminous red galaxies from the Baryon Oscillation Spectroscopic Survey (BOSS) sample that have deep multiband imaging from the HSC SSP and use the YattaLens algorithm to identify lens candidates with blue arc-like features automatically. The candidates are visually inspected and graded based on their likelihood of being a lens. We find eight definite lenses, 28 probable lenses, and 138 possible lenses. The new lens candidates generally have lens redshifts in the range 0.3 ≲ zL ≲ 0.9, a key intermediate redshift range to study the evolution of galaxy structure. Follow-up spectroscopy will confirm these new lenses and measure source redshifts to enable detailed lens modeling.

Astronomy & Astrophysics↗
DOE OSTI2025

Modeling the differential rate for signal interactions in coincidence with noise fluctuations or large rate backgrounds

The characteristic energy of a relic dark matter interaction with a detector scales strongly with the putative dark matter mass. Consequently, experimental search sensitivity at the lightest masses will always come from interactions whose size is similar to noise fluctuations and low energy backgrounds in the detector. In this paper, we correctly calculate the net change in measured differential event rate due to low rate signal interactions that overlap in time with noise and backgrounds, accounting for both periods of time when the signal is coincident with noise/backgrounds and for the decreased amount of time in which only noise/backgrounds occur and we show that the introduction of random simulated signal events into the continuous raw data stream (a form of “salting”) provides a correct and practical implementation to estimate this net linear signal sensitivity. Unfortunately this does not apply to the situation with non negligible pileups as we show through explicit examples. Consequently, this exclusion technique should be complemented by less sensitive techniques that can separately exclude large rate, high pileup signal parameter space. An analysis threshold above the Gaussian-like noise component of the measured differential rate spectrum should also likely produce conservative limits. Though previous light mass dark matter searches did not correctly account for decreased background only live time effects in their signal sensitivity, conservative analysis choices likely protected their published limits from being nonconservative.

Li, Xinran↗
DOE OSTI2020

A massively parallel and scalable multi-CPU material point method

Harnessing the power of modern multi-GPU architectures, we present a massively parallel simulation system based on the Material Point Method (MPM) for simulating physical behaviors of materials undergoing complex topological changes, self-collision, and large deformations. Our system makes three critical contributions. First, we introduce a new particle data structure that promotes coalesced memory access patterns on the GPU and eliminates the need for complex atomic operations on the memory hierarchy when writing particle data to the grid. Second, we propose a kernel fusion approach using a new Grid-to-Particles-to-Grid (G2P2G) scheme, which efficiently reduces GPU kernel launches, improves latency, and significantly reduces the amount of global memory needed to store particle data. Finally, we introduce optimized algorithmic designs that allow for efficient sparse grids in a shared memory context, enabling us to best utilize modern multi-GPU computational platforms for hybrid Lagrangian-Eulerian computational patterns. We demonstrate the effectiveness of our method with extensive benchmarks, evaluations, and dynamic simulations with elastoplasticity, granular media, and fluid dynamics. In comparisons against an open-source and heavily optimized CPU-based MPM codebase [Fang et al. 2019] on an elastic sphere colliding scene with particle counts ranging from 5 to 40 million, our GPU MPM achieves over 100x per-time-step speedup on a workstation with an Intel 8086K CPU and a single Quadro P6000 GPU, exposing exciting possibilities for future MPM simulations in computer graphics and computational science. Moreover, compared to the state-of-the-art GPU MPM method [Hu et al. 2019a], we not only achieve 2x acceleration on a single GPU but our kernel fusion strategy and Array-of-Structs-of-Array (AoSoA) data structure design also generalizes to multi-GPU systems. Our multi-GPU MPM exhibits near-perfect weak and strong scaling with 4 GPUs, enabling performant and large-scale simulations on a 10243 grid with close to 100 million particles with less than 4 minutes per frame on a single 4-GPU workstation and 134 million particles with less than 1 minute per frame on an 8-GPU workstation.

Wang, Xinlei↗
DOE OSTI2024

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗
DOE OSTI2024

Should We Conserve Entropy or Energy when Computing CAPE with Mixed-Phase Precipitation Physics?

Abstract The rapidly increasing resolution of global atmospheric reanalysis and climate model datasets necessitates finding methods for computing convective available potential energy (CAPE) both efficiently and accurately. To this end, this article compares two common methods for computing CAPE which conserve either energy or entropy. Inaccuracies in these computations arise from both physical and numerical errors. For instance, computing CAPE with entropy conserved results in physical errors from nonequilibrium phase transitions but minimizes numerical errors because solutions are analytic at each height. In contrast, computing CAPE with energy conserved avoids these physical errors, but accumulates numerical errors that are grid-resolution-dependent because the numerical integration of a differential equation is required. Analysis of CAPE computed with large databases of soundings from the tropical Amazon and midlatitude storm environments shows that physical errors from the entropy method are typically 1%–3% as large as CAPE, which is comparable to the numerical errors from conserving energy with grid spacing of 25 and 250 m using explicit first-order and second-order integration schemes, respectively. Errors in entropy-based CAPE calculations are also insensitive to vertical grid spacing, in contrast to energy-based calculations whose error strongly scales with the grid spacing. It is shown that entropy-based methods are advantageous when intercomparing datasets with differing vertical resolution because they produce accurate and reasonably fast results that are insensitive to grid resolution, whereas a second-order energy-based method is advantageous when analyzing data with a consistent vertical resolution because of its superior computational efficiency. Significance Statement Convective available potential energy (CAPE) is a measure of instability in the atmosphere that helps forecasters and researchers understand when and where thunderstorms will form. The purpose of this article is to identify the most efficient and accurate methods for computing CAPE. Two methods are considered here, one that relates to the entropy (a measure of thermodynamic disorder) of an air parcel and one that relates to the energy of an air parcel. Results indicate that the entropy method is most accurate and insensitive to the resolution of the data used for the calculation (which can vary considerably), whereas the energy method uses the least computation time.

Peters, John M.↗
DOE OSTI2021

AI-driven multiscale simulations illuminate mechanisms of SARS-CoV-2 spike dynamics

We develop a generalizable AI-driven workflow that leverages heterogeneous HPC resources to explore the time-dependent dynamics of molecular systems. We use this workflow to investigate the mechanisms of infectivity of the SARS-CoV-2 spike protein, the main viral infection machinery. Our workflow enables more efficient investigation of spike dynamics in a variety of complex environments, including within a complete SARS-CoV-2 viral envelope simulation, which contains 305 million atoms and shows strong scaling on ORNL Summit using NAMD. We present several novel scientific discoveries, including the elucidation of the spike’s full glycan shield, the role of spike glycans in modulating the infectivity of the virus, and the characterization of the flexible interactions between the spike and the human ACE2 receptor. We also demonstrate how AI can accelerate conformational sampling across different systems and pave the way for the future application of such methods to additional studies in SARS-CoV-2 and other molecular systems.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Enabling rapid COVID-19 small molecule drug design through scalable deep learning of generative models

We improved the quality and reduced the time to produce machine learned models for use in small molecule antiviral design. Our globally asynchronous multi-level parallel training approach strong scales to all of Sierra with up to 97.7% efficiency. We trained a novel, character-based Wasserstein autoencoder that produces a higher quality model trained on 1.613 billion compounds in 23 minutes while the previous state of the art takes a day on 1 million compounds. Reducing training time from a day to minutes shifts the model creation bottleneck from computer job turnaround time to human innovation time. Our implementation achieves 318 PFLOPs for 17.1% of half-precision peak. We will incorporate this model into our molecular design loop enabling the generation of more diverse compounds; searching for novel, candidate antiviral drugs improves and reduces the time to synthesize compounds to be tested in the lab.

Jacobs, Sam Ade↗
DOE OSTI2022

Parthenon—a performance portable block-structured adaptive mesh refinement framework

On the path to exascale the landscape of computer device architectures and corresponding programming models has become much more diverse. While various low-level performance portable programming models are available, support at the application level lacks behind. To address this issue, we present the performance portable block-structured adaptive mesh refinement (AMR) framework Parthenon, derived from the well-tested and widely used Athena++ astrophysical magnetohydrodynamics code, but generalized to serve as the foundation for a variety of downstream multi-physics codes. Parthenon adopts the Kokkos programming model, and provides various levels of abstractions from multidimensional variables, to packages defining and separating components, to launching of parallel compute kernels. Parthenon allocates all data in device memory to reduce data movement, supports the logical packing of variables and mesh blocks to reduce kernel launch overhead, and employs one-sided, asynchronous MPI calls to reduce communication overhead in multi-node simulations. Using a hydrodynamics miniapp, we demonstrate weak and strong scaling on various architectures including AMD and NVIDIA GPUs, Intel and AMD x86 CPUs, IBM Power9 CPUs, as well as Fujitsu A64FX CPUs. At the largest scale on Frontier (the first TOP500 exascale machine), the miniapp reaches a total of 1.7 × 10 13 zone-cycles/s on 9216 nodes (73,728 logical GPUs) at [Formula: see text] weak scaling parallel efficiency (starting from a single node). In combination with being an open, collaborative project, this makes Parthenon an ideal framework to target exascale simulations in which the downstream developers can focus on their specific application rather than on the complexity of handling massively-parallel, device-accelerated AMR.

97 MATHEMATICS AND COMPUTING↗