Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed parallelization”

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 721 records · Page 40

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

Storing files in a parallel computing system based on user or application specification

Techniques are provided for storing files in a parallel computing system based on a user-specification. A plurality of files generated by a distributed application in a parallel computing system are stored by obtaining a specification from the distributed application indicating how the plurality of files should be stored; and storing one or more of the plurality of files in one or more storage nodes of a multi-tier storage system based on the specification. The plurality of files comprise a plurality of complete files and/or a plurality of sub-files. The specification can optionally be processed by a daemon executing on one or more nodes in a multi-tier storage system. The specification indicates how the plurality of files should be stored, for example, identifying one or more storage nodes where the plurality of files should be stored.

97 MATHEMATICS AND COMPUTING↗

Stochastic density functional theory

Linear-scaling implementations of density functional theory (DFT) reach their intended efficiency regime only when applied to systems having a physical size larger than the range of their Kohn–Sham density matrix (DM). This causes a problem since many types of large systems of interest have a rather broad DM range and are therefore not amenable to analysis using DFT methods. For this reason, the recently proposed stochastic DFT (sDFT), avoiding exhaustive DM evaluations, is emerging as an attractive alternative linear-scaling approach. This review develops a general formulation of sDFT in terms of a (non)orthogonal basis representation and offers an analysis of the statistical errors (SEs) involved in the calculation. Using a new Gaussian-type basis-set implementation of sDFT, applied to water clusters and silicon nanocrystals, it demonstrates and explains how the standard deviation and the bias depend on the sampling rate and the system size in various types of calculations. We also develop a basis-set embedded-fragments theory, demonstrating its utility for reducing the SEs for energy, density of states and nuclear force calculations. Finally, we discuss the algorithmic complexity of sDFT, showing it has CPU wall-time linear-scaling. Lastly, the method parallelizes well over distributed processors with good scalability and therefore may find use in the upcoming exascale computing architectures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi-task Parallelism for Robust Pre-training of Graph Foundation Models on Multi-source, Multi-fidelity Atomistic Modeling Data

Graph foundation models using graph neural networks promise sustainable, efficient atomistic modeling. To tackle challenges of processing multi-source, multi-fidelity data during pre-training, recent studies employ multi-task learning, in which shared message passing layers initially process input atomistic structures regardless of source, then route them to multiple decoding heads that predict data-specific outputs. This approach stabilizes pre-training and enhances a model’s transferability to unexplored chemical regions. Preliminary results on approximately four million structures are encouraging, yet questions remain about generalizability to larger, more diverse datasets and scalability on supercomputers. We propose a multi-task parallelism method that distributes each head across computing resources with GPU acceleration. Implemented in the open-source HydraGNN architecture, our method was trained on over 24 million structures from five datasets and tested on the Perlmutter, Aurora, and Frontier supercomputers, demonstrating efficient scaling on all three highly heterogeneous super-computing architectures.

Lupo Pasini, Massimiliano [ORNL] (ORCID:0000000249↗

The Improved Thermal Conductivity of a Potting Material for High-Power Fast Warm-Up Cathodes

With higher power, frequency and longer life of microwave tubes, cathode heater assembly is being modified to enhance the warm-up performance and reliability, which are governed by ceramics thermal conductivity, electrical resistivity and shrinkage. In present work, a potting material with a high thermal conductivity of 22.14 W/(m K) and low linear shrinkage of 5.5% was prepared using two kinds of alumina powders with different size and morphology. Aqueous slurries were produced for centrifugal casting. The highest solid loading slurries with 70 vol.% were obtained. Green body with relative density above 70% was easily made from slurries using centrifugal casting. Relative sintered density reached 86.75% maximum without any sintering aids. Rheological behavior of slurries, potting microstructure, sintering shrinkage and thermal conductivity were analyzed. Continuous particle distribution, series and parallel models were used to guide the powders proportion and explain the thermal conductivity. The potting material thermal conductivity experimental data agreed with the series and parallel models when the weight parameter ξ was between 0.3 and 0.5.

36 MATERIALS SCIENCE↗

Parallel streaming between heterogeneous HPC resources for real-time analysis

Performing analysis or generating visualizations concurrently with high performance simulations can yield great benefits compared to post-processing data. Writing and reading large volumes of data can be reduced or eliminated, thereby producing an I/O cost savings. One such method for concurrent simulation and analysis is in transit - streaming data from the resource running the simulation to a separate resource running the analysis. In transit analysis can be beneficial since computational resources may not have certain resources needed for visualization and analysis (e.g. GPUs) and to reduce the impact of performing analysis tasks to the run time of the simulation. When sending and receiving data in transit, data redistribution mechanisms are needed in order to support heterogeneous data layouts that may be required by the simulation and analysis applications. The work described in this paper compares two mechanisms for on-the-fly data redistribution when streaming data in parallel between two distributed memory applications. Finally, our results show that it is often more advantageous to stream data in the same layout as the sender and redistribute data amongst processes on the receiving end than to stream data in the final layout needed by the receiver.

97 MATHEMATICS AND COMPUTING↗

Magnetohydrodynamic pressure drop and flow balancing of liquid metal flow in a prototypic fusion blanket manifold

Understanding magnetohydrodynamic (MHD) phenomena associated with the flow of electrically conducting fluids in complex geometry ducts subject to a strong magnetic field is required to effectively design liquid metal (LM) blankets for fusion reactors. Specifically, accurately predicting the 3D MHD pressure drop and flow distribution is important. To explore these topics, we simulate a LM MHD flow through an electrically non-conducting prototypic manifold for a wide range of flow and geometry parameters using a 3D MHD solver, HyPerComp incompressible MHD solver for arbitrary geometry. The reference manifold geometry consists of a rectangular feeding duct which suddenly expands such that the duct thickness in the magnetic field direction abruptly increases by a factor r exp . Downstream of the sudden expansion, the LM is distributed into several parallel channels. As a first step in qualifying the flow, a magnitude of the curl of the induced Lorentz force was used to distinguish between inviscid, irrotational core flows and boundary and internal shear layers where inertia and/or viscous forces are important. Scaling laws have been obtained which characterize the 3D MHD pressure drop and flow balancing as a function of the flow parameters and the manifold geometry. Associated Hartmann and Reynolds numbers in the computations were ~10 3 and ~10 1 -10 3 , respectively, while r exp was varied from 4 to 12. An accurate model for the pressure drop was developed for the first time for inertial-electromagnetic and viscous-electromagnetic regimes based on 96 computed cases. Analysis reflects that flow balance can be improved by lengthening the distance between the manifold inlet and the entrances of the parallel channels by utilizing the effect of flow transitioning to a quasi-two-dimensional state in the expansion region of the manifold.

42 ENGINEERING↗

Dissociative photoionization of NO across a shape resonance in the XUV range using circularly polarized synchrotron radiation

We report benchmark results for dissociative photoionization (DPI) spectroscopy and dynamics of the NO molecule in the region of the σ* shape resonance in the ionization leading to the NO + (c 3 Π) ionic state. The experimental study combines well characterized extreme ultraviolet (XUV) circularly polarized synchrotron radiation, delivered at the DESIRS beamline (SOLEIL), with ion-electron coincidence 3D momentum spectroscopy. The measured (N + , e) kinetic energy correlation diagrams reported at four discrete photon energies in the extended 23-33 eV energy range allow for resolving the different active DPI reactions and underline the importance of spectrally resolved studies using synchrotron radiation in the context of time-resolved studies where photoionization is induced by broadband XUV attosecond pulses. In the dominant DPI reaction which leads to the NO + (c 3 Π) ionic state, photoionization dynamics across the σ* shape resonance are probed by molecular frame photoelectron angular distributions where the parallel and perpendicular transitions are highlighted, as well as the circular dichroism CDAD(θ e ) in the molecular frame. The latter also constitute benchmark references for molecular polarimetry. The measured dynamical parameters are well described by multichannel Schwinger configuration interaction calculations. Finally, similar results are obtained for the DPI spectroscopy of highly excited NO + electronic states populated in the explored XUV photon energy range.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PHASE-AVERAGED SPECTRA AND LUMINOSITIES OF GAMMA-RAY EMISSIONS FROM YOUNG ISOLATED PULSARS

We study the phase-averaged spectra and luminosities of {gamma}-ray emissions from young, isolated pulsars within a revised outer gap model. In the revised version of the outer gap, there are two possible cases for the outer gaps: the fractional size of the outer gap is estimated through the photon-photon pair process in the first case (Case I), and is limited by the critical field lines in the second case (Case II). The fractional size is described by Case I if the fractional size at the null charge surface in Case I is smaller than that in Case II, and vice versa. Such an outer gap can extend from the inner boundary, whose radial distance to the neutron star is less than that of the null charge surface to the light cylinder for a {gamma}-ray pulsar with a given magnetic inclination. When the shape of the outer gap is determined, assuming that high-energy emission at an averaged radius of the field line in the center of the outer gap, with a Gaussian distribution of the parallel electric field along the gap height, represents typical emission, the phase-averaged {gamma}-ray spectrum for a given pulsar can be estimated in the revised model with three model parameters. We apply the model to explain the phase-averaged spectra of the Vela (Case I) and Geminga (Case II) pulsars. We also use the model to fit the phase-averaged spectra of 54 young, isolated {gamma}-ray pulsars, and then calculate the {gamma}-ray luminosities and compare them with the observed data from Fermi-LAT.

79 ASTRONOMY AND ASTROPHYSICS↗

Bifurcation-like transition of divertor conditions induced by X-point radiation in KSTAR L-mode plasmas *

Abstract Density ramps with ion grad B drift directed into lower single null KSTAR L-mode plasmas are associated with a simultaneous and abrupt reduction of the divertor particle flux on both low- and high-field-side targets when the mid-plane line averaged electron density reaches a given level. Target embedded Langmuir probe signals show a clear ‘cliff edge’ behavior similar to that observed in the divertor target electron temperature in DIII-D H-mode plasmas (Eldon et al 2017 Nucl. Fusion 57 066039; McLean et al 2015 J. Nucl. Mater. 463 533–6). The collapse of the particle flux is observed along the whole divertor target area (from private flux region to the far scrape-off layer (SOL)). The critical upstream density of this target flux cliff is invariant under fuel gas throughput modulation. The transition along the cliff occurs in tens of milliseconds. With the cliff, carbon impurities and deuterium neutrals transported through the X-point to the core produce a strong radiation spot near the X-point, seen on bolometric signals, and increase the upstream density. The experimental observations are consistent with time-dependent SOLPS-ITER simulations, which also demonstrate an abrupt transition of the target flux and upstream density with the increase in X-point radiation. The timescale of the cliff predicted by SOLPS-ITER is consistent with the experiment, although, it is influenced by gas throughput or time-dependent numerical methods. In the L-mode phase space of separatrix electron density and temperature, branches are divided based on target temperature, because the latter is strongly coupled to the radiation front and ionization front due to the monotonic characteristic of the parallel electron temperature distribution. Since the H-mode condition operates at a much higher upstream density and electron temperature in phase space, dissipation from sputtered carbon alone leads to the density limit before reaching the X-point radiation condition. This is therefore consistent with the fact that cliffs have never been observed in H-mode KSTAR experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A semi-automated algorithm for designing stellarator divertor and limiter plates and application to HSX

We present a semi-automated algorithm for designing three-dimensional divertor or limiter plates targeting low heat loads. The algorithm designs the plates in two stages: firstly, the parallel heat flux distribution is caught on vertically-inclined plates at one or several toroidal locations. Secondly, the power per unit area is reduced by stretching, tilting and bending the plates toroidally. Heat transport is modelled using the EMC3-Lite code, which uses an anisotropic diffusion model. We apply this scheme to HSX, a medium-sized stellarator located at the University of Wisconsin–Madison. Starting from the current machine with an extended vessel wall, we construct plates which are able to effectively catch and spread the heat for three different magnetic configurations. The scheme has a computational cost in the order of tens of CPU-minutes, making it a powerful tool for semi-automated plasma-facing component design in three-dimensional environments.

anisotropic diffusion↗

First results of the silicon telescope using an 'artificial retina' for fast track finding

We present the first results of the prototype of a silicon tracker with trigger capabilities based on a novel approach for fast track finding. The working principle of the 'artificial retina' is inspired by the processing of visual images by the brain and it is based on extensive parallelization of data distribution and pattern recognition. The algorithm has been implemented in commercial FPGAs in three main logic modules: a switch for the routing of the detector hits, a pool of engines for the digital processing of the hits, and a block for the calculation of the track parameters. The architecture is fully pipelined and allows the reconstruction of real-time tracks with a latency less then 100 clock cycles, corresponding to 0.25 microsecond at 400 MHz clock. The silicon telescope consists of 8 layers of single-sided silicon strip detectors with 512 strips each. The detector size is about 10 cm x 10 cm and the strip pitch is 183 μm. The detectors are read out by the Beetle chip, a custom ASICs developed for LHCb, which provides the measurement of the hit position and pulse height of 128 channels. The 'artificial retina' algorithm has been implemented on custom data acquisition boards based on FPGAs Xilinx Kintex 7 lx160. The parameters of the tracks detected are finally transferred to host PC via USB 3.0. The boards manage the read-out ASICs and the sampling of the analog channels. The read-out is performed at 40 MHz on 4 channels for each ASIC that corresponds to a decoding of the telescope information at 1.1 MHz. We report on the first results of the fast tracking device and compare with simulations. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Grid-Forming and Grid-Following Inverter Comparison of Droop Response

With the increase in penetration of inverter-based resources (IBRs) in the electrical power system, the ability of these devices to provide grid support to the system has become a necessity. With standards previously developed for the interconnection requirements of grid-following inverters (GFLI) (most commonly photovoltaic inverters), it has been well documented how these inverters “should” respond to changes in voltage and frequency. However, with other IBRs such as grid-forming inverters (GFMIs) (used for energy storage systems, standalone systems, and as uninterruptable power supplies) these requirements are either: not yet documented, or require a more in deep analysis. With the increased interest in microgrids, GFMIs that can be paralleled onto a distribution system have become desired. With the proper control schemes, a GFMI can help maintain grid stability through fast response compared to rotating machines. This paper will present an experimental comparison of commercially available GFMI and GFLI ' responses to voltage and frequency deviation, as well as the GFMI operating as a standalone system and subjected to various changes in loads.

Grid Support, Inverter, Droop Control, Volt-VAR, F↗

Optimizing the Weather Research and Forecasting Model with OpenMP Offload and Codee

Currently, the Weather Research and Forecasting model (WRF) utilizes shared memory (OpenMP) and distributed memory (MPI) parallelisms. To take advantage of GPU resources on the Perlmutter supercomputer at NERSC, we port parts of the computationally expensive routine Fast Spectral Bin Microphysics (FSBM) to NVIDIA GPUs using OpenMP device offloading directives. To facilitate this process, we explore a workflow for optimization which uses both runtime profilers and a static code inspection tool Codee to refactor the subroutine. We observe an 2.24x overall speedup for the CONUS-12km storm test case.

Wichitrnithed, Chayanon (Namo) [Odin Institute]↗

Massively parallel direct numerical simulations of forced compressible turbulence: a hybrid MPI/OpenMP approach. In:XSEDE '12 Proceedings of the 1st Conference of the Extreme Science and Engineering Discovery Environment: Bridging from the eXtreme to the campus and beyond, Article No. 23

A highly scalable simulation code for turbulent flows which solves the fully compressible Navier-Stokes equations is presented. The code, which supports one, two and three dimensional domain decompositions is shown to scale well on up to 262,144 cores. Introducing multiple levels of parallelism based on distributed message passing and shared-memory paradigms results in a reduction of up to 33% of communication time at large core counts. The code has been used to generate a large database of homogeneous isotropic turbulence in a stationary state created by forcing the largest scales in the flow. The scaling of spectra of velocity and density fluctuations are presented. While the former follow classical theories strictly valid for incompressible flows, the latter presents a more complicated behavior. Fluctuations in velocity gradients and derived quantities exhibit extreme though rare fluctuations, a phenomenon known as intermittency. The simulations presented provide data to disentangle Reynolds and Mach number effects.

Jagannathan, Shriram↗