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.

SourceResearch connectionFrom yearThrough year

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

At least 703 records · Page 39

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Primal-Dual Differentiable Programming for Distribution System Critical Load Restoration: Preprint

Swift and reliable critical load restoration (CLR) can help make a distribution system resilient towards extreme events. To optimally achieve that, alongside practical concerns such as limiting online computational burden, some studies leverage model-free reinforcement learning (RL) to train control policies. Despite the advantages provided by RL algorithms, these approaches suffer from two issues: 1) the lack of a proper mechanism for constraint enforcement, and 2) poor sample efficiency. Therefore, in this paper, a primal-dual differentiable programming (PDDP) method is developed for guiding the training leading to a constraint-satisfying policy. Additionally, the model-based nature of the proposed method aims at improving sample efficiency. The experiment on a CLR problem demonstrates that PDDP can effectively train a control policy that both achieves desirable performance and satisfies required constraints.

differentiable programming↗

DOE OSTI2020

Designing a parallel Feel-the-Way clustering algorithm on HPC systems

This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

A Stochastic Intracellular Model of Anthrax Infection With Spore Germination Heterogeneity

We present a stochastic mathematical model of the intracellular infection dynamics of Bacillus anthracis in macrophages. Following inhalation of B. anthracis spores, these are ingested by alveolar phagocytes. Ingested spores then begin to germinate and divide intracellularly. This can lead to the eventual death of the host cell and the extracellular release of bacterial progeny. Some macrophages successfully eliminate the intracellular bacteria and will recover. Here, a stochastic birth-and-death process with catastrophe is proposed, which includes the mechanism of spore germination and maturation of B. anthracis . The resulting model is used to explore the potential for heterogeneity in the spore germination rate, with the consideration of two extreme cases for the rate distribution: continuous Gaussian and discrete Bernoulli. We make use of approximate Bayesian computation to calibrate our model using experimental measurements from in vitro infection of murine peritoneal macrophages with spores of the Sterne 34F2 strain of B. anthracis . The calibrated stochastic model allows us to compute the probability of rupture, mean time to rupture, and rupture size distribution, of a macrophage that has been infected with one spore. We also obtain the mean spore and bacterial loads over time for a population of cells, each assumed to be initially infected with a single spore. Our results support the existence of significant heterogeneity in the germination rate, with a subset of spores expected to germinate much later than the majority. Furthermore, in agreement with experimental evidence, our results suggest that most of the spores taken up by macrophages are likely to be eliminated by the host cell, but a few germinated spores may survive phagocytosis and lead to the death of the infected cell. Finally, we discuss how this stochastic modelling approach, together with dose-response data, allows us to quantify and predict individual infection risk following exposure.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

Structure of the Pion and Kaon from First-Principles Calculation in Lattice QCD

I outline recent developments in lattice QCD that enable the computation of the x-dependent Parton Distribution Functions, and then present recent calculations of the valence PDF of the pion by the HadStruct collaboration. I describe the challenges and opportunities to compute the gluon and sea-quark contributions to meson structure, and how such lattice calculations can form a key part of the physics goals of the EIC.

Richards, David↗

DOE OSTI2020

Stochastic Constrained Extended System Dynamics for Solving Charge Equilibration Models

In this work, we present a new stochastic extended Lagrangian molecular dynamics solution to charge equilibration that eliminates self-consistent field (SCF) calculations, thus eliminating the computational bottleneck in solving the charge distribution with standard SCF solvers. By formulating both charges and chemical potential as latent variables and introducing a holonomic constraint that satisfies charge conservation, the SC-XLMD method accurately reproduces thermodynamic, dynamic, and structural properties within the framework of ReaxFF for a bulk water system and highly reactive RDX molecules simulated at high temperature. The SC-XLMD method shows excellent computational performance and is available in the publicly available LAMMPS package.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2022

Methods and systems for evaluating and improving distribution-grid observability

This document describes systems and techniques for evaluating and improving distribution-grid observability. These systems and techniques allow engineers to quantify the observability of a distribution grid, which represents an ability to combine actual measurements and various types of computations (e.g., analytics, estimators, forecasters), from a system model. Distribution engineers can also identify islands of observability where operating parameters, including voltages, currents, and power flows, can be determined from available sensor readings. By exclusion, distribution engineers can similarly identify areas of the distribution grid with observability deficiencies that may require additional instrumentation to maintain proper operation. Distribution engineers, using an iterative or automated process, can determine the observability of the system model with new or relocated sensors to generate a sensor allocation plan. The sensor allocation plan can indicate the number and location of sensors to either maximize observability for a fixed sensor cost or minimize sensor cost for predetermined observability.

Reiman, Anthony P.↗

DOE OSTI2023

Methods and systems for evaluating data transportability in distribution grids

This document describes systems and techniques for evaluating and improving distribution-grid data transportability. These systems and techniques allow engineers to quantify the data transportability of a communication system within or connected to a distribution grid, which represents an ability to transport in real-time telemetry from source locations (e.g., sensors in the distribution grid) to control mechanisms. Distribution engineers can use the sensor readings to perform grid analytics, control operating parameters, and operate protection systems. Distribution engineers can also use the transportability of the communication system to evaluate the observability of the distribution grid, which represents an ability to combine actual measurements and various types of computations (e.g., analytics, estimators, forecasters) from a system model. Distribution engineers can then generate a sensor allocation plan that indicates the number and location of sensors to maximize observability for a fixed sensor cost and/or minimize sensor cost for predetermined observability.

Taft, Jeffrey D.↗

DOE OSTI2025

Electron and photon structure functions at two loops

We present a fully analytic computation of the complete electron and photon structure functions, or QED lepton parton distribution functions (PDFs) up to two-loop order. Our computation is performed using modern techniques of reduction to Master Integrals and solving them with the differential equation method. We obtain explicit expressions for the electron-in-electron, positron-in-electron, photon-in-electron, electron-in-photon, and photon-in-photon distributions at next-to-next-to-leading order (NNLO). Cross-checks against one-loop results, existing two-loop calculations, and a recent soft-collinear effective theory (SCET) analysis of the electron structure functions are presented.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2026

Author Correction: US oil and gas system emissions from nearly one million aerial site measurements

Correction to: Naturehttps://doi.org/10.1038/s41586-024-07117-5 Published online 13 March 2024 In the version of the article initially published, several errors were present and have been corrected in the HTML and PDF versions of the article and Supplementary Information. The main results, conclusions, and our interpretations of the data remain unchanged. See the new Supplementary Information Section S15 for a more detailed description of the errors corrected and the resulting effects on the analysis. Data processing and methods corrections Overflight count correction: We previously used pre-computed source coverage data for some Carbon Mapper campaigns that was computed differently than was required for our analysis. We have re-computed Carbon Mapper source coverage based on flightline polygons and source coordinates. Transition point computation, well sites: The updated version now correctly compares the cumulative emissions distribution of simulated well site emissions with that of aerially detected sources (rather than plumes) when computing the transition point. Transition point computation, midstream: Additionally, the transition point calculation has been corrected to exclude aerially detected midstream emissions below the transition point, which was previously leading to double counting of these emissions. This error was not present for upstream (well site) emissions. Calculation errors Unit error: We corrected a specific unit conversion error affecting well site emissions in the Kairos Fort Worth dataset. Across all datasets, we also correct the conversion factor for converting from standard volume to mass for midstream emissions. Sorting error: We correct code that was applying incorrect sorting when computing correction factors to account for partial detection at well sites. Small typographical corrections were made in Fig. 1b and SI Section S4.1. Data processing and methods corrections Overflight count correction: We previously used pre-computed source coverage data for some Carbon Mapper campaigns that was computed differently than was required for our analysis. We have re-computed Carbon Mapper source coverage based on flightline polygons and source coordinates. Transition point computation, well sites: The updated version now correctly compares the cumulative emissions distribution of simulated well site emissions with that of aerially detected sources (rather than plumes) when computing the transition point. Transition point computation, midstream: Additionally, the transition point calculation has been corrected to exclude aerially detected midstream emissions below the transition point, which was previously leading to double counting of these emissions. This error was not present for upstream (well site) emissions. Calculation errors Unit error: We corrected a specific unit conversion error affecting well site emissions in the Kairos Fort Worth dataset. Across all datasets, we also correct the conversion factor for converting from standard volume to mass for midstream emissions. Sorting error: We correct code that was applying incorrect sorting when computing correction factors to account for partial detection at well sites. Small typographical corrections were made in Fig. 1b and SI Section S4.1. The following practices may help researchers conducting similar analyses avoid making similar errors: 1, Clear, accessible documentation explaining the interpretation of all columns in data input tables and all internal variables within the model, 2, Simple cross-check calculations computed before and after unit conversions.

Sherwin, Evan D↗

DOE OSTI2022

A computationally efficient algorithm for computing convex hull prices

Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, in this work, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2022

Watershed Workflow: A toolset for parameterizing data-intensive, integrated hydrologic models

Integrated, distributed hydrologic models leverage advances in computational power and data accessibility to improve predictive understanding of the water cycle. While impressive advances in this area of environmental modeling have been accomplished, such models are still rarely used, partially because of difficulty integrating model and data. This research describes the release of Watershed Workflow version 1.2, a new library aiming to automate and enable complex workflows defining inputs to high resolution, integrated, distributed hydrologic models. Watershed Workflow provides tools enabling the discovery, acquisition, mapping, and coordination of watershed geometry, land cover, soil properties, and meteorological data. It enables the construction of unstructured meshes that incorporate this data, and provides tools for automating a “first” simulation on any watershed in the United States. We present the design of the workflow tool, and describe best practices for its usage, culminating in a final example from watershed specification to simulation at the Coweeta Hydrologic Laboratory.

Integrated hydrologic modeling↗

DOE OSTI2025

Modeling and Simulation of Fuel Dispersal During the Loss-of-Coolant Accident

This document is the compilation of the milestone portion to a larger end of project NEUP report. The executive summary of the modeling portion is provided below: In the event of cladding rupture during a postulated LOCA in a pressurized water reactor, fuel particles, along with fission gases, can be expelled into the reactor core from the fractured fuel rod, a phenomenon referred to as fuel dispersal. The initial stage of fuel dispersal is strongly influenced by the high-pressure ejection of fuel fragments, the size and geometry of the ruptured cladding, and the depressurization history of the fuel rod during the postulated LOCA transient. Depending on the location of the burst orifice relative to the quench front, the dispersal event represents an intricate three-phase flow and heat transfer phenomenon, where high-temperature fuel particles carried by the fission gases interact with the coolant within the narrow subchannels of the fuel assemblies, inducing localized phase change. Given the unique multiphysics nature of this phenomena, the current study develops a dedicated computational framework to predict the mass distribution and cooling of dispersing fuel particles, facilitating post-accident assessment and management of the fuel assemblies. Considering the scale of nuclear reactor applications, a continuum three-fluid model is proposed for simulating the transport of solids within the reactor core. With high-temperature fuel fragments within the liquid media, nucleation sites inducing phase changes are dispersed within the flow domain. Coupled with the fact that the transient dispersal event occurs on different time scales than other three-phase flow applications, this study derives a time-averaged three-fluid flow model without losing generality. The assumptions regarding the continuum treatment of the solid phase and the modeling of fuel dispersal behavior are incorporated to simplify the governing equations and derive applicable closure relations. The computational validation of the model was conducted using adiabatic experimental results obtained from ongoing research at Oregon State University, focusing on characterizing fuel dispersal behavior during simulated LOCA conditions. Settlement characteristics of the solids, quantified by the probability distribution of equivalent particles, closely matched the probability density functions reported in experimental studies. The transport of fuel particles within a scaled 5 × 5 lattice of a pressurized-water reactor rod bundle geometry was modeled through a two-fluid Eulerian framework. The required boundary conditions were evaluated from the fuel performance code BISON in a postulated large-break LOCA scenario. The modeling framework considered solid fuel particles as granular matter, interacting with the gaseous dry steam phase and fission gases through the governing interfacial momentum exchange between the participating fluids. The simulation results provided the volume fraction of the solids obtained at the bottom surface of the enclosing tank geometry. Postulated LOCA leading to fuel dispersal phenomena involves the strong coupling between fuel thermomechanics, cladding deformation, thermal-hydraulics, and fuel particle transport. Incorporation of such a strong coupling in numerical simulation is performed by coupling the multiphysics solvers. In the case of fuel dispersal, a strong coupled simulation can be performed by coupling the BISON code for fuel performance, the TRACE code for system-level thermal hydraulics, and fuel particle transport in Multiphysics Object-Oriented Simulation Environment (MOOSE). For such intricate infrastructure, the MOOSE Framework eases the data transfer between codes. The recent version of MOOSE has incorporated the Navier-Stokes module for the fluid flow. An exploratory exercise was done to gain familiarity with finite volume capabilities in the MOOSE framework to incorporate the Spalart-Allmaras (SA) turbulence model. New finite-volume and auxiliary kernels were introduced to assemble the SA transport equation, compute turbulent viscosity, and evaluate wall distance and diagnostic turbulence terms, fully integrated with existing Navier-Stokes modules. A turbulent lid-driven cavity at a Reynolds number of approximately 10,000 is used for verification. MOOSE shows the robust solver convergence and produces the turbulent features. But it underpredicts the velocity profile and turbulent quantities, emphasizing the need to develop improved SA near-wall treatments (e.g., low-Re corrections or wall functions) as a key direction for future work.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

DOE OSTI2025

Job Scheduler-Driven Power Gateway for High Performance Computing

Power gateways in the form of a microgrid can incorporate multiple distributed energy resources (DER) in either grid forming or grid following mode and support high performance computing (HPC) power profiles including the large load-follow requirements observed in multi-user HPC systems. The microgrid’s flexibility to operate in either grid forming or grid following mode and to actively switch between these modes enables baseline power from multiple non-baseline DER while maintaining high power quality metrics for the HPC system. But this enormous flexibility in demand response and time of use shifting is generally programmed independently of any integration with an HPC job scheduler which can better inform the load shaping by the microgrid. While there are many existing approaches where the HPC job scheduler takes in information from the grid to make queue scheduling decisions, this work takes the opposite view and explores a scheduler where the jobs in the queue can directly impact the settings of the grid. Several HPC scheduler strategies are tested where the jobs in the queue directly impact the settings of a microgrid designed for HPC operation which is driving a datacenter with three classes of HPC architectures. The scheduler operation is shown using a microgrid with 64 kW of solar capacity and 320 kWh of battery over a period of 21 days operating with significant low-follow swings, a throttled grid, cloudy conditions, switching between grid following and grid forming modes, and a wide range of battery states-of-charge all while maintaining high quality power metrics. The scheduler provides a mechanism for the job queue to directly impact a power gateway like a microgrid and to improve HPC power outcomes such as maximizing renewable energy usage

microgrid↗

DOE OSTI2020

Joint Estimation of Topology and Injection Statistics in Distribution Grids with Missing Nodes

Optimal operation of distribution grid resources relies on accurate estimation of its state and topology. Practical estimation of such quantities is complicated by the limited presence of real-time meters. This article discusses a theoretical framework to jointly estimate the operational topology and statistics of injections in radial distribution grids under limited availability of nodal voltage measurements. In particular, we show that our proposed algorithms are able to provably learn the exact grid topology and injection statistics at all unobserved nodes as long as they are not adjacent. The algorithm design is based on novel ordered trends in voltage magnitude fluctuations at node groups, that are independently of interest for radial physical flow networks. The complexity of the designed algorithms is theoretically analyzed and their performance is validated using both linearized and nonlinear ac power flow samples in test distribution grids.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Yet Another Discriminant Analysis (YADA): A Probabilistic Model for Machine Learning Applications

This paper presents a probabilistic model for various machine learning (ML) applications. While deep learning (DL) has produced state-of-the-art results in many domains, DL models are complex and over-parameterized, which leads to high uncertainty about what the model has learned, as well as its decision process. Further, DL models are not probabilistic, making reasoning about their output challenging. In contrast, the proposed model, referred to as Yet Another Discriminate Analysis(YADA), is less complex than other methods, is based on a mathematically rigorous foundation, and can be utilized for a wide variety of ML tasks including classification, explainability, and uncertainty quantification. YADA is thus competitive in most cases with many state-of-the-art DL models. Ideally, a probabilistic model would represent the full joint probability distribution of its features, but doing so is often computationally expensive and intractable. Hence, many probabilistic models assume that the features are either normally distributed, mutually independent, or both, which can severely limit their performance. YADA is an intermediate model that (1) captures the marginal distributions of each variable and the pairwise correlations between variables and (2) explicitly maps features to the space of multivariate Gaussian variables. Numerous mathematical properties of the YADA model can be derived, thereby improving the theoretic underpinnings of ML. Validation of the model can be statistically verified on new or held-out data using native properties of YADA. However, there are some engineering and practical challenges that we enumerate to make YADA more useful.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

DOE OSTI2025

Practical Probabilistic Programming

Recent advances in probabilistic programming languages (PPLs) have provided the capability for exact inference: computing a closed-form probability distribution for a given probabilistic program. In particular, the new language Roulette uses a language oriented programming (LOP) approach, wherein analysts build new programming languages on top of a set of primitives provided by Roulette, which then translates these structures into a weighted model counting problem which can be solved by automated reasoning tools. However, because Roulette provides few convenience features, developing these new languages is challenging even for expert users. We developed a standard library of common probability functions for Roulette with the goal of improved usability. This included approximation of continuous probability density functions using discrete probability mass functions. We demonstrated this approach by modeling a cosmic ray striking a RAM controller. We found that Roulette provides a powerful interface for highly expressive probabilistic programs to be generated. In collaboration with the NNSA Advanced Simulation and Computing program, which resulted in development of a tool called Circulette, we were able to model complex circuits expressed in Verilog using probabilistic programs with an expressivity not previously possible. Our research question that motivated the development of a Roulette standard library was to determine whether non-experts could use a PPL to model relevant problems regarding radiation effects on microelectronics. This standard library improved the expressivity of Roulette by implementing common probability density functions, mathematical operators on distributions, and support for empirical distributions. While Roulette is a powerful modeling language, the untyped, LOP approach makes error messages difficult to understand and requires expert aid. We recommend further research on Roulette, especially with its error messages, to enable improved usability. At the same time, this project demonstrated that for users familiar with Roulette and the LOP approach, Roulette provides powerful new capabilities that can be integrated with other Sandia modeling capabilities.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Electron energy distributions in the extended gas nebulae associated with high-z AGN: Maxwell–Boltzmann versus κ distributions

ABSTRACT Emission line observations together with photoionization models provide important information about the ionization mechanisms, densities, temperatures, and metallicities in active galactic nuclei (AGN)-ionized gas. Photoionization models usually assume Maxwell–Boltzmann (M–B) electron energy distributions (EED), but it has been suggested that using κ distributions may be more appropriate and could potentially solve the discrepancies in temperatures and abundances found in HII regions and planetary nebulae. We consider the impact of the presence of κ distributions in photoionized nebulae associated with AGN and study how this might affect spectral modelling and abundance analyses for such regions. Using the photoionization code MAPPINGS 1e, we compute models adopting M–B and κ distributions of electron energies and compare the behaviour of emission line ratios for different values of κ, gas metallicity, density, ionization parameter, and SED slope. We find that the choice of EED can have a large impact on some UV and optical emission lines emitted by photoionized nebulae associated with AGN, and that the impact of adopting a κ distribution is strongly dependent on gas metallicity and ionization parameter. We compile a sample of line ratios for 143 type 2 AGN and compare our models against the observed line ratios. We find that for 98 objects, κ distributions provide a better fit to the observed line ratios than M–B distributions. In addition, we find that adopting κ-distributed electron energies results in significant changes in the inferred gas metallicity and ionization parameter in a significant fraction of objects.

Morais, S. G. (ORCID:0000000200927813)↗