Search NASA⌕ Search

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.

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

At least 505 records · Page 28

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗

Reduced-Order Structure-Preserving Model for Parallel-Connected Three-Phase Grid-Tied Inverters

Next-generation power networks will contain large numbers of grid-connected inverters satisfying a significant fraction of system load. Since each inverter model has a relatively large number of dynamic states, it is impractical to analyze complex system models where the full dynamics of each inverter are retained. To address this challenge, we derive a reduced-order structure-preserving model for parallel-connected grid-tied three-phase inverters. Here, each inverter in the system is assumed to have a full-bridge topology, LCL filter at the point of common coupling, and the control architecture for each inverter includes a current controller, a power controller, and a phase-locked loop for grid synchronization. We outline a structure-preserving reduced-order inverter model with lumped parameters for the setting where the parallel inverters are each designed such that the filter components and controller gains scale linearly with the power rating. By structure preserving, we mean that the reduced-order three-phase inverter model is also composed of an LCL filter, a power controller, current controller, and PLL. We show that the system of parallel inverters can be modeled exactly as one aggregated inverter unit and this equivalent model has the same number of dynamical states as any individual inverter in the system. Numerical simulations validate the reduced-order model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Asynchronous Iterative Solvers for Extreme-Scale Computing

The Asynchronous Iterative Solvers for Extreme-Scale Computing (AsyncIS) project aims to explore more efficient numerical algorithms by decreasing their overhead. AsyncIS does this by replacing the outer Krylov subspace solver with an asynchronous optimized Schwarz method, thereby removing the global synchronization and bulk synchronous operations typically used in numerical codes. AsyncIS—a U.S. Department of Energy (DOE)-funded collaboration between Georgia Tech, the University of Tennessee, Knoxville, Temple University, and Sandia National Laboratories—also focuses on the development and optimization of asynchronous preconditioners (i.e., preconditioners that are generated and/or applied in an asynchronous fashion). The novel preconditioning algorithms that provide fine-grained parallelism enable preconditioned Krylov solvers to run efficiently on large-scale distributed systems and manycore accelerators like GPUs.

97 MATHEMATICS AND COMPUTING↗

Kinetic study of shock formation and particle acceleration in laser-driven quasi-parallel magnetized collisionless shocks

Quasi-parallel magnetized collisionless shocks are believed to be one of the most efficient accelerators in the universe. Compared to quasi-perpendicular shocks, quasi-parallel shocks are more difficult to form in the laboratory and to simulate because of their large spatial scales and long formation times. Our two-dimensional particle-in-cell simulations show that the early stages of quasi-parallel shock formation are achievable in experiments planned for the National Ignition Facility and that particles accelerated by diffusive shock acceleration (DSA) are expected to be observable in the experiment. Repetitive ion acceleration by crossings of the shock front, a key feature of DSA, is seen in the simulations. Other characteristic features of quasi-parallel shocks such as upstream wave excitation by energetic ions are also observed, and energy partition between the ions and the electrons in the downstream of the shock is briefly discussed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Designing for Zero Energy and Zero Carbon on a Multi-Building Scale Using URBANopt: Preprint

Groundbreaking efforts are necessary to mitigate contributors increasing impacts of climate change. In parallel to inventing pioneering clean energy technologies it is even more fundamental to rethink designing energy systems within a singular facility and collectively to function as a district. Facilities should not be continuously passive by just consuming; there is a need to shift to perform more dynamically. Designing for zero energy and zero carbon on a multi-building scale can uncover opportunities for building energy efficiency, decarbonization, demand flexibility, and resiliency that are not accessible at an individual building scale. This approach can be challenging without innovative tools to evaluate the multitude of possibilities. As an investigated result, we highlight the use of a campus-scale energy modeling platform - URBANopt™ - for the expansion of the National Renewable Energy Laboratory's (NREL's) South Table Mountain campus in Golden, Colorado. Programmatic growth included the design of three new all-electric, zero-energy, and zero-carbon, mixed used buildings (a combination of research laboratories and office space). This investigation is critical to NREL reaching net-zero emissions for its operational footprint, which will occur in phases over the next decade. Leveraging URBANopt's capabilities, we evaluate 1) high-performance building energy efficiency and decarbonization measures, 2) 4th generation district heating and cooling (4th GDHC) systems, 3) optimized onsite generation and energy storage assets that meet zero-energy and zero-carbon targets at minimum life-cycle costs, and 4) cost-optimal distributed energy technology mixes, dispatch strategies, and associated capacities that increase resiliency to grid outages. This work demonstrates the use and capabilities of URBANopt through a real-world case study on a multi-building scale.

community energy model↗

Reduced-Order Structure-Preserving Model for Parallel-Connected Three-Phase Grid-Tied Inverters: Preprint

Given that next-generation infrastructures will contain large numbers of grid-connected inverters and these interfaces will be satisfying a growing fraction of system load, it is imperative to analyze the impacts of power electronics on such systems. However, since each inverter model has a relatively large number of dynamic states, it would be impractical to execute complex system models where the full dynamics of each inverter are retained. To address this challenge, we derive a reduced-order structure-preserving model for parallel-connected grid-tied three-phase inverters. Here, each inverter in the system is assumed to have a full-bridge topology, LCL filter at the point of common coupling, and the control architecture for each inverter includes a current controller, a power controller, and a phase-locked loop for grid synchronization. We outline a structure-preserving reduced-order inverter model for the setting where the parallel inverters are each designed such that the filter components and controller gains scale linearly with the power rating. By structure preserving, we mean that the reduced-order three-phase inverter model is also composed of an LCL filter, a power controller, current controller, and PLL. That is, we show that the system of parallel inverters can be modeled exactly as one aggregated inverter unit and this equivalent model has the same number of dynamical states as an individual inverter in the paralleled system. Numerical simulations validate the reduced-order models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

In situ multi-tier auto-ignition detection applied to dual-fuel combustion simulations

Here we use an anomaly detection methodology that is centered on analyzing fourth-order joint moments (co-kurtosis), particularly focusing on its application in auto-ignition of combustion problems with large numbers of species. Unsupervised anomaly detection is challenging to generalize across problem types and domains. A recent technique, centered on analyzing information in the fourth-order joint moment co-kurtosis, has shown promise, especially for high-dimensional scientific data. In this work we present developments to the co-kurtosis based anomaly detection method needed to make it effective and scalable for large-scale distributed scientific data, such as those generated by massively parallel simulations. An in situ co-kurtosis algorithm is employed as the anomaly detection method for identifying ignition kernels in simulations of turbulent combustion. Here, we extend an existing methodology which identifies regions of the domain where anomalies are present, and add another tier of anomaly detection where the individual samples contributing to the anomaly are identified. We apply this algorithm on-the-fly to a variety of turbulent reacting flow problems and compare it to the widely used (but significantly more expensive) chemical explosive mode analysis (CEMA). We demonstrate the ability of the method to detect and identify the onset of low and high temperature ignition which can be used for computational steering, as chemical and combustion anomalies occur intermittently at spatio-temporal locations unknown a priori. Finally, we apply our lightweight in situ algorithm to an exascale high-fidelity simulation with a total of 2.4 Trillion degrees of freedom, performed using an adaptive mesh refinement solver. Furthermore, through a scalability analysis, we show that the relative computational cost of this in-situ anomaly detection algorithm compared to an iteration of the reacting flow solver is negligible.

97 MATHEMATICS AND COMPUTING↗

The Design, Deployment, and Evaluation of the CORAL Pre-Exascale Systems

CORAL, the Collaboration of Oak Ridge, Argonne and Livermore, is fielding two similar IBM systems, Summit and Sierra, with NVIDIA GPUs that will replace the existing Titan and Sequoia systems. Summit and Sierra are currently ranked No. 1 and No. 3, respectively on the Top500 list. We discuss the design and key differences of the systems. Our evaluation of the systems highlights the following. Applications that fit in HBM see the most benefit and may prefer more GPUs; however, for some applications, the CPU-GPU bandwidth is more important than the number of GPUs. The node-local burst buffer scales linearly, and can achieve a 4X improvement over the parallel file system for large jobs; smaller jobs, however, may benefit from writing directly to the PFS. Finally, several CPU, network and memory bound analytics and GPU-bound deep learning codes achieve up to a 11X and 79X speedup/node, respectively over Titan.

Vazhkudai, Sudharshan↗

Calculation of Nuclear Reactor Cooling Tower Performance With Limited Data Streams

Monitoring of cooling tower performance in a nuclear reactor facility is necessary to ensure safe operation; however, instrumentation for measuring performance characteristics can be difficult to install and may malfunction or break down over long duration experiments. This paper describes employing a thermodynamic approach to quantify cooling tower performance, the Merkel model, which requires only five parameters, namely, inlet water temperature, outlet water temperature, liquid mass flowrate, gas mass flowrate, and wet bulb temperature. Using this model, a general method to determine cooling tower operation for a nuclear reactor was developed in situations when neither the outlet water temperature nor gas mass flowrate are available, the former being a critical piece of information to bound the Merkel integral. Furthermore, when multiple cooling tower cells are used in parallel (as would be in the case of large-scale cooling operations), only the average outlet temperature of the cooling system is used as feedback for fan speed control, increasing the difficulty of obtaining the outlet water temperature for each cell. To address these shortcomings, this paper describes a method to obtain individual cell outlet water temperatures for mechanical forced-air cooling towers via parametric analysis and optimization. In this method, the outlet water temperature for an individual cooling tower cell is acquired as a function of the liquid-to-gas ratio (L/G). Leveraging the tight tolerance on the average outlet water temperature, an error function is generated to describe the deviation of the parameterized L/G to the highly controlled average outlet temperature. The method was able to determine the gas flowrate at rated conditions to be within 3.9% from that obtained from the manufacturer’s specification, while the average error for the four individual cooling cell outlet water temperatures were 1.6 °C, -0.5 °C, -1.0 °C, and 0.3 °C.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Avoiding Communication in Primal and Dual Block Coordinate Descent Methods

Primal and dual block coordinate descent methods are iterative methods for solving regularized and unregularized optimization problems. Distributed-memory parallel implementations of these methods have become popular in analyzing large machine learning datasets. However, existing implementations communicate at every iteration, which, on modern data center and supercomputing architectures, often dominates the cost of floating-point computation. Recent results on communication-avoiding Krylov subspace methods suggest that large speedups are possible by re-organizing iterative algorithms to avoid communication. We show how applying similar algorithmic transformations can lead to primal and dual block coordinate descent methods that only communicate every $s$ iterations---where $s$ is a tuning parameter---instead of every iteration for the regularized least-squares problem. We show that the communication-avoiding variants reduce the number of synchronizations by a factor of $s$ on distributed-memory parallel machines without altering the convergence rate and attain strong scaling speedups of up to $6.1\times$ over the “standard algorithm" on a Cray XC30 supercomputer.

97 MATHEMATICS AND COMPUTING↗

Center for Computing Research Highlights

Sandia has a legacy of leadership in the advancement of high performance computing (HPC) at extreme scales. First-of-a-kind scalable distributed-memory parallel platforms such as the Intel Paragon, ASCI Red (the world’s first teraflops computer), and Red Storm (co-developed with Cray) helped form the basis for one of the most successful supercomputer product lines ever: the Cray XT series. Sandia also has pioneered system software elements—including lightweight operating systems, the Portals network programming interface, advanced interconnection network designs, and scalable I/O— that are critical to achieving scalability on large computing systems.

97 MATHEMATICS AND COMPUTING↗

Demonstration of Advanced Experimental and Theoretical Characterization of Hydrogen Dynamics and Associated Behavior in Advanced Reactors

Advanced materials development, manufacturing, and modeling capabilities for innovative reactor designs support nuclear security and mission-focused science through enhanced technology for safer and more efficient and secure production of nuclear energy. The research in this project has established: 1) a state-of-the-art neutron-based hydrogen mapping and cross-section measurement capability as well as detailed crystallographic characterization of hydrogen atoms at LANSCE, and 2) a multi-physics framework for simulating behavior of moderator materials and other material performance in advanced nuclear reactors. Through the course of this project, we successfully developed and demonstrated measurement techniques for hydrogen distribution and atomistic-scale behavior of hydrogen atoms using pulsed neutron techniques. In parallel, advanced multi-physics simulation tools to predict the behavior of hydrogen atoms, e.g. in a moderator for a nuclear reactor, through materials performance, neutron transport, and thermal mechanical behavior were enhanced. Multi-discipline areas across the laboratory were involved in the project as the integration of improved experimental capabilities with enhanced modeling and simulation through MST, NEN, SIGMA, and XCP division subject matter experts.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scale-up Unlearnable Examples Learning with High-performance Computing

Recent advancements in AI models, like ChatGPT, are structured to retain user interactions, which could inadvertently include sensitive healthcare data. In the healthcare field, particularly when radiologists use AI-driven diagnostic tools hosted on online platforms, there is a risk that medical imaging data may be repurposed for future AI training without explicit consent, spotlighting critical privacy and intellectual property concerns around healthcare data usage. Addressing these privacy challenges, a novel approach known as Unlearnable Examples (UEs) has been introduced, aiming to make data unlearnable to deep learning models. A prominent method within this area, called Unlearnable Clustering (UC), has shown improved UE performance with larger batch sizes but was previously limited by computational resources (e.g., a single workstation). To push the boundaries of UE performance with theoretically unlimited resources, we scaled up UC learning across various datasets using Distributed Data Parallel (DDP) training on the Summit supercomputer. Our goal was to examine UE efficacy at high-performance computing (HPC) levels to prevent unauthorized learning and enhance data security, particularly exploring the impact of batch size on UE’s unlearnability. Utilizing the robust computational capabilities of the Summit, extensive experiments were conducted on diverse datasets such as Pets, MedMNist, Flowers, and Flowers102. Our findings reveal that both overly large and overly small batch sizes can lead to performance instability and affect accuracy. However, the relationship between batch size and unlearnability varied across datasets, highlighting the necessity for tailored batch size strategies to achieve optimal data protection. The use of Summit’s high-performance GPUs, along with the efficiency of the DDP framework, facilitated rapid updates of model parameters and consistent training across nodes. Our results underscore the critical role of selecting appropriate batch sizes based on the specific characteristics of each dataset to prevent learning and ensure data security in deep learning applications. The source code is publicly available at https: // github. com/ hrlblab/ UE_ HPC .

Zhu, Yanfan [Vanderbilt University, Nashville, TN,↗

Overlapping localized exponential time differencing methods for diffusion problems

The localized exponential time differencing (ETD) based on overlapping domain decomposition has been recently introduced for extreme-scale phase field simulations of coarsening dynamics, which displays excellent parallel scalability in supercomputers. This paper serves as the first step toward building a solid mathematical foundation for this approach. We study the overlapping localized ETD schemes for a model time-dependent diffusion equation discretized in space by the standard central difference. Two methods are proposed and analyzed for solving the fully discrete localized ETD systems: the first one is based on Schwarz iteration applied at each time step and involves solving stationary problems in the subdomains at each iteration, while the second one is based on the Schwarz waveform relaxation algorithm in which time-dependent subdomain problems are solved at each iteration. The convergences of the associated iterative solutions to the corresponding fully discrete localized ETD solution and to the exact semidiscrete solution are rigorously proved. Finally, numerical experiments are also carried out to confirm theoretical results and to compare the performance of the two methods.

58 GEOSCIENCES↗

High flux thermal receiver and method of use

A thermal receiver, such as a solar flux thermal receiver, is disclosed comprising a modular arrangement of arrayed microchannels or micropins to heat a working fluid by heat transfer. Disclosed solar receivers provide a much higher solar flux and consequently a significant reduction in thermal losses, size, and cost, relative to known receivers. Unit cell receivers can be numbered up and combined in parallel to form modules, and modules combined to form full scale receivers.

14 SOLAR ENERGY↗

On the Short-scale Spatial Variability of Electron Inflows in Electron-only Magnetic Reconnection in the Turbulent Magnetosheath Observed by MMS

We investigate the detailed properties of electron inflow in an electron-only reconnection event observed by the four Magnetospheric Multiscale (MMS) spacecraft in the Earth's turbulent magnetosheath downstream of the quasi-parallel bow shock. The lack of ion coupling was attributed to the small-scale sizes of the current sheets, and the observed bidirectional super-Alfvénic electron jets indicate that the MMS spacecraft crossed the reconnecting current sheet on both sides of an active X-line. Remarkably, the MMS spacecraft observed the presence of large asymmetries in the two electron inflows, with the inflows (normal to the current sheet) on the two sides of the reconnecting current layer differing by as much as a factor of four. Furthermore, even though the four MMS spacecraft were separated by less than seven electron skin depths, the degree of inflow asymmetry was significantly different at the different spacecraft. The asymmetry in the inflow speeds was larger with increasing distances downstream from the reconnection site, and the asymmetry was opposite on the two sides of the X-line. We compare the MMS observations with a 2D kinetic particle-in-cell (PIC) simulation and find that the asymmetry in the inflow speeds stems from in-plane currents generated via the combination of reconnection-mediated inflows and parallel flows along the magnetic separatrices in the presence of a large guide field.

79 ASTRONOMY AND ASTROPHYSICS↗

Weak scaling of the contact distance between two fluctuating interfaces with system size

A pair of flat parallel surfaces, each freely diffusing along the direction of their separation, will eventually come into contact. If the shapes of these surfaces also fluctuate, then contact will occur when their centers-of-mass remain separated by a nonzero distance ℓ. An example of such a situation is the motion of interfaces between two phases at conditions of thermodynamic coexistence, and in particular the annihilation of domain wall pairs under periodic boundary conditions. Here we present a general approach to calculate the probability distribution of the contact distance ℓ and determine how its most likely value ℓ* depends on the surfaces' lateral size L. Using the Edward-Wilkinson equation as a model for interfaces, we demonstrate that ℓ* scales weakly with system size, i.e., the dependence of ℓ* on L for both (1+1)- and (2+1)-dimensional interfaces is such that lim L→∞ (ℓ*/L) = 0. In particular, for (2+1)-dimensional interfaces ℓ* is an algebraic function of logL, a result that is confirmed by computer simulations of slab-shaped domains formed under periodic boundary conditions. Overall, this weak scaling implies that such domains remain topologically intact until ℓ becomes very small compared to the lateral size of the interface, contradicting expectations from equilibrium thermodynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗