Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed computation”

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 739 records · Page 41

ED-cPSD: Fast Phase-Size Distribution via Sequential Erosion-Dilation

The Erosion-Dilation continuous Phase-Size Distribution, ED-cPSD, is an application for calculating continuous pore and particle-size distribution from digital reconstructions and/or image-based structural data. It is based on the erosion-dilation continuous phase-size distribution method. A continuous size distribution is a measure of the probability density of finding a particle or pore of a certain size. These distributions are of interest in any field of study involving porous media, including but not limited to electrochemistry, petroleum engineering, geology, and food science. The algorithm behind the software provides a computationally efficient way to calculate phase-size distributions for large domains. For a 3D battery electrode reconstruction with 1.3 x 10 8 voxels, the particle size distribution is derived in under 2 min on a desktop, while also retaining flexibility and computational efficiency for HPC-scale multi-threading. The software can handle structures with over 10 9 voxels. The algorithm is roughly 280 times faster than a previous version on the same task.

Characterization↗

A fast particle-based approach for calibrating a 3-D model of the Antarctic ice sheet

We consider the scientifically challenging and policy-relevant task of understanding the past and projecting the future dynamics of the Antarctic ice sheet. The Antarctic ice sheet has shown a highly nonlinear threshold response to past climate forcings. Triggering such a threshold response through anthropogenic greenhouse gas emissions would drive drastic and potentially fast sea level rise with important implications for coastal flood risks. Previous studies have combined information from ice sheet models and observations to calibrate model parameters. These studies have broken important new ground but have either adopted simple ice sheet models or have limited the number of parameters to allow for the use of more complex models. These limitations are largely due to the computational challenges posed by calibration as models become more computationally intensive or when the number of parameters increases. Here, we propose a method to alleviate this problem: a fast sequential Monte Carlo method that takes advantage of the massive parallelization afforded by modern high-performance computing systems. We use simulated examples to demonstrate how our sample-based approach provides accurate approximations to the posterior distributions of the calibrated parameters. The drastic reduction in computational times enables us to provide new insights into important scientific questions, for example, the impact of Pliocene era data and prior parameter information on sea level projections. These studies would be computationally prohibitive with other computational approaches for calibration such as Markov chain Monte Carlo or emulation-based methods. We also find considerable differences in the distributions of sea level projections when we account for a larger number of uncertain parameters. For example, based on the same ice sheet model and data set, the 99th percentile of the Antarctic ice sheet contribution to sea level rise in 2300 increases from 6.5 m to 13.1 m when we increase the number of calibrated parameters from three to 11. With previous calibration methods, it would be challenging to go beyond five parameters. Here, this work provides an important next step toward improving the uncertainty quantification of complex, computationally intensive and decision-relevant models.

54 ENVIRONMENTAL SCIENCES↗

Multi-dimensional modeling of mixture preparation in a direct injection engine fueled with gaseous hydrogen

With the recent advances of direct injection (DI) technology, introducing hydrogen into the combustion chamber through DI is being considered as a viable approach to circumvent backfire and pre-ignition encountered in early generations of hydrogen engines. As part of a broader vision to develop a robust numerical model to study hydrogen spark ignition (SI) combustion in internal combustion (IC) engines, the present numerical investigation focuses on mixture preparation in a hydrogen DI SI engine. This study is carried out with a single hole injector with gaseous hydrogen injected at 100 bar injection pressure. Simulations are carried out for high and low tumble configurations and validated against optical data acquired from planar laser induced fluorescence (PLIF) measurements. Varying mesh configurations are investigated for the impact on in-cylinder mixture distribution. A particular emphasis is placed on the effect of nozzle geometry and mesh orientation near the wall. Overall, the computational model is found to predict the mixture distribution in the combustion cylinder reasonably well. The results showed that the alignment of mesh with the flow direction is important to achieve good agreement between numerical analysis and optical measurement data.

08 HYDROGEN↗

Parallel Memory-Independent Communication Bounds for SYRK

In this paper, we focus on the parallel communication cost of multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK). SYRK requires half the computation of general matrix multiplication because of the symmetry of the output matrix. Recent work (Beaumont et al., SPAA '22) has demonstrated that the sequential I/O complexity of SYRK is also a constant factor smaller than that of general matrix multiplication. Inspired by this progress, we establish memory-independent parallel communication lower bounds for SYRK with smaller constants than general matrix multiplication, and we show that these constants are tight by presenting communication-optimal algorithms. The crux of the lower bound proof relies on extending a key geometric inequality to symmetric computations and analytically solving a constrained nonlinear optimization problem. Here, the optimal algorithms use a triangular blocking scheme for parallel distribution of the symmetric output matrix and corresponding computation.

Communication costs↗

Resilient Distributed Field Estimation

We study resilient distributed field estimation under measurement attacks. A network of agents or devices measures a large, spatially distributed physical field parameter. An adversary arbitrarily manipulates the measurements of some of the agents. Each agent's goal is to process its measurements and information received from its neighbors to estimate only a few specific components of the field. Here, we present SAFE, the saturating adaptive field estimator, a consensus + innovations distributed field estimator that is resilient to measurement attacks. Under sufficient conditions on the compromised measurement streams, the physical coupling between the field and the agents' measurements, and the connectivity of the cyber communication network, SAFE guarantees that each agent's estimate converges almost surely to the true value of the components of the parameter in which the agent is interested. Finally, we illustrate the performance of SAFE through numerical examples.

97 MATHEMATICS AND COMPUTING↗

Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials

Quantum machine-learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure calculations of molecular systems and spin models in magnetic systems. However, the discussion in all these recipes focuses specifically on targeting the ground state. Herein we demonstrate a quantum algorithm that can filter any energy eigenstate of the system based on either symmetry properties or a predefined choice of the user. The workhorse of our technique is a shallow neural network encoding the desired state of the system with the amplitude computed by sampling the Gibbs–Boltzmann distribution using a quantum circuit and the phase information obtained classically from the nonlinear activation of a separate set of neurons. We show that the resource requirements of our algorithm are strictly quadratic. To demonstrate its efficacy, we use state filtration in monolayer transition metal dichalcogenides which are hitherto unexplored in any flavor of quantum simulations. We implement our algorithm not only on quantum simulators but also on actual IBM-Q quantum devices and show good agreement with the results procured from conventional electronic structure calculations. We thus expect our protocol to provide a new alternative in exploring the band structures of exquisite materials to usual electronic structure methods or machine-learning techniques that are implementable solely on a classical computer.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Allocating Reserves in Active Distribution Systems for Tertiary Frequency Regulation

This paper proposes a cooperative game theory-based approach for reserve optimization to enable distributed energy resources (DERs) participate in tertiary frequency regulation. Tertiary frequency regulation schemes ensure that reserve requirements of primary and secondary frequency regulation are fulfilled with a minimum cost. While the available reserve from a single distribution system may not suffice tertiary frequency regulation, stacked reserve from several distribution systems can enable them participate in tertiary frequency regulation at scale. In this paper, a two-stage strategy is proposed to effectively and precisely allocate spinning reserve requirement from each DER in distribution systems. In the first stage, two types of characteristic functions are computed: worthiness index (WI) and power loss reduction (PLR). In the second stage, the equivalent Shapley values are computed based on the characteristic functions, which are used to determine distribution factors for reserve allocation among DERs. The effectiveness of the proposed method for allocating reserves among DERs is demonstrated through several case studies on modified versions of the IEEE 13-node and 33-node distribution systems.

Gautam, Mukesh↗

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic generation of electrolyzer anode catalyst layers

Here, we introduce a stochastic methodology to reproduce the complex pore structure observed in commercial iridium catalyst layers. This method preserves the α pore (pores smaller than 250 nm) and β pore (pores greater than or equal to 250 nm) regions of the catalyst layer. The morphology of the generated materials was validated by comparing the pore size distributions of generated materials against those obtained from commercial materials imaged using x-ray nano computed tomography. We further demonstrate that the pore size distributions of the generated materials are statistically indistinguishable from the imaged catalyst layers, indicating that the stochastic methodology is capable of accurately reproducing catalyst layer morphology. Pore network modelling was conducted on the generated catalyst materials to simulate single-phase permeability, electrical conductivity, and ionic conductivity, and these properties were found to be within experimentally measured ranges for electrolyzer catalyst layers. Additionally, simulations were performed on the generated materials with varying ionomer and iridium catalyst loadings. As the ionomer loading is added, proton conductivity increases exponentially, which demonstrates the importance of optimizing ionomer loading, considering that these effects will be exacerbated in the hydration and temperature conditions of operating electrolyzers. The stochastic material generation method presented in this work is a powerful tool for the development of novel low loading catalyst layers, where the effect of various structural parameters on electrolyzer performance characteristics can be explored.

36 MATERIALS SCIENCE↗

Priority-enabled Load Balancing for Dispersed Computing

Opportunistic managed access to local in-network compute resources can improve the performance of distributed applications and reduce the dependence on shared network resources. Instead of backhauling application data to a centralized cloud data center for processing, networked services may be adaptively and continuously dispersed into shared compute resources that are closer to the source of need. While this approach has several benefits, support for mission-aware access to computation is often an afterthought, and is implemented as a brittle extension over traditional load-balancer solutions.In this work, we investigate the design of two priority-aware resource allocation strategies and two load-balancing dispatching strategies as first class citizens in an open-source dispersed computing middleware. We present a control theoretic analysis of these load-balancing primitives to identify weaknesses and strengths in our design, and recommend future directions. In parallel, we prototype two priority-aware allocation algorithms to validate our priority predictions. In initial experiments our prototype shows substantial gains in processing prioritized load. Finally, we make our source-code and experimental configurations open source.

Paulos, Aaron↗

Porosity evolution under increasing tension in wire-arc additively manufactured aluminum using in-situ micro-computed tomography and convolutional neural network

Internal defects such as porosities are often formed in additively manufactured metal components. The pores nucleate, grow, and coalesce to form cracks under loads, leading to eventual catastrophic failure. Here, in this paper, the full-field porosity evolution, including pore growth and coalescence in a wire-arc additively manufactured (WAAM) aluminum alloy cylinder under tension is observed with in-situ X-ray micro-computed tomography (μCT). The pore size distribution, density, and tensile stress are calculated from the volumetric images analyzed by a convolutional neural network (CNN) algorithm, which provides rapid analysis of 12,950 slice images from μCT volumetric images at the reference state and 13 tensile strains. The results show the quantitative evolution of the growth and coalescence of macropores under tension. A strong correlation is found between the local pore volume fraction and the true tensile stress when the tensile strain is larger than 5%.

36 MATERIALS SCIENCE↗

Enabling Interoperable SCADA Communications for PV Inverters through Embedded Controllers

The percentage integration of photovoltaic (PV) inverters in the field has increased significantly in the past 5 years. Regardless of the size of the PV plants and the inverters (residential vs. commercial), it is becoming crucial that these devices have the capability to communicate with peers (other smart devices) and with components that are at a hierarchy above the inverters (e.g., supervisory control and data acquisition (SCADA) systems, distributed controllers, and data managers). This project aims to develop a standard SCADA software code for inverters’ embedded controllers that will enable interoperability with other components in the system. To achieve this, the code will be developed using two different protocols: Distributed Network Protocol 3 and International Electrotechnical Commission 61850. The developed code is aimed to be deployed in simple embedded controllers. It will be tested in the National Renewable Energy Laboratory’s (NREL’s) Energy Systems Integration Facility. The tested code will then be made available through Triangle MicroWorks’s (TMW’s) software platform. The primary objectives of this project include training the NREL team with TMW’s embedded controller libraries, developing an interoperable communication code for embedded controllers, successfully testing and deploying the code, and demonstrating the newly developed code in a conference.

14 SOLAR ENERGY↗

Summary of DASSH-CFD Inter-Assembly Heat Transfer Comparison

Fast reactor core design requires integration of detailed power distributions obtained from neutronics models and thermal fluids calculations to determine temperature distributions and flow conditions. During the design phase, calculations may be repeated as specifications change and computational expense must be balanced with solution accuracy, creating an opportunity for the use of intermediate-fidelity codes. To that end, the Ducted Assembly Steady-State Heat Transfer Software (DASSH) has been developed at Argonne National Laboratory to perform full-core, steady state coolant and fuel pin temperature calculations in reactors consisting of hexagonal, ducted assemblies. DASSH is a first-order, finite volume subchannel code based on methodologies initially introduced in the legacy thermal hydraulics codes SUPERENERGY-2 and SE2-ANL. It can work coupled with the Argonne Reactor Computational (ARC) code suite to obtain neutron and gamma power distributions based on neutron transport solutions and features many improvements and new capabilities compared to its predecessors. DASSH calculates temperatures by balancing energy between subchannels and relies on correlations to account for flow distribution and coolant mixing.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Uncertainty quantification of bank vegetation impacts on the flood flow field in the American River, California, using large‐eddy simulations

Bank vegetation plays a key role in both hydrodynamics and morphodynamics of natural rivers; however, these effects are often unaccounted for in the computational flow dynamics of natural waterways. Recent studies using the large‐eddy simulation (LES), however, have attempted to gain insights into the impacts of bank vegetation on the mean flow field of the natural rivers using a vegetation model, which applies a sink term to the momentum equations of motion. This approach accounts for the effects of the vegetation and provides a practical approach to account for the complex patches of bank vegetation in large‐scale rivers. To implement the vegetation model, a drag coefficient reflecting the overall resistance of vegetal structures to the flow is needed, but due to the lack of calibrated data and range of size, density and type of vegetation, this parameter can be a significant source of uncertainty in the model results. Here, in this study, we use uncertainty quantification (UQ) to investigate the hydrodynamics and bed shear results when a bank vegetation is incorporated in an LES model. To this end, we used the polynomial chaos expansion and Monte Carlo sampling techniques to determine the uncertainties associated with the drag coefficient in the vegetation model and from uncertainties in the bed roughness and inflow discharge. The UQ analysis provided spatially varying confidence levels for the spanwise and vertical distribution of velocity magnitude and for the bed shear stress distributions. In addition, Sobol indices were computed to indicate the relative influence that each parameter had on the overall uncertainty. In general, it was found that uncertainty in flow discharge was the dominant source of uncertainty; however, the drag coefficient in the vegetation model and the bed roughness parameter also made significant contribution to the uncertainty near the banks and bed, respectively.

54 ENVIRONMENTAL SCIENCES↗

Proactive Operations and Investment Planning via Stochastic Optimization to Enhance Power Systems’ Extreme Weather Resilience

We present scalable stochastic optimization approaches for improving power systems’ resilience to extreme weather events. We consider both proactive redispatch and transmission line hardening as alternatives for mitigating expected load shed due to extreme weather, resulting in large-scale stochastic linear programs (LPs) and mixed-integer linear programs (MILPs). We solve these stochastic optimization problems with progressive hedging (PH), a parallel, scenario-based decomposition algorithm. Our computational experiments indicate that our proposed method for enhancing power system resilience can provide high-quality solutions efficiently. With up to 128 scenarios on a 2,000-bus network, the operations (redispatch) and investment (hardening) resilience problems can be solved in approximately 6 min and 2 h of wall-clock time, respectively. Additionally, we solve the investment problems with up to 512 scenarios, demonstrating that the approach scales very well with the number of scenarios. Moreover, the method produces high quality solutions that result in statistically significant reductions in expected load shed. Our proposed approach can be augmented to incorporate a variety of other operational and investment resilience strategies, or a combination of such strategies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Situational awareness-enhancing community-level load mapping with opportunistic machine learning

Motivated by present and forthcoming challenges in the adoption and integration of distributed renewable energy, we develop a machine learning (ML) approach that builds short-fuse mappings connecting the occasionally-unobservable true load in one target community with information-rich signals collected from relatively more instrumented reference communities. Our setting is inspired by and tailored to target communities with significant unobservable behind-the-meter solar generation, where true load (a relatively well-behaved quantity of interest to grid operators) is hard to discern during daytime due to insufficient instrumentation and/or privacy reasons, but that can be related to reference communities with low unobservable distributed variable generation or with sufficient instrumentation. The developed mapping, herein realized with Support Vector Machine regression, is built using nighttime data from all communities, when their distributed generation is low or zero. Our ML algorithm opportunistically learns to correlate signals of interest and then is operationally used the next day to shed light into target community load evolution. The mapping is subsequently rebuilt, rolling its short-fuse scope perpetually forward in time. Here, we demonstrate the efficacy of our approach on nine synthetically generated topologies and associated timeseries stemming from real-world data, on which we observe cumulative error performance that yields lower than 10% and 15% daily-averaged mean absolute percentage errors in target community load estimation on more than about 75% and 90% of days, respectively, in multiple yearly evaluations that shed light on long-term performance also under seasonal and one-off effects. The proposed ML-powered methodology can offer grid operators much-improved visibility into a previously obscure space and can also serve as an additional source of information in broader, multi-modal solar disaggregation solutions.

14 SOLAR ENERGY↗

Computing real time correlation functions on a hybrid classical/quantum computer

Quantum devices may overcome limitations of classical computers in studies of nuclear structure functions and parton Wigner distributions of protons and nuclei. In this talk, we discuss a worldline approach to compute nuclear structure functions in the high energy Regge limit of QCD using a hybrid quantum computer, by expressing the fermion determinant in the QCD path integral as a quantum mechanical path integral over 0 + 1-dimensional fermionic and bosonic world-lines in background gauge fields. Our simplest example of computing the well-known dipole model result for the structure function F 2 in the high energy Regge limit is feasible with NISQ era technology using few qubits and shallow circuits. We note this example can be scaled up in complexity and extended in scope to compute structure functions, scattering amplitudes and other real-time correlation functions in QCD, relevant for example to describe non-equilibrium transport of quarks and gluons in a Quark-Gluon-Plasma.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗