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 865 records · Page 48

Genarris 2.0: A Random Structure Generator for Molecular Crystals

Genarris is an open source Python package for generating random molecular crystal structures with physical constraints for seeding crystal structure prediction algorithms and training machine learning models. Here we present a new version of the code, containing several major improvements. A MPI-based parallelization scheme has been implemented, which facilitates the seamless sequential execution of user-defined workflows. A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures. A new algorithm has been implemented for generating crystal structures with molecules occupying special Wyckoff positions. A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately. New intermolecular distance settings have been implemented for strong hydrogen bonds. To demonstrate these new features, we study two specific cases: benzene and glycine. Genarris finds the experimental structures of the two polymorphs of benzene and the three polymorphs of glycine. Program summary Program Title: Genarris 2.0 Program Files doi: http://dx.doi.org/10.17632/grx6mz4pjn.1 Licensing provisions: BSD-3 Clause Programming language: Python, C External routines/libraries: Spglib, ASE, pymatgen, SciPy, mpi4py, scikit-learn, PyTorch, FHI-aims. Nature of problem: Molecular crystal structure prediction. Solution method: Genarris 2.0 generates molecular crystal structures over the 230 space groups, on general and special Wyckoff positions, using physical constraints. Down-sampling of the generated structures may be performed subsequently, based on molecular crystal packing descriptors and an unsupervised machine learning algorithm. Lastly, ab initio structure relaxation may be performed for the final pool. Depending on the user-defined workflow implemented, Genarris may be used to generate diverse molecular crystal datasets to seed evolutionary algorithms or to train machine learning algorithms or as a standalone crystal structure prediction method. Restrictions: For crystal structure generation, the molecule of interest must be semi-rigid with no bond rotational degrees of freedom. Unusual features: Genarris 2.0 is a highly distributed program, making use of MPI for Python parallelization. The user has the ability to design and implement workflows by executing a user-defined list of procedures. Genarris 2.0 offers new features including a machine learning model for estimating the molecular volume in the solid state from the single molecule structure, structure generation in special Wyckoff positions of space groups, hierarchical structure checks including rigorous treatment of non-orthogonal structures, and clustering and down-selection workflows combining first principles simulations with machine learning. (C) 2020 Elsevier B.V. All rights reserved.

Crystal structure prediction↗

Parallel fast gauss transform

We present fast adaptive parallel algorithms to compute the sum of N Gaussians at N points. Direct sequential computation of this sum would take O(N{sup 2}) time. The parallel time complexity estimates for our algorithms are O(N/n{sub p}) for uniform point distributions and O( (N/n{sub p}) log (N/n{sub p}) + n{sub p}log n{sub p}) for non-uniform distributions using n{sub p} CPUs. We incorporate a plane-wave representation of the Gaussian kernel which permits 'diagonal translation'. We use parallel octrees and a new scheme for translating the plane-waves to efficiently handle non-uniform distributions. Computing the transform to six-digit accuracy at 120 billion points took approximately 140 seconds using 4096 cores on the Jaguar supercomputer. Our implementation is 'kernel-independent' and can handle other 'Gaussian-type' kernels even when explicit analytic expression for the kernel is not known. These algorithms form a new class of core computational machinery for solving parabolic PDEs on massively parallel architectures.

99 GENERAL AND MISCELLANEOUS↗

Progress with the COGENT Edge Kinetic Code: Implementing the Fokker-Plank Collision Operator

Here, COGENT is a continuum gyrokinetic code for edge plasma simulations being developed by the Edge Simulation Laboratory collaboration. The code is distinguished by application of a fourth-order finite-volume (conservative) discretization, and mapped multiblock grid technology to handle the geometric complexity of the tokamak edge. The distribution function F is discretized in v∥ – μ (parallel velocity – magnetic moment) velocity coordinates, and the code presently solves an axisymmetric full-f gyro-kinetic equation coupled to the long-wavelength limit of the gyro-Poisson equation. COGENT capabilities are extended by implementing the fully nonlinear Fokker-Plank operator to model Coulomb collisions in magnetized edge plasmas. The corresponding Rosenbluth potentials are computed by making use of a finite-difference scheme and multipole-expansion boundary conditions. Details of the numerical algorithms and results of the initial verification studies are discussed. (© 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hierarchical computation in the SPMD programming model

Large-scale parallel machines are programmed mainly with the single program, multiple data (SPMD) model of parallelism. While this model has advantages of scalability and simplicity, it does not fit well with divide-and-conquer parallelism or hierarchical machines that mix shared and distributed memory. In this paper, we define the recursive single program, multiple data model (RSPMD) that extends SPMD with a hierarchical team mechanism to support hierarchical algorithms and machines. We implement this model in the Titanium language and describe how to eliminate a class of deadlocks by ensuring alignment of collective operations. We present application case studies evaluating the RSPMD model, showing that it enables divide-and-conquer algorithms such as sorting to be elegantly expressed and that team collective operations increase performance of conjugate gradient by up to a factor of two. The model also facilitates optimizations for hierarchical machines, improving scalability of particle in cell by 8x and performance of sorting and a stencil code by up to 40% and 14%, respectively.

Kamil, A↗

Separation of rare earth element radioisotopes by reverse-phase high-speed counter-current chromatography

Analytical scale purification of rare earth element (REE) radioisotopes is typically accomplished using cation-exchange resins (e.g. AG 50W-X8) and high-performance liquid chromatography (HPLC). Despite the variety of improvements made since the development of this separation process in the 1950s, nearest neighbor separations remain a challenge, as does the issue of irreversible sample adsorption. Herein, we report a study that evaluates the potential of high-speed counter-current chromatography (HSCCC) as an alternative method for purifying REE elements, with specific reference to separations of fission product REE of interest to nuclear forensics. Complementary HSCCC REE separation experiments, one spiked with radiotracer and REE fission product activity, allowed for in depth analysis of resulting fractions from both an elemental (inductively coupled plasma atomic emission spectroscopy, ICP-AES) and radiological (gamma-ray spectrometry, beta counting) purity perspective. The highly reproducible nature of separation profiles generated from HSCCC instruments was leveraged to simplify work-up of samples containing radioisotopes. Subsequent radioanalytical evaluation revealed minimal carryover of Eu into neighboring Sm and Tb fractions (as indicated by presence of 150Eu), and trace contamination of the Tb fraction with Y (as indicated by presence of 91Y). Subtle differences in stationary phase retention across the two columns were reflected in significant variations in decontamination factors of duplicate parallel separations. Furthermore, these differences paired with obtained distribution of radioisotopes provided valuable insights into future improvements. Collectively, this study represents a significant step forward in development of HSCCC technology for task specific REE radioisotope purification.

07 ISOTOPE AND RADIATION SOURCES↗

Sparse, iterative simulation methods for one-dimensional laminar flames

Sparse, iterative simulation methods for one-dimensional laminar flames are proposed. The resulting steady and unsteady flame solvers exploit approximate Jacobians to greatly reduce the computational cost associated with matrix operations. The constant, non-unity Lewis number assumption is introduced to further reduce the computational cost. The solvers are also parallelized to reduce time-to-solution on distributed memory computer systems. Computed laminar flame speeds and species profiles for a range of chemical mechanisms (from 10 to 2878 species) are compared against a well-validated commercial code and are found to be consistent within solver tolerances. The computation times of both the unsteady and steady solutions increase only linearly with the number of species, which is a significant improvement over the quadratic or cubic scaling of existing steady-state flame solvers. For the largest mechanism tested, the steady-state flame solver is two orders of magnitude faster than commonly-used codes. The use of an approximate Jacobian is shown to reduce the rate of convergence for the steady-state solver, but does not significantly affect the domain of convergence. The steady-state solver with approximate Jacobian is thus well suited for computationally efficient laminar flame speed sweeps with large kinetic mechanisms.

42 ENGINEERING↗

On the use of flux limiters in the discrete ordinates method for 3D radiation calculations in absorbing and scattering media

The application of flux limiters to the discrete ordinates method (DOM), S{sub N}, for radiative transfer calculations is discussed and analyzed for 3D enclosures for cases in which the intensities are strongly coupled to each other such as: radiative equilibrium and scattering media. A Newton-Krylov iterative method (GMRES) solves the final systems of linear equations along with a domain decomposition strategy for parallel computation using message passing libraries in a distributed memory system. Ray effects due to angular discretization and errors due to domain decomposition are minimized until small variations are introduced by these effects in order to focus on the influence of flux limiters on errors due to spatial discretization, known as numerical diffusion, smearing or false scattering. Results are presented for the DOM-integrated quantities such as heat flux, irradiation and emission. A variety of flux limiters are compared to 'exact' solutions available in the literature, such as the integral solution of the RTE for pure absorbing-emitting media and isotropic scattering cases and a Monte Carlo solution for a forward scattering case. Additionally, a non-homogeneous 3D enclosure is included to extend the use of flux limiters to more practical cases. The overall balance of convergence, accuracy, speed and stability using flux limiters is shown to be superior compared to step schemes for any test case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direct pore-level modeling of incompressible fluid flow in porous media

We present a dynamic particle-based model for direct pore-level modeling of incompressible viscous fluid flow in disordered porous media. The model is capable of simulating flow directly in three-dimensional high-resolution micro-CT images of rock samples. It is based on moving particle semi-implicit (MPS) method. We modify this technique in order to improve its stability for flow in porous media problems. Using the micro-CT image of a rock sample, the entire medium, i.e., solid and fluid, is discretized into particles. The incompressible Navier-Stokes equations are then solved for each particle using the MPS summations. The model handles highly irregular fluid-solid boundaries effectively. An algorithm to split and merge fluid particles is also introduced. To handle the computational load, we present a parallel version of the model that runs on distributed memory computer clusters. The accuracy of the model is validated against the analytical, numerical, and experimental data available in the literature. The validated model is then used to simulate both unsteady- and steady-state flow of an incompressible fluid directly in a representative elementary volume (REV) size micro-CT image of a naturally-occurring sandstone with 3.398 {mu}m resolution. We analyze the quality and consistency of the predicted flow behavior and calculate absolute permeability using the steady-state flow rate.

97 MATHEMATICS AND COMPUTING↗

Novel Application of Helical Tomotherapy in Whole Skull Palliative Radiotherapy

Helical tomotherapy (HT) is a radiation planning/delivery platform that combines inversely planned IMRT with on-board megavoltage imaging. A unique HT radiotherapy whole skull brain sparing technique is described in a patient with metastatic prostate cancer. An inverse HT plan and an accompanying back-up conventional lateral 6-MV parallel opposed pair (POP) plan with corresponding isodose distributions and dose-volume histograms (DVH) were created and assessed prior to initiation of therapy. Plans conforming to the planning treatment volume (PTV) with significant sparing of brain, optic nerve, and eye were created. Dose heterogeneity to the PTV target was slightly higher in the HT plan compared to the back-up POP plan. Conformal sparing of brain, optic nerve, and eye was achieved by the HT plan. Similar lens and brain stem/spinal cord doses were seen with both plans. Prospective clinical evaluation with relevant end points (quality of life, symptom relief) are required to confirm the potential benefits of highly conformal therapies applied to palliative situations such as this case.

61 RADIATION PROTECTION AND DOSIMETRY↗

Hyper-resistivity and electron thermal conductivity due to destroyed magnetic surfaces in axisymmetric plasma equilibria

In order to model the effects of small-scale current-driven magnetic fluctuations in a mean-field theoretical description of a large-scale plasma magnetic field B(x,t), a space and time dependent hyper-resistivity {Lambda}(x,t) can be incorporated into the Ohm's law for the parallel electric field E Dot-Operator B. Using Boozer coordinates, a theoretical method is presented that allows for a determination of the hyper-resistivity {Lambda}({psi}) functional dependence on the toroidal magnetic flux {psi} for arbitrary experimental steady-state Grad-Shafranov axisymmetric plasma equilibria, if values are given for the parallel plasma resistivity {eta}({psi}) and the local distribution of any auxiliary plasma current. Heat transport in regions of plasma magnetic surfaces destroyed by resistive tearing modes can then be modeled by an electron thermal conductivity k{sub e}({psi})=({epsilon}{sub 0}{sup 2}m{sub e}/e{sup 2}){Lambda}({psi}), where e and m{sub e} are the electron charge and mass, respectively, while {epsilon}{sub 0} is the permittivity of free space. An important result obtained for axisymmetric plasma equilibria is that the {psi}{psi}-component of the metric tensor of Boozer coordinates is given by the relation g{sup {psi}{psi}}({psi}){identical_to}{nabla}{psi} Dot-Operator {nabla}{psi}=[{mu}{sub 0}G({psi})][{mu}{sub 0}I({psi})]/{iota}({psi}), with {mu}{sub 0} the permeability of free space, G({psi}) the poloidal current outside a magnetic surface, I({psi}) the toroidal current inside a magnetic surface, and {iota}({psi}) the rotational transform.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The local surface plasmon resonance property and refractive index sensitivity of metal elliptical nano-ring arrays

In this paper, we systematically investigate the optical property and refractive index sensitivity (RIS) of metal elliptical nano-ring (MENR) arranged in rectangle lattice by finite-difference time-domain method. Eight kinds of considered MENRs are divided into three classes, namely fixed at the same outer size, at the same inner size, and at the same middle size. All MENR arrays show a bonding mode local surface plasmon resonance (LSPR) peak in the near-infrared region under longitudinal and transverse polarizations, and lattice diffraction enhanced LSPR peaks emerge, when the LSPR peak wavelength (LSPRPW) matches the effective lattice constant of the array. The LSPRPW is determined by the charge moving path length, the parallel and cross interactions induced by the stable distributed charges, and the moving charges inter-attraction. High RIS can be achieved by small particle distance arrays composed of MENRs with big inner size and small ring-width. On the other hand, for a MENR array, the comprehensive RIS (including RIS and figure of merit) under transverse polarization is superior to that under longitudinal polarization. Furthermore, on condition that compared arrays are fixed at the same lattice constant, the phenomenon that the RIS of big ring-width MENR arrays may be higher than that of small ring-width MENR arrays only appears in the case of compared arrays with relatively small lattice constant and composed of MENRs fixed at the same inner size simultaneously. Meanwhile, the LSPRPW of the former MENR arrays is also larger than that of the latter MENR arrays. Our systematic results may help experimentalists work with this type of systems.

36 MATERIALS SCIENCE↗

THREE-DIMENSIONAL SIMULATIONS OF MAGNETIZED SUPERBUBBLES: NEW INSIGHTS INTO THE IMPORTANCE OF MHD EFFECTS ON OBSERVED QUANTITIES

We present three-dimensional magnetohydrodynamic (MHD) simulations of superbubbles, to study the importance of MHD effects in the interpretation of images from recent surveys of the Galactic plane. These simulations focus mainly on atmospheres defined by an exponential density distribution and the Dickey and Lockman density distribution. In each case, the magnetic field is parallel to the Galactic plane and we investigate cases with either infinite scale height (constant magnetic field) or a constant ratio of gas pressure to magnetic pressure. The three-dimensional structure of superbubbles in these simulations is discussed with emphasis on the axial ratio of the cavity as a function of magnetic field strength and the age of the bubble. We investigate systematic errors in the age of the bubble and scale height of the surrounding medium that may be introduced by modeling the data with purely hydrodynamic models. Age estimates derived with symmetric hydrodynamic models fitted to an asymmetric magnetized superbubble can differ by up to a factor of 4, depending on the direction of the line of sight. The scale height of the surrounding medium based on the Kompaneets model may be up to 50% lower than the actual scale height. We also present the first ever predictions of Faraday rotation by a magnetized superbubble based on three-dimensional MHD simulations. We emphasize the importance of MHD effects in the interpretation of observations of superbubbles.

99 GENERAL AND MISCELLANEOUS↗

THE PLUTO CODE FOR ADAPTIVE MESH COMPUTATIONS IN ASTROPHYSICAL FLUID DYNAMICS

We present a description of the adaptive mesh refinement (AMR) implementation of the PLUTO code for solving the equations of classical and special relativistic magnetohydrodynamics (MHD and RMHD). The current release exploits, in addition to the static grid version of the code, the distributed infrastructure of the CHOMBO library for multidimensional parallel computations over block-structured, adaptively refined grids. We employ a conservative finite-volume approach where primary flow quantities are discretized at the cell center in a dimensionally unsplit fashion using the Corner Transport Upwind method. Time stepping relies on a characteristic tracing step where piecewise parabolic method, weighted essentially non-oscillatory, or slope-limited linear interpolation schemes can be handily adopted. A characteristic decomposition-free version of the scheme is also illustrated. The solenoidal condition of the magnetic field is enforced by augmenting the equations with a generalized Lagrange multiplier providing propagation and damping of divergence errors through a mixed hyperbolic/parabolic explicit cleaning step. Among the novel features, we describe an extension of the scheme to include non-ideal dissipative processes, such as viscosity, resistivity, and anisotropic thermal conduction without operator splitting. Finally, we illustrate an efficient treatment of point-local, potentially stiff source terms over hierarchical nested grids by taking advantage of the adaptivity in time. Several multidimensional benchmarks and applications to problems of astrophysical relevance assess the potentiality of the AMR version of PLUTO in resolving flow features separated by large spatial and temporal disparities.

79 ASTRONOMY AND ASTROPHYSICS↗

Gregarious Data Re-structuring in a Many Core Architecture

this paper, we have developed a new methodology that takes in consideration the access patterns from a single parallel actor (e.g. a thread), as well as, the access patterns of “grouped” parallel actors that share a resource (e.g. a distributed Level 3 cache). We start with a hierarchical tile code for our target machine and apply a series of transformations at the tile level to improve data residence in a given memory hierarchy level. The contribution of this paper includes (a) collaborative data restructuring for group reuse and (b) low overhead transformation technique to improve access pattern and bring closely connected data elements together. Preliminary results in a many core architecture, Tilera TileGX, shows promising improvements over optimized OpenMP code (up to 31% increase in GFLOPS) and over our own previous work on fine grained runtimes (up to 16%) for selected kernels

data restructuring↗

Efficient Delaunay Tessellation through K-D Tree Decomposition

Delaunay tessellations are fundamental data structures in computational geometry. They are important in data analysis, where they can represent the geometry of a point set or approximate its density. The algorithms for computing these tessellations at scale perform poorly when the input data is unbalanced. We investigate the use of k-d trees to evenly distribute points among processes and compare two strategies for picking split points between domain regions. Because resulting point distributions no longer satisfy the assumptions of existing parallel Delaunay algorithms, we develop a new parallel algorithm that adapts to its input and prove its correctness. We evaluate the new algorithm using two late-stage cosmology datasets. The new running times are up to 50 times faster using k-d tree compared with regular grid decomposition. Moreover, in the unbalanced data sets, decomposing the domain into a k-d tree is up to five times faster than decomposing it into a regular grid.

Morozov, Dmitriy↗

PETSc DMNetwork: A Library for Scalable Network PDE-Based Multiphysics Simulations

We present DMNetwork, a high-level package included in the PETSc library for the simulation of multiphysics phenomena over large-scale networked systems. The library aims at applications that have networked structures such as those in electrical, gas, and water distribution systems. DMNetwork provides data and topology management, parallelization for multiphysics systems over a network, and hierarchical and composable solvers to exploit the problem structure. DMNetwork eases the simulation development cycle by providing the necessary infrastructure through simple abstractions to define and query the network components. This article presents the design of DMNetwork, illustrates its user interface, and demonstrates its ability to solve multiphysics systems, such as an electric circuit, a network of power grid and water subnetworks, and transient hydraulic systems over large networks with more than 2 billion variables on extreme-scale computers using up to 30,000 processors.

extreme-scale computing↗

HydraGNN v5.0

HydraGNN v5.0 expands the code base into a more portable, scalable, and flexible framework for scientific graph learning, with particular strength in atomistic machine-learning interatomic potentials and large-scale distributed training. The release adds Fully Sharded Data Parallel (FSDP) support alongside existing DDP and DeepSpeed paths, including FSDP-aware checkpointing and optimizer integration, and introduces a configurable multi-precision training workflow supporting FP32, BF16, and FP64 across GPUs and Intel XPUs. For atomistic modeling, HydraGNN v5.0 strengthens its MLIP capabilities through dynamic graph construction at every forward pass, energy-conserving force prediction via automatic differentiation, and per-atom energy loss formulations, while extending EGNN models to properly handle periodic boundary conditions. The release also broadens model expressiveness through graph-level attribute conditioning, adds new multi-task and model-parallel extensions such as MACE support and encoder/decoder branch optimization, and expands application coverage with integrated examples for datasets including OC25, Nabla2-DFT, QCML, Open Polymers 2026, and OPF. In parallel, HydraGNN v5.0 improves production readiness through performance optimizations for large-scale runs, stratified sampling and linear-regression preprocessing utilities, and tested installation scripts for DOE supercomputers including Frontier, Aurora, Perlmutter, and Andes. Overall, the release advances HydraGNN as a robust software platform for scalable graph neural networks across materials science, chemistry, and scientific machine learning workflows

Lupo Pasini, Massimiliano [Oak Ridge National Labo↗