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 1,459 records · Page 81
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

A Combined Day-ahead and Real-time approach for Scheduling Real and Reactive power dispatch of Battery Energy Storage System

A combined day-ahead (look-ahead) and real-time optimization approach is proposed to schedule BESS real and reactive power dispatch. The look ahead scheduling agent maximizes profit and essentially performs the function of energy arbitrage by looking at forecasted prices, network constraints and BESS operating conditions to generate real power dispatch schedule. While this schedule is followed, the real time optimization agent computes an optimum reactive power set-point (for a particular objective function) using optimal power flow framework. The concepts are implemented by co-simulating legacy tools and demonstrated on a large real world distribution system. In addition to the profits from energy arbitrage, optimum reactive power set point computation results in achieving desirable network attributes like flat voltage profiles and minimizing voltage deviations from desired value.

Bhatti, Bilal A.↗
DOE OSTI2022

Mitigating the Impacts of Uncertain Geomagnetic Disturbances on Electric Grids: A Distributionally Robust Optimization Approach

Severe geomagnetic disturbances (GMDs) increase the magnitude of the electric field on the Earth’s surface (E-field) and drive geomagnetically-induced currents (GICs) along the transmission lines in electric grids. These additional currents can pose severe risks, such as current distortions, transformer saturation and increased reactive power losses, each of which can lead to system unreliability. Today several mitigation actions (e.g., changing grid topology) exist that can reduce the harmful GIC effects on the grids. Making such decisions can be challenging, however, because the magnitude and direction of the E-field are uncertain and non-stationary. In this paper, we model uncertain E-fields using the distributionally robust optimization (DRO) approach that determines optimal transmission grid operations such that the worst-case expectation of the system cost is minimized. We also capture the effect of GICs on the nonlinear AC power flow equations. For solution approaches, we develop an accelerated column-and-constraint generation (CCG) algorithm by exploiting a special structure of the support set of uncertain parameters representing the E-field. Extensive numerical experiments based on “epri-21” and “uiuc-150” systems, designed for GMD studies, demonstrate (i) the computational performance of the accelerated CCG algorithm, (ii) the superior performance of distributionally robust grid operations that satisfy nonlinear, nonconvex AC power flow equations and GIC constraints, in comparison with standard stochastic programming-based methods during the out-of-sample testing.

42 ENGINEERING↗
DOE OSTI2023

Solving multiphysics-based inverse problems with learned surrogates and constraints

Abstract Solving multiphysics-based inverse problems for geological carbon storage monitoring can be challenging when multimodal time-lapse data are expensive to collect and costly to simulate numerically. We overcome these challenges by combining computationally cheap learned surrogates with learned constraints. Not only does this combination lead to vastly improved inversions for the important fluid-flow property, permeability, it also provides a natural platform for inverting multimodal data including well measurements and active-source time-lapse seismic data. By adding a learned constraint, we arrive at a computationally feasible inversion approach that remains accurate. This is accomplished by including a trained deep neural network, known as a normalizing flow, which forces the model iterates to remain in-distribution, thereby safeguarding the accuracy of trained Fourier neural operators that act as surrogates for the computationally expensive multiphase flow simulations involving partial differential equation solves. By means of carefully selected experiments, centered around the problem of geological carbon storage, we demonstrate the efficacy of the proposed constrained optimization method on two different data modalities, namely time-lapse well and time-lapse seismic data. While permeability inversions from both these two modalities have their pluses and minuses, their joint inversion benefits from either, yielding valuable superior permeability inversions and CO 2 plume predictions near, and far away, from the monitoring wells.

Yin, Ziyi (ORCID:0000000250248771)↗
DOE OSTI2021

Systems and methods for randomized, packet-based power management of conditionally-controlled loads and bi-directional distributed energy storage systems

The present disclosure provides a distributed and anonymous approach to demand response of an electricity system. The approach conceptualizes energy consumption and production of distributed-energy resources (DERs) via discrete energy packets that are coordinated by a cyber computing entity that grants or denies energy packet requests from the DERs. The approach leverages a condition of a DER, which is particularly useful for (1) thermostatically-controlled loads, (2) non-thermostatic conditionally-controlled loads, and (3) bi-directional distributed energy storage systems. In a first aspect of the present approach, each DER independently requests the authority to switch on for a fixed amount of time (i.e., packet duration). The coordinator determines whether to grant or deny each request based electric grid and/or energy or power market conditions. In a second aspect, bi-directional DERs, such as distributed-energy storage systems (DESSs) are further able to request to supply energy to the grid.

Frolik, Jeff↗
DOE OSTI2024

Systems and methods for randomized energy draw or supply requests

The present disclosure can provide a distributed and anonymous approach to demand response of an electricity system. The approach can conceptualize energy consumption and production of distributed-energy resources (DERs) via discrete energy packets that are coordinated by a cyber computing entity that grants or denies energy packet requests from the DERs. The approach leverages a condition of a DER, which is particularly useful for (1) thermostatically-controlled loads, (2) non-thermostatic conditionally-controlled loads, and (3) bi-directional distributed energy storage systems, among others. In a first aspect of the present approach, each DER independently requests the authority to switch on for a fixed amount of time (i.e., packet duration). The coordinator determines whether to grant or deny each request based electric grid and/or energy or power market conditions. In a second aspect, bi-directional DERs, such as distributed-energy storage systems (DESSs) are further able to request to supply energy to the grid.

Frolik, Jeff↗
DOE OSTI2023

Seeing through noise in power laws

Despite widespread claims of power laws across the natural and social sciences, evidence in data is often equivocal. Modern data and statistical methods reject even classic power laws such as Pareto’s law of wealth and the Gutenberg–Richter law for earthquake magnitudes. We show that the maximum-likelihood estimators and Kolmogorov–Smirnov (K-S) statistics in widespread use are unexpectedly sensitive to ubiquitous errors in data such as measurement noise, quantization noise, heaping and censorship of small values. This sensitivity causes spurious rejection of power laws and biases parameter estimates even in arbitrarily large samples, which explains inconsistencies between theory and data. We show that logarithmic binning by powers of λ > 1 attenuates these errors in a manner analogous to noise averaging in normal statistics and that λ thereby tunes a trade-off between accuracy and precision in estimation. Binning also removes potentially misleading within-scale information while preserving information about the shape of a distribution over powers of λ, and we show that some amount of binning can improve sensitivity and specificity of K-S tests without any cost, while more extreme binning tunes a trade-off between sensitivity and specificity. We therefore advocate logarithmic binning as a simple essential step in power-law inference.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The PAU Survey: an improved photo- z sample in the COSMOS field

Here we present – and make publicly available – accurate and precise photometric redshifts in the ACS footprint from the COSMOS field for objects with i AB ≤ 23. The redshifts are computed using a combination of narrow-band photometry from PAUS, a survey with 40 narrow bands spaced at $100\,\mathring{\rm A}$ intervals covering the range from 4500 to $8500\,\mathring{\rm A}$, and 26 broad, intermediate, and narrow bands covering the UV, visible and near-infrared spectrum from the COSMOS2015 catalogue. We introduce a new method that models the spectral energy distributions as a linear combination of continuum and emission-line templates and computes its Bayes evidence, integrating over the linear combinations. The correlation between the UV luminosity and the $\mathrm{O\,{\small II}}$ line is measured using the 66 available bands with the zCOSMOS spectroscopic sample, and used as a prior which constrains the relative flux between continuum and emission-line templates. The flux ratios between the $\mathrm{O\,{\small II}}$ line and H α , H β and $\mathrm{O\,{\small III}}$ are similarly measured and used to generate the emission-line templates. Comparing to public spectroscopic surveys via the quantity Δ z ≡ (z photo – z spec )/(1 + z spec ), we find the photometric redshifts to be more precise than previous estimates, with σ 68 (Δ z ) ≈ (0.003, 0.009) for galaxies at magnitude i AB ~ 18 and i AB ~ 23, respectively, which is three times and 1.66 times tighter than COSMOS2015. Additionally, we find the redshifts to be very accurate on average, yielding a median of the Δ z distribution compatible with |median(Δ z )| ≤ 0.001 at all redshifts and magnitudes considered. Both the added PAUS data and new methodology contribute significantly to the improved results. The catalogue produced with the technique presented here is expected to provide a robust redshift calibration for current and future lensing surveys, and allows one to probe galaxy formation physics in an unexplored luminosity-redshift regime, thanks to its combination of depth, completeness, and excellent redshift precision and accuracy.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

Multi-level Monte Carlo methods in chemical applications with Lennard-Jones potentials and other landscapes with isolated singularities

We describe and compare outcomes of various Multi-Level Monte Carlo (MLMC) method variants, motivated by the potential of improved computational efficiency over rejection based Monte Carlo, which scales poorly with problem dimension. With an eye toward its application to computational chemical physics, we test MLMC's ability to sample trajectories on two problems — a familiar double-well potential, with known stationary distributions, and a Lennard-Jones solid potential (a Galton Board). By sampling Brownian motion trajectories, we are able to compute expectations of observable averages. These multi-basin potential energy problems capture the essence of the challenges with using MLMC, namely, maintaining correspondence of sample paths as time-resolution is varied. Addressing this challenge properly can lead to MLMC significantly outperforming standard Monte Carlo path sampling. We describe the essence of this problem and suggest strategies that circumvent diverging multilevel sample paths for an important class of problems. In the tests we also compare the computational cost of several, “adaptive,” variants of MLMC. Our results demonstrate that MLMC overcomes the collision, time scale limitation of the more familiar Brownian path MC samplers, and our implementation provides tunable error thresholds, making MLMC a promising candidate for application to larger and more complex molecular systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Development of experimental and computational frameworks to predict subcooled flow boiling in the LANL Isotope Production Facility

Cooling is crucial to maintain the integrity of target systems in isotope production facilities. At Los Alamos National Laboratory (LANL)’s Isotope Production Facility (IPF), multiple encapsulated targets are stacked and irradiated in tandem with a 100 MeV, ~250μA proton beam. To facilitate effective heat removal, these stacked targets are separated and cooled via a series of water channels. At these beam currents, this high-energy proton beam heats the target system, likely initiating subcooled flow boiling in the cooling channels. However, in-beam monitoring of the IPF target system is not possible due to the extreme radiation environment, and the necessarily significant shielding. To better understand high-power target performance, we developed ex-situ experimental and computational frameworks to predict the behavior of subcooled flow boiling at IPF. Subcooled flow boiling experiments on Inconel 625 samples under IPF conditions (2 bar pressure, 10 GPM flow rate (i.e., 2249 kg/m 2 /s), 85 K subcooling) revealed that IPF's average operating power is at the early stage of boiling with a heat transfer coefficient of 48,000 W/m 2 /s. The proposed modeling framework enables us to predict a complete boiling curve, i.e., single-phase heat transfer, onset of nucleate boiling, two-phase heat transfer, and critical heat flux (CHF), with specification of input boiling parameters up to intermediate heat flux levels. The estimated CHF under IPF conditions is 5.2 MW/m 2 . Experimental data under reduced conditions (2 bar pressure, 1.5 GPM flow rate (i.e., 337 kg/m 2 /s), 45 K subcooling) served as validation cases for the computational modeling. This computational model can be further extended to more complicated systems replicating the real IPF configuration, for instance, to study void distribution as a function of the incident proton beam profile and coolant velocity profile of multiple cooling channels. Finally, the proposed experimental and computational frameworks provide a means to better understand cooling systems in the isotope production facilities at different accelerators, where in-beam monitoring of the cooling process is not available.

07 ISOTOPE AND RADIATION SOURCES↗
DOE OSTI2022

Towards scaling community detection on distributed-memory heterogeneous systems

Distributed multi-GPU systems pose significant challenges and opportunities for efficient execution of parallel applications. Graph algorithms are generally characterized by irregular memory accesses, low computation to communication ratios, and load balancing problems that are especially hard to address on multi-GPU systems. Graph community detection is an important problem in the emerging domain of graph analytics with numerous applications. In this paper, we present our ongoing work on distributed-memory multi-GPU implementation for graph community detection. Our work parallelizes the widely used (albeit serial) Louvain method on distributed multi-GPU platforms. Supported by an extensive set of experiments on a multi-GPU enabled supercomputer (OLCF Summit) and a single compute node (Nvidia DGX-2®), we demonstrate competitive performance to existing distributed-memory CPU-based implementation, and up to 6.5 better results than Nvidia RAPIDS® CUGRAPH. To the best of our knowledge, this work represents the first effort for community detection on distributed multi-GPU systems. Our approach and related findings can be extended to numerous other iterative graph algorithms on multi-GPU systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

GeV-scale neutrinos: interactions with mesons and DUNE sensitivity

The simplest extension of the SM to account for the observed neutrino masses and mixings is the addition of at least two singlet fermions (or right-handed neutrinos). If their masses lie at or below the GeV scale, such new fermions would be produced in meson decays. Similarly, provided they are sufficiently heavy, their decay channels may involve mesons in the final state. Although the couplings between mesons and heavy neutrinos have been computed previously, significant discrepancies can be found in the literature. The aim of this paper is to clarify such discrepancies and provide consistent expressions for all relevant effective operators involving mesons with masses up to 2 GeV. Moreover, the effective Lagrangians obtained for both the Dirac and Majorana scenarios are made publicly available as FeynRules models so that fully differential event distributions can be easily simulated. As an application of our setup, we numerically compute the expected sensitivity of the DUNE near detector to these heavy neutral leptons.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗
DOE OSTI2021

Blockchain Enabled Intelligence of Federated Systems (BELIEFS): An attack-tolerant trustable distributed intelligence paradigm

In this article, a Blockchain Enabled Intelligence of Federated Systems (BELIEFS) is proposed to conduct cooperative control for the multi-regional large-scale power system with a multi-agents system (MAS). By establishing a two levels blockchain, each regional AI agent can simultaneously manage intra-regional controllers and cooperate with other AI agents. Under the consensus mechanism, the agents, which respectively conducted distributed deep reinforcement learning (DDRL) algorithm in multi-regions, can have the tolerant capability of malicious attacks in their training process. The demonstration of the proposed approach is within a multi-regional large-scale interconnected power system. Under the mode of "centralized dispatching and hierarchical management", this article aims to definite a mathematical model to deal with the control problem of the power systems. With the comparison experiments, the effectiveness and efficiency of our proposed method in the training process are verified. In addition, malicious attacks are set on the main chain and shard chains to verify the attack-tolerant capability. We expect that such approach and results can suggest a new paradigm of attack-tolerant trustable distributed AI deployment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

LDMS-GPU: Lightweight Distributed Metric Service (LDMS) for NVIDIA GPGPUs

GPUs are now a fundamental accelerator for many high-performance computing applications. They are viewed by many as a technology facilitator for the surge in fields like machine learning and Convolutional Neural Networks. To deliver the best performance on a GPU, we need to create monitoring tools to ensure that we optimize the code to get the most performance and efficiency out of a GPU. Since NVIDIA GPUs are currently the most commonly implemented in HPC applications and systems, NVIDIA tools are the solution for performance monitoring. The Light-Weight Distributed Metric System (LDMS) at Sandia is an infrastructure widely adopted for large-scale systems and application monitoring. Sandia has developed CPU application monitoring capability within LDMS. Therefore, we chose to develop a GPU monitoring capability within the same framework. In this report, we discuss the current limitations in the NVIDIA monitoring tools, how we overcame such limitations, and present an overview of the tool we built to monitor GPU performance in LDMS and its capabilities. Also, we discuss our current validation results. Most of the performance counter results are the same in both vendor tools and our tool when using LDMS to collect these results. Furthermore, our tool provides these statistics during the entire runtime of the tool as a time series and not just aggregate statistics at the end of the application run. This allows the user to see the progress of the behavior of the applications during their lifetime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

FTS3: Data Movement Service in containers deployed in OKD [Slides]

The File Transfer Service (FTS3) is a data movement service developed at CERN which is used to distribute the majority of the Large Hadron Collider's data across the Worldwide LHC Computing Grid (WLCG) infrastructure. At Fermilab, we have deployed FTS3 instances for Intensity Frontier experiments (e.g. DUNE) to transfer data in America and Europe, using a container-based strategy. In this article we summarize our experience building docker images based on work from the SLATE project (slateci.io) and deployed in OKD, the community distribution of Red Hat OpenShift. Additionally, we discuss our method of certificate management and maintenance utilizing Kubernetes CronJobs. Finally, we also report on the two different configurations currently running at Fermilab, comparing and contrasting a Docker-based OKD deployment against a traditional RPM-based deployment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Volumetric Density-Equalizing Reference Map with Applications

The density-equalizing map, a technique developed for cartogram creation, has been widely applied to data visualization but only for 2D applications. Here, we propose a novel method called the volumetric density-equalizing reference map (VDERM) for computing density-equalizing map for volumetric domains. Given a prescribed density distribution in a volumetric domain in $\mathbb{R}^3$, the proposed method continuously deforms the domain, with different volume elements enlarged or shrunk according to the density distribution. With the aid of the proposed method, medical and sociological data can be visualized via deformations of 3D objects. The method can also be applied to adaptive remeshing and shape modeling. Furthermore, by exploiting the time-dependent nature of the proposed method, applications to shape morphing can be easily achieved. Experimental results are presented to demonstrate the effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Machine Learning Analysis of Hydrologic Exchange Flows and Transit Time Distributions in a Large Regulated River

Hydrologic exchange between river channels and adjacent subsurface environments is a key process that influences water quality and ecosystem function in river corridors. High-resolution numerical models were often used to resolve the spatial and temporal variations of exchange flows, which are computationally expensive. In this study, we adopt Random Forest (RF) and Extreme Gradient Boosting (XGB) approaches for deriving reduced order models of hydrologic exchange flows and associated transit time distributions, with integrated field observations (e.g., bathymetry) and hydrodynamic simulation data (e.g., river velocity, depth). The setup allows an improved understanding of the influences of various physical, spatial, and temporal factors on the hydrologic exchange flows and transit times. The predictors also contain those derived using hybrid clustering, leveraging our previous work on river corridor system hydromorphic classification. The machine learning-based predictive models are developed and validated along the Columbia River Corridor, and the results show that the top parameters are the thickness of the top geological formation layer, the flow regime, river velocity, and river depth; the RF and XGB models can achieve 70% to 80% accuracy and therefore are effective alternatives to the computational demanding numerical models of exchange flows and transit time distributions. Each machine learning model with its favorable configuration and setup have been evaluated. The transferability of the models to other river reaches and larger scales, which mostly depends on data availability, is also discussed.

97 MATHEMATICS AND COMPUTING↗