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 1,693 records · Page 94

Electrochemical leaching of spent LIBs: Kinetics, novel reactor, and modeling

The use of electrons as main reagent for the recovery and recycling of critical metals from spent lithium-ion batteries (LIBs) is a process electrification strategy that can be used to close the life-cycle loop of LIBs through more sustainable methods. Electrochemical leaching, a process that uses a reductant that is constantly regenerated electrochemically for the leaching of lithium-ion battery black mass (LIBBM), has shown high extraction efficiencies and sustainable scores. However, slow kinetics, reactor design challenges and lack of deeper understanding of the underlying processes are barriers to the optimization, scale-up, and market adoption of this technology. In this paper, a kinetic study and mathematical model for dissolving LIBBM is presented to better understand the underlying mechanisms aiming to reduce the processing time and make predictions for future design and scale-up. The effect of acid and electrochemically mediated reductant concentrations, LIBBM loading, and cathode/reactor designs were explored. As a result, the leaching time was reduced from 7h to under 1h at a pulp density of 73 g/L, without external heating. A novel reactor with parallel baffle electrodes (PBE) was developed, which significantly reduced the leaching time by improving convection in a stirred slurry electrochemical reactor. Dimensionless numbers were deduced from an unsteady state model, which can be used in dimensional analysis for future process design and scale-up.

25 ENERGY STORAGE↗

Semicoherent symmetric quantum processes: Theory and applications

Discovering pragmatic and efficient approaches to construct ε-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior ε-approximations are invaluable, in that they enable the compilation of classical and quantum algorithm modeling of, e.g., dynamical and thermodynamic quantum properties. In parallel, symmetries are powerful tools concisely describing the fundamental laws of nature; the symmetric underpinnings of physical laws have consistently provided profound insights and substantially increased predictive power. In this work, we consider the interplay between the ε-approximate processes and the exact symmetries in a semicoherent context—where measurements occur at each logical clock cycle. Here we draw inspiration from Pascual Jordan's groundbreaking formulation of nonassociative, but commutative, symmetric algebraic form. Our symmetrized formalism is then applied in various domains such as quantum random walks, real-time evolutions, variational algorithm ansatzes, and efficient entanglement verification. Our work paves the way for a deeper understanding and greater appreciation of how symmetries can be used to control quantum dynamics in settings where coherence is a limited resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A scalable approach to solving dense linear algebra problems on hybrid CPU-GPU systems

Aiming to fully exploit the computing power of all CPUs and all graphics processing units (GPUs) on hybrid CPU-GPU systems to solve dense linear algebra problems, in this paper we design a class of heterogeneous tile algorithms to maximize the degree of parallelism, to minimize the communication volume, and to accommodate the heterogeneity between CPUs and GPUs. The new heterogeneous tile algorithms are executed upon our decentralized dynamic scheduling runtime system, which schedules a task graph dynamically and transfers data between compute nodes automatically. The runtime system uses a new distributed task assignment protocol to solve data dependencies between tasks without any coordination between processing units. By overlapping computation and communication through dynamic scheduling, we are able to attain scalable performance for the double-precision Cholesky factorization and QR factorization. Finally, our approach demonstrates a performance comparable to Intel MKL on shared-memory multicore systems and better performance than both vendor (e.g., Intel MKL) and open source libraries (e.g., StarPU) in the following three environments: heterogeneous clusters with GPUs, conventional clusters without GPUs, and shared-memory systems with multiple GPUs.

97 MATHEMATICS AND COMPUTING↗

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

In previous work, we have introduced a mathematical model for solving a discretized version of the process family design problem. This involves two sets of decision variables. One set selects which unit module designs are included in the process platform out of a candidate set of options; the other set determines which of these unit module designs are assigned to each variant. In this work, we exploit a parallelized Progressive Hedging (PH) algorithm to solve even larger scale design problems. PH is a well-known algorithm traditionally used to solve stochastic programming problems. While our problem is not a two-stage stochastic programming problem, the structure is similar, and it can be directly mapped to the PH approach, which we employ here to solve this deterministic optimization problem. We decompose our problem by process variant. We treat the platform unit module design variables as first-stage and the assignment of unit module designs to variants as second-stage, solving the problem using mpi-sppy. We demonstrate this approach on case studies of CC, water desalination, and refrigeration.

Stinchfield, Georgia↗

Shedding New Light On Exploding Stars: Terascale Simulations of Neutrino-Driven Supernovae and their Nucleosynthesis

This project was focused on simulations of core-collapse supernovae on parallel platforms. The intent was to address a number of linked issues: the treatment of hydrodynamics and neutrino diffusion in two and three dimensions; the treatment of the underlying nuclear microphysics that governs neutrino transport and neutrino energy deposition; the understanding of the associated nucleosynthesis, including the r-process and neutrino process; the investigation of the consequences of new neutrino phenomena, such as oscillations; and the characterization of the neutrino signal that might be recorded in terrestrial detectors. This was a collaborative effort with Oak Ridge National Laboratory, State University of New York at Stony Brook, University of Illinois at Urbana-Champaign, University of California at San Diego, University of Tennessee at Knoxville, Florida Atlantic University, North Carolina State University, and Clemson. The collaborations tie together experts in hydrodynamics, nuclear physics, computer science, and neutrino physics. The University of Washington contributions to this effort include the further development of techniques to solve the Bloch-Horowitz equation for effective interactions and operators; collaborative efforts on developing a parallel Lanczos code; investigating the nuclear and neutrino physics governing the r-process and neutrino physics; and exploring the effects of new neutrino physics on the explosion mechanism, nucleosynthesis, and terrestrial supernova neutrino detection.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Task parallel sensitivity analysis and parameter estimation of groundwater simulations through the SALSSA framework

The Support Architecture for Large-Scale Subsurface Analysis (SALSSA) provides an extensible framework, sophisticated graphical user interface, and underlying data management system that simplifies the process of running subsurface models, tracking provenance information, and analyzing the model results. Initially, SALSSA supported two styles of job control: user directed execution and monitoring of individual jobs, and load balancing of jobs across multiple machines taking advantage of many available workstations. Recent efforts in subsurface modelling have been directed at advancing simulators to take advantage of leadership class supercomputers. We describe two approaches, current progress, and plans toward enabling efficient application of the subsurface simulator codes via the SALSSA framework: automating sensitivity analysis problems through task parallelism, and task parallel parameter estimation using the PEST framework.

99 GENERAL AND MISCELLANEOUS↗

Exploratory Investigation of Coal in Nonequilibrium Plasma

Coal is an abundant natural resource and there is motivation to find new uses for it that do not intrinsically involve combustion. One approach is to explore new ways of processing coal, and in this work, we focus on the transformation of coal in a nonequilibrium plasma generated from an equimolar mixture of nitrogen and hydrogen. The outcome of the nonequilibrium plasma reaction is fundamentally different than a thermal control reaction carried out using the same gas composition, pressure, and temperature range. The nonequilibrium plasma produces a gas mixture that is enriched in acetylene and its derivatives. Furthermore, when compared to the thermal control experiment, the solid char byproduct of the nonequilibrium plasma has a very reactive surface and is spontaneously combustible at ambient temperature. Experiments performed to characterize the reaction kinetics of coal in the plasma suggest that the mechanism proceeds through a sequential process by which the coal particle temperature rises to a point where devolatilization can occur, the devolatilization reaction happens, followed by parallel reactions of released organic vapors in the plasma phase and surface activation. In conclusion, the reaction rate appears to be limited by the time it takes for the coal particle temperature to rise, consistent with previous results reported for reactions of coal in thermal plasma.

Acetylene↗

NSTX-U advances in real-time deterministic PCIe-based internode communication

Distributing control mechanisms across modern commercial off the shelf (COTS) GNU/Linux systems often introduces difficult to mitigate non-deterministic behavior. Existing methods to address this problem involve non-real-time technologies such as Remote Direct Memory Access (RDMA) over Infiniband or custom Ethernet solutions, such as RDMA over Converged Ethernet (RoCE) or userspace Ethernet drivers, that trade determinism for ease of use or lower cost. The National Spherical Torus Experiment Upgrade (NSTX-U) is pursuing a new design that allows direct communication between heterogeneous systems with scalable, microsecond latency with 1 μs of jitter on that latency, outside of the constant transmission delay at the physical layer. The future design of the NSTX-U Real-time Communication System will utilize direct PCIe-to-PCIe communication with kernel support tuned for low overhead, allowing two (or more, through a switch) real-time (RT) systems to communicate and share resources as one larger entity. As a result, this greatly increases the processing capability of the primary Plasma Control System (PCS), turning previously insurmountable computational challenges into a more manageable divide and conquer parallel task.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

MD simulations of resistive cooling in HITRAP using GPUs

In the HITRAP facility at GSI it is planned to store 10{sup 5} highly charged ions up to U{sup 92+} in a cryogenic Penning trap and cool them down to 4 K via electron and resistive cooling. During the cooling process the ion density increases and the characteristics of the ion cloud are increasingly determined by Coulomb interactions. We present a parallel algorithm for the simulation of the resistive cooling for ion clouds in cylindrical Penning traps. For the simulation of the resistive cooling we run an Open Cl code on a single GPU device.

43 PARTICLE ACCELERATORS↗

EVOLUTION OF MAGNETIC FIELDS IN HIGH-MASS STAR FORMATION: LINKING FIELD GEOMETRY AND COLLAPSE FOR THE W51 e2/e8 CORES

We report our observational results of 870 {mu}m continuum emission and its linear polarization in the massive star formation site W51 e2/e8. Inferred from the linear polarization maps, the magnetic field in the plane of sky (B{sub perpendicular}) is traced with an angular resolution of 0.''7 with the Submillimeter Array. Whereas previous BIMA observations with an angular resolution of 3'' (0.1 pc) showed a uniform B field, our revealed B{sub perpendicular} morphology is hourglass-like in the collapsing core near the ultracompact H II region e2 and also possibly in e8. The decrease in polarization near the continuum peak seen at lower angular resolution is apparently due to the more complex structures at smaller scales. In e2, the pinched direction of the hourglass-like B-field morphology is parallel to the plane of the ionized accretion flow traced by H53{alpha}, suggesting that the massive stars are formed via processes similar to the low-mass stars, i.e., accretion through a disk, except that the mass involved is much larger. Furthermore, our finding that the resolved collapsing cores in e2 and e8 lie within one subcritical 0.5 pc envelope supports the scenario of magnetic fragmentation via ambipolar diffusion. We therefore suggest that magnetic fields control the dynamical evolution of the envelope and cores in W51 e2 and e8.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MTUQ: a framework for estimating moment tensors, point forces, and their uncertainties

SUMMARY We introduce MTUQ, an open-source Python package for seismic source estimation and uncertainty quantification, emphasizing flexibility and operational scalability. MTUQ provides MPI-parallelized grid search and global optimization capabilities, compatibility with 1-D and 3-D Green’s function database formats, customizable data processing, C-accelerated waveform and first-motion polarity misfit functions, and utilities for plotting seismic waveforms and visualizing misfit and likelihood surfaces. Applicability to a range of full- and constrained-moment tensor, point force, and centroid inversion problems is possible via a documented application programming interface, accompanied by example scripts and integration tests. We demonstrate the software using three different types of seismic events: (1) a 2009 intraslab earthquake near Anchorage, Alaska; (2) an episode of the 2021 Barry Arm landslide in Alaska; and (3) the 2017 Democratic People’s Republic of Korea underground nuclear test. With these events, we illustrate the well-known complementary character of body waves, surface waves, and polarities for constraining source parameters. We also convey the distinct misfit patterns that arise from each individual data type, the importance of uncertainty quantification for detecting multimodal or otherwise poorly constrained solutions, and the software’s flexible, modular design.

58 GEOSCIENCES↗

SU-E-T-806: Very Fast GPU-Based IMPT Dose Computation

Purpose: Designing particle therapy treatment plans is a dosimetrist-in-the-loop optimization wherein the conflicting constraints of achieving a desired tumor dose distribution must be balanced against the need to minimize the dose to nearby OARs. IMPT introduces an additional, inner, numerical optimization step in which the dosimetrist’s current set of constraints are used to determine the weighting of beam spots. Very fast dose calculations are needed to enable the dosimetrist to perform many iterations of the outer optimization in a commercially reasonable time. Methods: We have developed a GPU-based convolution-type dose computation algorithm that more accurately handles heterogeneities than earlier algorithms by redistributing energy from dose computed in a water volume. The depth dependence of the beam size is handled by pre-processing Bragg curves using a weighted superposition of Gaussian bases. Additionally, scattering, the orientation of treatment ports, and the non-parallel propagation of beams are handled by large, but sparse, energy-redistribution matrices that implement affine transforms. Results: We tested our algorithm using a brain tumor dataset with 1 mm voxels and a single treatment port from the patient’s anterior through the sinuses. The resulting dose volume is 100 × 100 × 230 mm with 66,200 beam spots on a 3 × 3 × 2 mm grid. The dose computation takes <1 msec on a GeForce GTX Titan GPU with the Gamma passing rate for 2mm/2% criterion of 99.1% compared to dose calculated by an alternative dose algorithm based on pencil beams. We will present comparisons to Monte Carlo dose calculations. Conclusion: Our high-speed dose computation method enables the IMPT spot weights to be optimized in <1 second, resulting in a nearly instantaneous response to user changes to dose constraints. This permits the creation of higher quality plans by allowing the dosimetrist to evaluate more alternatives in a short period of time.

60 APPLIED LIFE SCIENCES↗

Noncontact catalysis: Initiation of selective ethylbenzene oxidation by Au cluster-facilitated cyclooctene epoxidation

Traditionally, a catalyst functions by direct interaction with reactants. In a new noncontact catalytic system (NCCS), an intermediate produced by one catalytic reaction serves as an intermediary to enable an independent reaction to proceed. An example is the selective oxidation of ethylbenzene, which could not occur in the presence of either solubilized Au nanoclusters or cyclooctene, but proceeded readily when both were present simultaneously. The Au-initiated selective epoxidation of cyclooctene generated cyclooctenyl peroxy and oxy radicals that served as intermediaries to initiate the ethylbenzene oxidation. This combined system effectively extended the catalytic effect of Au. The reaction mechanism was supported by reaction kinetics and spin trap experiments. NCCS enables parallel reactions to proceed without the constraints of stoichiometric relationships, offering new degrees of freedom in industrial hydrocarbon co-oxidation processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An LLVM Instrumentation Plug-in for Score-P

Reducing application runtime, scaling parallel applications to higher numbers of processes/threads, and porting applications to new hardware architectures are tasks necessary in the software development process. Therefore, developers have to investigate and understand application runtime behavior. Tools such as monitoring infrastructures that capture performance relevant data during application execution assist in this task. The measured data forms the basis for identifying bottlenecks and optimizing the code.Monitoring infrastructures need mechanisms to record application activities in order to conduct measurements. Automatic instrumentation of the source code is the preferred method in most application scenarios. We introduce a plug-in for the LLVM infrastructure that enables automatic source code instrumentation at compile-time. In contrast to available instrumentation mechanisms in LLVM/Clang, our plug-in can selectively include/exclude individual application functions. This enables developers to fine-tune the measurement to the required level of detail while avoiding large runtime overheads due to excessive instrumentation.

Tschüter, Ronny↗

Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver

We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off inter-process communication for selective memory duplication, (2) multi-GPU support for both NVIDIA GPUs and AMD GPUs, and (3) mixed-precision routines that perform single-precision LU factorization and double-precision iterative refinement. Apart from the algorithm improvements, we also modernized the software build system to use CMake and Spack package installation tools to simplify the installation procedure. Throughout the article, we describe in detail the pertinent performance-sensitive parameters associated with each new algorithmic feature, show how they are exposed to the users, and give general guidance of how to set these parameters. We illustrate that the solver’s performance both in time and memory can be greatly improved after systematic tuning of the parameters, depending on the input sparse matrix and underlying hardware.

97 MATHEMATICS AND COMPUTING↗

Query-Driven Visualization and Analysis

This report focuses on an approach to high performance visualization and analysis, termed query-driven visualization and analysis (QDV). QDV aims to reduce the amount of data that needs to be processed by the visualization, analysis, and rendering pipelines. The goal of the data reduction process is to separate out data that is "scientifically interesting'' and to focus visualization, analysis, and rendering on that interesting subset. The premise is that for any given visualization or analysis task, the data subset of interest is much smaller than the larger, complete data set. This strategy---extracting smaller data subsets of interest and focusing of the visualization processing on these subsets---is complementary to the approach of increasing the capacity of the visualization, analysis, and rendering pipelines through parallelism. This report discusses the fundamental concepts in QDV, their relationship to different stages in the visualization and analysis pipelines, and presents QDV's application to problems in diverse areas, ranging from forensic cybersecurity to high energy physics.

97 MATHEMATICS AND COMPUTING↗

PeleLMeX: an AMR Low Mach Number Reactive Flow Simulation Code without level sub-cycling

PeleLMeX simulates chemically reacting low Mach number flows with block-structured adaptive mesh refinement (AMR). The code is built upon the AMReX library, which provides the underlying data structures and tools to manage and operate on them across massively parallel computing architectures. PeleLMeX algorithmic features are inherited from its predecessor PeleLM but key improvements allow representation of more complex physical processes. Together with its compressible flow counterpart PeleC, the thermo-chemistry library PelePhysics and the multi-physics library PeleMP, it forms the Pele suite of open-source reactive flow simulation codes.

97 MATHEMATICS AND COMPUTING↗

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗