SEARCH · Search NASA

Results for “parallel, 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Three‐Dimensional Magnetic Reconnection Spreading in Current Sheets of Non‐Uniform Thickness

Abstract Magnetic reconnection in naturally occurring and laboratory settings often begins locally and elongates, or spreads, in the direction perpendicular to the plane of reconnection. Previous work has largely focused on current sheets with a uniform thickness, for which the predicted spreading speed for anti‐parallel reconnection is the local speed of the current carriers. We derive a scaling theory of three‐dimensional (3D) spreading of collisionless anti‐parallel reconnection in a current sheet with its thickness varying in the out‐of‐plane direction, both for spreading from a thinner to thicker region and a thicker to thinner region. We derive an expression for calculating the time it takes for spreading to occur for a current sheet with a given profile of its thickness. A key result is that when reconnection spreads from a thinner to a thicker region, the spreading speed in the thicker region is slower than both the Alfvén speed and the speed of the local current carriers by a factor of the ratio of thin to thick current sheet thicknesses. This is important because magnetospheric and solar observations have previously measured the spreading speed to be slower than previously predicted, so the present mechanism might explain this feature. We confirm the theory via a parametric study using 3D two‐fluid numerical simulations. We use the prediction to calculate the time scale for reconnection spreading in Earth's magnetotail during geomagnetic activity. The results are also potentially important for understanding reconnection spreading in solar flares and the dayside magnetopause of Earth and other planets.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2018

A Reduced-Order Aggregated Model for Parallel Inverter Systems with Virtual Oscillator Control

This paper introduces a reduced-order aggregated model for parallel-connected inverters controlled with virtual oscillator control (VOC). The premise of VOC is to modulate inverter dynamics to emulate those of nonlinear oscillators with the goal of realizing a stable ac microgrid in the absence of communication, synchronous generation, or a stiff grid. To obtain a reduced-order model for a system of parallel-connected inverters with VOC, we first formulate a set of scaling laws that describe how the controller and filter parameters of a given inverter depend on its voltage and power rating. Subsequently, we show that N parallel inverters which adhere to this scaling law can be modeled with the same structure and hence the same computational burden of the model of a single inverter. The proposed aggregate model is experimentally validated on a system of three parallel inverters with heterogeneous power ratings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2018

A Reduced-Order Aggregated Model for Parallel Inverter Systems with Virtual Oscillator Control: Preprint

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Parallel physics-informed neural networks via domain decomposition

Here we develop a distributed framework for the physics-informed neural networks (PINNs) based on two recent extensions, namely conservative PINNs (cPINNs) and extended PINNs (XPINNs), which employ domain decomposition in space and in time-space, respectively. This domain decomposition endows cPINNs and XPINNs with several advantages over the vanilla PINNs, such as parallelization capacity, large representation capacity, efficient hyperparameter tuning, and is particularly effective for multi-scale and multi-physics problems. Here, we present a parallel algorithm for cPINNs and XPINNs constructed with a hybrid programming model described by MPI + X, where X ∈ {CPUs, GPUs}. The main advantage of cPINN and XPINN over the more classical data and model parallel approaches is the flexibility of optimizing all hyperparameters of each neural network separately in each subdomain. We compare the performance of distributed cPINNs and XPINNs for various forward problems, using both weak and strong scalings. Our results indicate that for space domain decomposition, cPINNs are more efficient in terms of communication cost but XPINNs provide greater flexibility as they can also handle time-domain decomposition for any differential equations, and can deal with any arbitrarily shaped complex subdomains. To this end, we also present an application of the parallel XPINN method for solving an inverse diffusion problem with variable conductivity on the United States map, using ten regions as subdomains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1998

Influence of Subpixel Scale Cloud Top Structure on Reflectances from Overcast Stratiform Cloud Layers

Recent observational studies have shown that satellite retrievals of cloud optical depth based on plane-parallel model theory suffer from systematic biases that depend on viewing geometry, even when observations are restricted to overcast marine stratus layers, arguably the closest to plane parallel in nature. At moderate to low sun elevations, the plane-parallel model significantly overestimates the reflectance dependence on view angle in the forward-scattering direction but shows a similar dependence in the backscattering direction. Theoretical simulations are performed that show that the likely cause for this discrepancy is because the plane-parallel model assumption does not account for subpixel, scale variations in cloud-top height (i.e., "cloud bumps"). Monte Carlo simulation, comparing ID model radiances to radiances from overcast cloud field with 1) cloud-top height variation, but constant cloud volume extinction; 2) flat tops but horizontal variations in cloud volume extinction; and 3) variations in both cloud top height and cloud extinction are performed over a approximately equal to 4 km x 4 km domain (roughly the size of an individual GAC AVHRR pixel). The comparisons show that when cloud-top height variations are included, departures from 1D theory are remarkably similar (qualitatively) to those obtained observationally. In contrast, when clouds are assumed flat and only cloud extinction is variable, reflectance differences are much smaller and do not show any view-angle dependence. When both cloud-top height and cloud extinction variations are included, however, large increases in cloud extinction variability can enhance reflectance difference. The reason 3D-1D reflectance differences are more sensitive to cloud-top height variations in the forward-scattering direction (at moderate to low, sun elevations) is because photons leaving the cloud field in that direction experience fewer scattering events (low-order scattering) and are restricted to the topmost portions of the cloud. While reflectance deviations from 1D theory are much larger for bumpy clouds than for flat clouds with variable cloud extinction, differences in cloud albedo are comparable for these two cases.

Loeb, N. G.↗

DOE OSTI2020

Enabling Large-Scale Condensed-Phase Hybrid Density Functional Theory Based Ab Initio Molecular Dynamics. 1. Theory, Algorithm, and Performance

By including a fraction of exact exchange (EXX), hybrid functionals reduce the self-interaction error in semilocal density functional theory (DFT) and thereby furnish a more accurate and reliable description of the underlying electronic structure in systems throughout biology, chemistry, physics, and materials science. However, the high computational cost associated with the evaluation of all required EXX quantities has limited the applicability of hybrid DFT in the treatment of large molecules and complex condensed-phase materials. To overcome this limitation, we describe a linear-scaling approach that utilizes a local representation of the occupied orbitals (e.g., maximally localized Wannier functions (MLWFs)) to exploit the sparsity in the real-space evaluation of the quantum mechanical exchange interaction in finite-gap systems. In this work, we present a detailed description of the theoretical and algorithmic advances required to perform MLWF-based ab initio molecular dynamics (AIMD) simulations of large-scale condensed-phase systems of interest at the hybrid DFT level. We focus our theoretical discussion on the integration of this approach into the framework of Car–Parrinello AIMD, and highlight the central role played by the MLWF-product potential (i.e., the solution of Poisson’s equation for each corresponding MLWF-product density) in the evaluation of the EXX energy and wave function forces. We then provide a comprehensive description of the exx algorithm implemented in the open-source Quantum ESPRESSO program, which employs a hybrid MPI/OpenMP parallelization scheme to efficiently utilize the high-performance computing (HPC) resources available on current- and next-generation supercomputer architectures. Furthermore, this is followed by a critical assessment of the accuracy and parallel performance (e.g., strong and weak scaling) of this approach when AIMD simulations of liquid water are performed in the canonical (NVT) ensemble. With access to HPC resources, we demonstrate that exx enables hybrid DFT-based AIMD simulations of condensed-phase systems containing 500–1000 atoms (e.g., (H₂O)₂₅₆) with a wall time cost that is comparable to that of semilocal DFT. In doing so, exx takes us one step closer to routinely performing AIMD simulations of complex and large-scale condensed-phase systems for sufficiently long time scales at the hybrid DFT level of theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗

DOE OSTI2023

Staged cooling of a fusion-grade plasma in a tokamak thermal quench

Abstract In tokamak disruptions where the magnetic connection length becomes comparable to or even shorter than the plasma mean-free-path, parallel transport can dominate the energy loss and the thermal quench of the core plasma goes through four phases (stages) that have distinct temperature ranges and durations. The main temperature drop occurs while the core plasma remains nearly collisionless, with the parallel electron temperature T e ∥ dropping in time t as T e ∥ ∝ t − 2 and a cooling time that scales with the ion sound wave transit time over the length of the open magnetic field line. These surprising physics scalings are the result of effective suppression of parallel electron thermal conduction in an otherwise bounded, quasineutral, and collisionless plasma, which is different from what are known to date on electron thermal conduction along the magnetic field in a nearly collisionless and quasineural plasma.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1993

Electron velocity space hole modes

In space plasmas the local electron distribution is formed by ballistic motion from different source regions. Since electrons with positive and negative parallel (v-parallel) velocities have different sources and experience different interactions with the large-scale electromagnetic fields, the electron distribution function near v-parallel = 0 should possess considerable structure, including the possibility of velocity space holes, i.e., regions where the phase space density is zero, and sharp discontinuities. A particular hole distribution, which may occur upstream of slow shocks in the distant geomagnetic tail, is shown to support a nonstandard plasma wave mode with frequencies between the ion and electron plasma frequencies and parallel phase speed above the ion, but well below the electron, thermal speed. The hole mode can be destabilized by a positive slope in the low parallel velocity electron distribution, and the growth rate is strongly enhanced if the electron parallel temperature exceeds the perpendicular temperature; the mode can also be excited by a hot, fast ion beam. The hole modes exist only for a narrow range of propagation angles about the magnetic field direction.

Coroniti, Ferdinand V.↗

DOE OSTI2018

Multi-petascale highly efficient parallel supercomputer

A Multi-Petascale Highly Efficient Parallel Supercomputer of 100 petaflop-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC). The ASIC nodes are interconnected by a five dimensional torus network that optimally maximize the throughput of packet communications between nodes and minimize latency. The network implements collective network and a global asynchronous network that provides global barrier and notification functions. Integrated in the node design include a list-based prefetcher. The memory system implements transaction memory, thread level speculation, and multiversioning cache that improves soft error rate at the same time and supports DMA functionality allowing for parallel processing message-passing.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1998

Globalized Newton-Krylov-Schwarz Algorithms and Software for Parallel Implicit CFD

Implicit solution methods are important in applications modeled by PDEs with disparate temporal and spatial scales. Because such applications require high resolution with reasonable turnaround, "routine" parallelization is essential. The pseudo-transient matrix-free Newton-Krylov-Schwarz (Psi-NKS) algorithmic framework is presented as an answer. We show that, for the classical problem of three-dimensional transonic Euler flow about an M6 wing, Psi-NKS can simultaneously deliver: globalized, asymptotically rapid convergence through adaptive pseudo- transient continuation and Newton's method-, reasonable parallelizability for an implicit method through deferred synchronization and favorable communication-to-computation scaling in the Krylov linear solver; and high per- processor performance through attention to distributed memory and cache locality, especially through the Schwarz preconditioner. Two discouraging features of Psi-NKS methods are their sensitivity to the coding of the underlying PDE discretization and the large number of parameters that must be selected to govern convergence. We therefore distill several recommendations from our experience and from our reading of the literature on various algorithmic components of Psi-NKS, and we describe a freely available, MPI-based portable parallel software implementation of the solver employed here.

Gropp, W. D.↗

NASA NTRS1993

Parallel Object-Oriented Computation Applied to a Finite Element Problem

The conventional wisdom in the scientific computing community is that the best way to solve large-scale numerically intensive scientific problems on today's parallel MIMD computers is to use Fortran or C programmed in a data-parallel style using low-level message-passing primitives. This approach inevitably leads to nonportable codes, extensive development time, and restricts parallel programming to the domain of the expert programmer. We believe that these problems are not inherent to parallel computing but are the result of the tools used. We will show that comparable performance can be achieved with little effort if better tools that present higher level abstractions are used.

parallel object-oriented computation scientific pr↗

NASA NTRS2019

Fully-Coupled Fluid-Structure Interaction Simulations of a Supersonic Parachute

A validated computational fluid-structure interaction method for simulating the complex interaction between the large deformation of very thin, highly deformable structures and compressible flows is extended to consider large-scale problems in supersonic flows using parallel computing. The coupled fluid-structure interaction system is solved in a partitioned, or weakly-coupled, manner. The foundations of the applied fluid-structure interaction method are a higher-order, block-structured Cartesian, sharp immersed boundary method for the compressible Navier-Stokes equations and a computational structural dynamics solver employing a geometrically nonlinear 3-node shell element based on the mixed interpolation of tensorial components formulation. The method is applied to large deformation fluid-structure interaction validation cases before being applied to the inflation of a supersonic parachute in the upper Martian atmosphere where the goal is to demonstrate the capabilities of the solver when considering large-scale problems in supersonic flows.

Boustani, Jonathan↗

DOE OSTI2017

Approximate Computing Techniques for Iterative Graph Algorithms

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

Panyala, Ajay R.↗

DOE OSTI2023

Scalable Graph Analytics and HPC Operational Enhancement: Parallel Computing and ML/DL Innovations

Parallel computing plays a pivotal role in the efficient processing of large-scale graphs. Complex network analysis stands as a capti- vating research frontier, holding promise across diverse scientific domains such as sociology, biology, online media, and recommenda- tion systems. In this era, Machine Learning (ML) and Deep Learning (DL) have emerged as indispensable tools, underpinning remarkable technological achievements. Within this dynamic landscape, my research revolves around advancing parallel algorithms tailored for large-scale graph operations. To achieve this, I harness the power of cutting-edge technologies including OpenMP, MPI, HIP, and CUDA, on the High-Performance Computing (HPC) platforms to unlock optimal performance. I also apply ML/DL techniques to HPC operational data, to streamline the monitoring and maintenance of supercomputers, alleviating the complexities associated with their upkeep and enhancing user support. My research echoes the syn- ergy between parallel computing, large-scale graph analysis, and ML/DL, improving computational efficiency and user experience.

Sattar, Naw Safrin↗

DOE OSTI2025

Effects of Galactic Irradiation on Thermal and Electronic Transport in Tungsten

The impact of irradiation on the thermal and electronic properties of materials is a persistent puzzle, particularly defect formation at the atomic and nanoscales. This work examines the nanoscale effects of low-energy irradiation on tungsten (W), focusing on defect-induced modifications to thermal and electronic transport. Using the site-projected thermal conductivity (SPTC) method [A. Gautam et al. PSS-RRL, 2400306, 2024], bulk and twin-grain boundary W with vacancy defects based on the Norgett–Robinson–Torrens displacements per atom model is analyzed. SPTC provides a detailed prediction of postcascade spatial thermal conductivity distribution. Electronic conductivity activity is estimated using the “N 2 method” [K. Nepal et al. Carbon, 119711, 2025] to explore the consequences of vacancies and grain boundaries, highlighting the defect-dependent nature of charge transport behavior. These findings offer high-resolution insights into irradiation-driven transport phenomena, with implications for space-exposed materials and nanoscale thermal/electronic management.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2018

Establishing mesh topology in multi-material cells: enabling technology for robust and accurate multi-material simulations

Real world problems are typically multi-material, combining materials such as gases, liquids and solids that have very different properties. The material interfaces may be fixed in time or can be a part of the solution, as in fluid-structure interactions or air-water dynamics, and therefore move and change shape. In such problems the computational mesh may be non-conformal to interfaces due to complexity of these interfaces, presence of small fractions of materials, or because the mesh does not move with the flow, as in the arbitrary Lagrangian–Eulerian (ALE) methods. In order to solve problems of interest on such meshes, interface reconstruction methods are usually used to recover an approximation of material regions within the cells. For a cell intersecting multiple material regions, these approximations of contained subregions can be considered as single-material subcells in a local mesh that we call a minimesh. In this paper, we discuss some of the requirements that discretization methods have on topological information in the resulting hierarchical meshes and present an approach that allows incorporating the buildup of sufficiently detailed topology into the nested dissections based PLIC-type reconstruction algorithms (e.g. Volume-of-Fluid, Moment-of-Fluid) in an efficient and robust manner. Specifically, we describe the X-MOF interface reconstruction algorithm in 2D, which extends the Moment-Of-Fluid (MOF) method to include the topology of minimeshes created inside of multi-material cells and parent-child relations between corresponding mesh entities on different hierarchy levels. X-MOF retains the property of being local to a cell and not requiring external communication, which makes it suitable for massively parallel applications. Here, we demonstrate some scaling results for the X-MOF implementation in Tangram, a modern interface reconstruction framework for exascale computing.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Preconditioning a Newton-Krylov solver for all-speed melt pool flow physics

n this paper, we introduce a multigrid block-based preconditioner for solving linear systems arising from a Discontinuous Galerkin discretization of the all-speed Navier-Stokes equations with phase change. The equations are discretized in conservative form with a reconstructed Discontinuous Galerkin (rDG) method and integrated with fully-implicit time discretization schemes. To robustly converge the numerically stiff systems, we use the Newton-Krylov framework with a primitive-variable formulation (pressure, velocity, and temperature), which is better conditioned than the conservative-variable form at low-Mach number. In the limit of large acoustic CFL number and viscous Fourier number, there is a strong coupling between the velocity-pressure system and the linear systems become non-diagonally dominant. To effectively solve these ill-conditioned systems, an approximate block factorization preconditioner is developed, which uses the Schur complement to reduce a 3 x 3 block system into a sequence of two 2 x 2 block systems: velocity-pressure,v P , and velocity-temperature, v T . We compare the performance of the v P -v T Schur complement preconditioner to classic preconditioning strategies: monolithic algebraic multigrid (AMG), element-block SOR, and primitive variable block Gauss-Seidel. The performance of the preconditioned solver is investigated in the limit of large CFL and Fourier numbers for low-Mach lid-driven cavity flow, Rayleigh-Bénard melt convection, compressible internally heated convection, and 3D laser-induced melt pool flow. Here, numerical results demonstrate that the v P -v T Schur complement preconditioned solver scales well both algorithmically and in parallel, and is robust for highly ill-conditioned systems, for all tested rDG discretization schemes (up to 4th-order).

97 MATHEMATICS AND COMPUTING↗