Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel Processing”

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 235 records · Page 13

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗

BM3DORNL

BM3DORNL is a high-performance, open-source library for removing streak and ring artifacts from computed-tomography (CT) data, developed for neutron imaging at Oak Ridge National Laboratory's Spallation Neutron Source (VENUS beamline) and applicable to X-ray CT as well. Ring artifacts — concentric rings in reconstructed slices caused by detector pixel-to-pixel response non-uniformities — appear as vertical streaks in the sinogram and degrade both image quality and quantitative analysis. BM3DORNL operates in the sinogram domain using an adaptation of the BM3D (block-matching and 3D collaborative filtering) algorithm (Dabov et al., 2007). It provides a dedicated streak-removal mode, a true multi-scale BM3D variant (after Mäkinen et al., 2021) that suppresses wide streaks single-scale methods miss, and an alternative Fourier–SVD method (~2.6× faster) combining FFT-based energy detection with rank-1 SVD. The computationally intensive core is implemented in Rust with parallel (Rayon) block matching, integral-image pre-screening, and optimized transforms, and is exposed through a simple Python API (with an optional GUI) so it integrates directly into existing tomography reconstruction pipelines. It processes both 2D sinograms and 3D sinogram stacks, is pip-installable for Linux and macOS, and is documented at https://bm3dornl.readthedocs.io.

Zhang, Chen [Oak Ridge National Laboratory (ORNL),↗

Anisotropic Tensile Properties of a 14YWT Nanostructured Ferritic Alloy: On the Role of Cleavage Fracture

Two plates of nanostructured ferritic alloy NFA-1 were processed by ball milling atomized Fe-14Cr-3W-0.4Ti-0.2Y (wt.%) with FeO powders, canning, and hot-extrusion at 850 °C, followed by annealing and multipass cross-rolling at 1000 °C. This produces a severe (001) brittle cleavage texture on planes running parallel to the plate faces. In the first plate (P1), pre-existing microcracks (MCs) formed on the cleavage planes during cross-rolling. The second plate (P2) contained far fewer, if any, MCs. Here, we compare the tensile data for out-of-plane (S) and in-plane (L) tensile axis orientations, at temperatures from −196 °C to 800 °C. We also assess the tensile property differences between P1 and P2, and the effect of specimen size. The L-orientation strength and ductility were excellent; for example, the room temperature (RT) yield stress, σy ≈ 1042 ± 102 MPa, and the total elongation, εt ≈ 12.9 ± 1.5%. In contrast, the S-orientation RT σy ≈ 708 ± 57 MPa, and εt ≤ 0.2%. These differences were due to cleavage on the brittle (001) planes. Cleavage leads to beneficial delamination toughening, but is deleterious to deformation processing and through-wall heat transfer. Therefore, it is important to quantitatively characterize the pronounced NFA-1 strength anisotropy due to severe crystallographic texturing and cleavage fracture.

Crystallography↗

PIAFS: A 2D nonlinear hydrodynamics code to model gaseous optics

The survivability of final optics is expected to be a major challenge for all future inertial fusion energy concepts. Due to their higher damage threshold, gaseous optics have been identified as a promising solution to this problem. Gaseous optics can be created through the photoabsorption of spatially modulated UV light, which induces various chemical processes that heat the gas. This heating leads to a pressure perturbation, which in turn launches a density perturbation that can imprint a refractive index modulation such as a grating. In this article, we introduce a parallel C/C++ code to simulate gaseous optics. PIAFS2D is a high-order conservative finite-difference code to solve the compressible Navier–Stokes equations along with the photochemical heating sources on Cartesian grids. The simulations are validated by the linear theory derived in a previous paper [Michel et al., Phys. Rev. Appl. 22, 024014 (2024)]. For larger perturbations, the behavior of the system—particularly the evolution of the generated acoustic wave—demonstrates strong nonlinearity. PIAFS2D allows the study of nonlinear behaviors and can be used for the design of high-efficiency gaseous optics elements in realistic experimental conditions.

Oudin, A. [Lawrence Livermore National Laboratory ↗

Sustainable aviation fuels from biomass and biowaste via bio- and chemo-catalytic conversion: Catalysis, process challenges, and opportunities

Sustainable aviation fuel (SAF) production from biomass and biowaste streams is an attractive option for decarbonizing the aviation sector, one of the most-difficult-to-electrify transportation sectors. Despite ongoing commercialization efforts using ASTM-certified pathways (e.g., lipid conversion, Fischer-Tropsch synthesis), production capacities are still inadequate due to limited feedstock supply and high production costs. New conversion technologies that utilize lignocellulosic feedstocks are needed to meet these challenges and satisfy the rapidly growing market. Combining bio- and chemo-catalytic approaches can leverage advantages from both methods, i.e., high product selectivity via biological conversion, and the capability to build C-C chains more efficiently via chemical catalysis. Herein, conversion routes, catalysis, and processes for such pathways are discussed, while key challenges and meaningful R&D opportunities are identified to guide future research activities in the space. Bio and chemo-catalytic conversion primarily utilize the carbohydrate fraction of lignocellulose, leaving lignin as a waste product. This makes lignin conversion to SAF critical in order to utilize whole biomass, thereby lowering overall production costs while maximizing carbon efficiencies. Thus, lignin valorization strategies are also reviewed herein with vital research areas identified, such as facile lignin depolymerization approaches, highly integrated conversion systems, novel process configurations, and catalysts for the selective cleavage of aryl C–O bonds. The potential efficiency improvements available via integrated conversion steps, such as combined biological and chemo-catalytic routes, along with the use of different parallel pathways, are identified as key to producing all components of a cost-effective, 100% SAF.

09 BIOMASS FUELS↗

The development and applications of multidimensional biomolecular spectroscopy illustrated by photosynthetic light harvesting

The parallel and synergistic developments of atomic resolution structural information, new spectroscopic methods, their underpinning formalism, and the application of sophisticated theoretical methods have led to a step function change in our understanding of photosynthetic light harvesting, the process by which photosynthetic organisms collect solar energy and supply it to their reaction centers to initiate the chemistry of photosynthesis. The new spectroscopic methods, in particular multidimensional spectroscopies, have enabled a transition from recording rates of processes to focusing on mechanism. We discuss two ultrafast spectroscopies – two-dimensional electronic spectroscopy and two-dimensional electronic-vibrational spectroscopy – and illustrate their development through the lens of photosynthetic light harvesting. Both spectroscopies provide enhanced spectral resolution and, in different ways, reveal pathways of energy flow and coherent oscillations which relate to the quantum mechanical mixing of, for example, electronic excitations (excitons) and nuclear motions. The new types of information present in these spectra provoked the application of sophisticated quantum dynamical theories to describe the temporal evolution of the spectra and provide new questions for experimental investigation. While multidimensional spectroscopies have applications in many other areas of science, we feel that the investigation of photosynthetic light harvesting has had the largest influence on the development of spectroscopic and theoretical methods for the study of quantum dynamics in biology, hence the focus of this review. We conclude with key questions for the next decade of this review.

59 BASIC BIOLOGICAL SCIENCES↗

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗

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]↗

pnnl/LAP

A software framework to study, from the performance and energy perspective, the efficacy of GPU-resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process

Swirydowicz, Kasia↗

On-lattice kinetic Monte Carlo approaches for modeling molecular anisotropy in resveratrol crystallization

Stilbenes are a class of organic compounds with broad-ranging pharmaceutical and agricultural applications, which are typically isolated and purified through recrystallization. We are motivated by reducing experimental waste and optimizing yield via developing predictive simulations for processing-dependent crystal morphologies. Using resveratrol as a model stilbene system, we have developed an approach for simulating crystallization with molecular resolution using on-lattice kinetic Monte Carlo. In this work, we highlight modifications to the Stochastic Parallel PARticle Kinetic Simulator (SPPARKS) software package, which were essential to this application. Key enhancements include the incorporation of non-orthogonal cell shapes and monomer anisotropy approximations using bound hard spheres. This new SPPARKS application has been applied to resveratrol with attachment energy libraries obtained from density functional theory, resulting in excellent agreement with experimental morphology prediction.

crystallization↗

Noncollinear ground states of solids with a source-free exchange correlation functional

In this paper, we expand upon the source-free (SF) exchange correlation (XC) functional developed by Sangeeta Sharma and coworkers to plane-wave density functional theory (DFT) based on the projector augmented wave (PAW) method. This constraint is implemented by the current authors within the VASP source code, using a fast Poisson solver that capitalizes on the parallel three-dimensional fast Fourier transforms (FFTs) implemented in VASP. Using this modified XC functional, we explore the improved convergence behavior that results from applying this constraint to the GGA-PBE+U+J functional. In the process, we compare the noncollinear magnetic ground state computed by each functional and their SF counterpart for a select number of magnetic materials in order to provide a metric for comparing with experimentally determined magnetic orderings. We observe significantly improved agreement with experimentally measured magnetic ground-state structures after applying the source-free constraint. Furthermore, we explore the importance of considering probability current densities in spin-polarized systems, even under no applied field. We analyze the XC torque as well, in order to provide theoretical and computational analyses of the net XC magnetic torque induced by the source-free constraint. Along these lines, we highlight the importance of properly considering the real-space integral of the source-free local magnetic XC field. Our analyses on probability currents, net torque, and constant terms draw additional links to the rich body of previous research on spin-current density functional theory (SCDFT), and pave the way for future extensions and corrections to the SF corrected XC functional.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗

ChatHPC: Building the Foundations for a Productive and Trustworthy AI-Assisted HPC Ecosystem

ChatHPC democratizes large language models for the high-performance computing (HPC) community by providing the infrastructure, ecosystem, and knowledge needed to apply modern generative AI technologies to rapidly create specific capabilities for critical HPC components while using relatively modest computational resources. Our divide-and-conquer approach focuses on creating a collection of reliable, highly specialized, and optimized AI assistants for HPC based on the cost-effective and fast Code Llama fine-tuning processes and expert supervision. We target major components of the HPC software stack, including programming models, runtimes, I/O, tooling, and math libraries. Thanks to AI, ChatHPC provides a more productive HPC ecosystem by boosting important tasks related to portability, parallelization, optimization, scalability, and instrumentation, among others. With relatively small datasets (on the order of KB), the AI assistants, which are created in a few minutes by using one node with two NVIDIA H100 GPUs and the ChatHPC library, can create new capabilities with Meta’s 7-billion parameter Code Llama base model to produce high-quality software with a level of trustworthiness of up to 90% higher than the 1.8-trillion parameter OpenAI ChatGPT-4o model for critical programming tasks in the HPC software stack.

Young, Aaron [ORNL] (ORCID:0000000254484667)↗

Temporal Properties of Compressible Magnetohydrodynamic Turbulence

Describing the temporal properties of compressible magnetohydrodynamic (MHD) turbulence is a fundamental problem that has important implications for particle acceleration and transport in astrophysical plasmas. Here, by carefully analyzing the spatial and temporal properties of compressible MHD turbulence, we derive a new spectral power density function that is supported by simulations. This new function reveals that the low-frequency fluctuations are dominated by modes with small parallel wavenumbers with respect to the mean background magnetic field. Furthermore, for fluctuations with dynamically significant parallel wavenumbers, broadening around their eigenfrequencies is described by this function, which is in close agreement with simulations. We use this formalism to present the scaling properties of individual MHD modes. Such broadening is a direct consequence of nonlinear processes and is different for the three fundamental MHD modes. Our results provide a new window to investigate the temporal properties of turbulence and will enable further studies on the interaction between compressible MHD turbulence and energetic plasmas.

79 ASTRONOMY AND ASTROPHYSICS↗

The Influence of Residual Stress on Fatigue Crack Growth Rates in Stainless Steel Processed by Different Additive Manufacturing Methods

The properties and microstructure of Type 304L stainless steel produced by two additive manufacturing (AM) methods—directed energy deposition (DED) and powder bed fusion (PBF)—are evaluated and compared. Localized heating and steep temperature gradients of AM processes lead to significant residual stress and distinctive microstructures, which may be process-specific and influence mechanical behavior. Test data show that materials produced by DED and PDF have small differences in tensile strengths but clear differences in residual stress and microstructural features. Measured fatigue crack growth rates (FCGRs) for cracks propagating parallel to and perpendicular to the build directions differ between the two AM materials. To separate the influences of residual stress and microstructure, K-control test procedures with decreasing and constant stress intensity factor ranges are used to measure FCGRs in the near-threshold regime (crack growth rates ≤ 1 × 10 −8 m/cycle). Residual stress is quantified by the residual stress intensity factor, K res , measured by the online crack compliance method. Correcting the FCGR data for differences in K res brings results for specimens of the two AM materials into agreement with each other and with results for wrought specimens, when the latter are corrected for crack closure. Differences in microstructure and tensile strength have an insignificant influence on FCGRs in these tests.

additive manufacturing↗

Accelerating Thermochemical Equilibrium Calculations for Nuclear Reactor Applications

Thermochemical properties play a key role in modeling and simulation of several key phenomena in nuclear reactors. There has been an increasing interest in incorporating CALPHAD-based formulations in multiphysics simulations including for Molten Salt Reactors where knowledge of phase evolution of the salt and the chemical potentials of various elements are of utmost importance in source term analyses and redox control. However, the size of such simulations is often limited by the high computational cost of full thermodynamic equilibrium calculations. This work discusses the current efforts aimed at accelerating thermochemical equilibrium calculations for multiphysics simulations performed using the open-source finite element / finite volume code Multiphysics Object Oriented Simulation Environment (MOOSE) [1]. While several methods have been proposed for accelerating phase equilibrium calculations [2], most focus on relatively small systems and often rely on a- priori knowledge of the state-space of the system. Nuclear materials, however, are often multi-component systems owing to the evolution of composition under irradiation and an approach based on a-priori mapping of phase diagram is often not enough. This work is aimed at demonstrating an on-the-fly surrogate modeling framework that uses active learning to reduce the number of full equilibrium calculations that must be performed. By combining with efficient coupling approaches, the surrogate framework helps in reducing the computational cost of thermodynamic equilibrium informed multiphysics simulations of nuclear materials. The performance is benchmarked against full coupling with the thermochemistry library Thermochimica [3]. This work uses a machine learning based approach for constructing surrogate models to predict the stable phases in a multicomponent system. The surrogates were constructed using neural networks and Gaussian process classification. In this work, we compare the relative performance of the two methods. We also demonstrate the use of caching previous calculations by interpolating the values from nearest neighbors. References [1] Lindsay, A.D., et al. "2.0 – MOOSE: Enabling massively parallel multiphysics simulation", SoftwareX, 20 (2022): 101202. [2] Roos, W.A. and Zietsman J.H. "Accelerating complex chemical equilibrium calculations – A Review", Calphad, 77 (2022): 102380. [3] Piro, M.H.A., et al. "The thermochemistry library Thermochimica", Computational Materials Science, 67 (2013): 266-272.

36 MATERIALS SCIENCE↗

Solidification and crystallographic texture modeling of laser powder bed fusion Ti-6Al-4V using finite difference-monte carlo method

Laser powder bed fusion (LPBF) additive manufacturing makes near-net-shaped parts with reduced material cost and time, rising as a promising technology to fabricate Ti-6Al-4V, a widely used titanium alloy in aerospace and medical industries. However, LPBF Ti-6Al-4V parts produced with 67° rotation between layers, a scan strategy commonly used to reduce microstructure and property inhomogeneity, have varying grain morphologies and weak crystallographic textures that change depending on processing parameters. Here, this study predicts LPBF Ti-6Al-4V solidification at three energy levels using a finite difference-Monte Carlo method and validates the simulations with large-area electron backscatter diffraction (EBSD) scans. The developed model accurately shows that a <001> texture forms at low energy and a <111> texture occurs at higher energies parallel to the build direction but with a lower strength than the textures observed from EBSD. A validated and well-established method of combining spatial correlation and general spherical harmonics representation of texture is developed to calculate a difference score between simulations and experiments. The quantitative comparison enables effective fine-tuning of nucleation density (N 0 ) input, which shows a nonlinear relationship with increasing energy level. Future improvements in texture prediction code and a more comprehensive study of N 0 with different energy levels will further advance the optimization of LPBF Ti-6Al-4V components. These developments contribute a novel understanding of crystallographic texture formation in LPBF Ti-6Al-4V, the development of robust model validation and calibration pipeline methodologies, and provide a platform for mechanical property prediction and process parameter optimization.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗