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,603 records · Page 89
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Multi-GPU immersed boundary method hemodynamics simulations

Large-scale simulations of blood flow that resolve the 3D deformation of each comprising cell are increasingly popular owing to algorithmic developments in conjunction with advances in compute capability. Among different approaches for modeling cell-resolved hemodynamics, fluid structure interaction (FSI) algorithms based on the immersed boundary method are frequently employed for coupling separate solvers for the background fluid and the cells within one framework. GPUs can accelerate these simulations; however, both current pre-exascale and future exascale CPU-GPU heterogeneous systems face communication challenges critical to performance and scalability. In this paper, we describe, to our knowledge, the largest distributed GPU-accelerated FSI simulations of high hematocrit cell-resolved flows with over 17 million red blood cells. We compare scaling on a fat node system with six GPUs per node and on a system with a single GPU per node. Through comparison between the CPU- and GPU-based implementations, we identify the costs of data movement in multiscale multi-grid FSI simulations on heterogeneous systems and show it to be the greatest performance bottleneck on the GPU.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Scattering using real-time path integrals

Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While imaginary time treatments of scattering are possible, imaginary time is not a natural framework for treating scattering problems. More importantly, quantum algorithms for calculating path integrals require real-time evolution. Purpose: Here, we test a recently introduced method for performing direct calculations of scattering observables using real-time path integrals in order to understand the challenges facing real-time path integral calculations of scattering observables. Method: The computations are based on a new interpretation of the path integral as the expectation value of a potential functional on cylinder sets of continuous paths with respect to a complex probability distribution. The method can in principle be applied to arbitrary short-range potentials. Results: The method is applied to compute matrix elements of Møller wave operators applied to narrow wave packets. These are used to calculate half-shell sharp-momentum transition matrix elements for one-dimensional potential scattering. The calculations for half-shell transition operator matrix elements converge to the numerical solution of the Lippmann-Schwinger equation. Conclusions: This work presents a proof in principle that scattering observables can be computed using real-time Feynman path integrals. While the computational method is not efficient, it can be improved. It provides a laboratory for studying quantum computational algorithms that are applicable to scattering problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Cooperative fault management for resilient integration of renewable energy

Cooperative fault management (CFM) is designed herein to control different types of renewable energy resources cooperatively during electrical faults. This paper studies systems with a high penetration of photovoltaic (PV) energy and wind energy. First, CFM leverages power converters of PV farms to boost the ride-through capability of nearby doubly-fed induction generators (DFIGs). By controlling PV farms’ output voltages to change smoothly during both fault initiation and fault clearance, the widely used crowbar in DFIGs is less likely to be activated. Crowbar activation adversely makes DFIGs lose controllability and absorb reactive power. The second contribution is the development of a software-defined CFM controller and a controller in-the-loop demonstration of the real-time performance of this optimization-based CFM. CFM capitalizes on distributed optimization formulation to enable flexibility, plug-and-play, and privacy-preserving. Computation time, however, is a major concern for optimization-based dynamics control. Here, real-time controller-in-the-loop simulation results show optimization-based CFM can output reference values around 60 ms and is quick enough for dynamic control.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

An Adaptive-Importance-Sampling-Enhanced Bayesian Approach for Topology Estimation in an Unbalanced Power Distribution System

The reliable operation of a power distribution system relies on a good prior knowledge of its topology and its system state. Although crucial, due to the lack of direct monitoring devices on the switch statuses, the topology information is often unavailable or outdated for the distribution system operators for real-time applications. Apart from the limited observability of the power distribution system, other challenges are the nonlinearity of the model, the complicated, unbalanced structure of the distribution system, and the scale of the system. To overcome the above challenges, we, in this paper, propose a Bayesian-inference framework that allows us to simultaneously estimate the topology and the state of a three-phase, unbalanced power distribution system. Specifically, by using the very limited number of measurements available that are associated with the forecast load data, we efficiently recover the full Bayesian posterior distributions of the system topology under both normal and outage operation conditions. This is performed through an adaptive importance sampling procedure that greatly alleviates the computational burden of the traditional Monte-Carlo (MC)-sampling-based approach while maintaining a good estimation accuracy. The simulations conducted on the IEEE 123-bus test system and an unbalanced 1282-bus system reveal the excellent performances of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Hierarchical Optimal Power Flow with Improved Gradient Evaluation

Existing algorithms to solve alternating-current optimal power flow (AC-OPF) often exploit linear approximations to simplify system models and accelerate computations. In this paper, we improve a recent hierarchical OPF algorithm, which rested on primal-dual gradients evaluated in a linearized distribution power flow model. Specifically, we identify a risk of voltage violation arising from the model linearization, and propose a more accurate gradient evaluation method to eliminate that risk. We further develop a hierarchical primal-dual algorithm to solve OPF based on the proposed gradient evaluation method. Numerical results on IEEE networks show that our algorithm can enhance voltage safety with satisfactory computational efficiency.

distributed algorithm↗
DOE OSTI2023

Securely Aggregated Coded Matrix Inversion

Coded computing is a method for mitigating straggling workers in a centralized computing network, by using erasure-coding techniques. Federated learning is a decentralized model for training data distributed across client devices. In this work we propose approximating the inverse of an aggregated data matrix, where the data is generated by clients; similar to the federated learning paradigm, while also being resilient to stragglers. To do so, we propose a coded computing method based on gradient coding. We modify this method so that the coordinator does not access the local data at any point; while the clients access the aggregated matrix in order to complete their tasks. Here, the network we consider is not centrally administrated, and the communications which take place are secure against potential eavesdroppers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Genome-Wide Discovery of G-Quadruplexes in Wheat: Distribution and Putative Functional Roles

G-quadruplexes are nucleic acid secondary structures formed by a stack of square planar G-quartets. G-quadruplexes were implicated in many biological functions including telomere maintenance, replication, transcription, and translation, in many species including humans and plants. For wheat, however, though it is one of the world’s most important staple food, no G-quadruplex studies have been reported to date. Here, we computationally identify putative G4 structures (G4s) in wheat genome for the first time and compare its distribution across the genome against five other genomes (human, maize, Arabidopsis, rice, and sorghum). We identified close to 1 million G4 motifs with a density of 76 G4s/Mb across the whole genome and 93 G4s/Mb over genic regions. Remarkably, G4s were enriched around three regions, two located on the antisense and one on the sense strand at the following positions: 1) the transcription start site (TSS) (antisense), 2) the first coding domain sequence (CDS) (antisense), and 3) the start codon (sense). Functional enrichment analysis revealed that the gene models containing G4 motifs within these peaks were associated with specific gene ontology (GO) terms, such as developmental process, localization, and cellular component organization or biogenesis. We investigated genes encoding MADS-box transcription factors and showed examples of G4 motifs within critical regulatory regions in the VRN-1 genes in wheat. Furthermore, comparison with other plants showed that monocots share a similar distribution of G4s, but Arabidopsis shows a unique G4 distribution. Our study shows for the first time the prevalence and possible functional roles of G4s in wheat.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Impact of FERC Order 2222 on DER Participation Rules in US Electricity Markets

Electricity markets in the bulk grid are beginning to implement market mechanisms that support the procurement of flexible capabilities from wide range of technologies, including distributed energy resources (DERs). The flexibility of these resources will help counterbalance supply uncertainties from large-scale integration of variable renewable generation. To encourage development of distributed and aggregated market participants, FERC Order 2222 was issued in September 2020 to require each Independent System Operator (ISO) in the US to implement rules that enable broader participation from aggregations of DERs in the bulk market. The following paper first describes the generic design of ISO markets before introducing the new market participation rules that ISOs have proposed for compliance with Order 2222. The paper then describes how software performance issues may continue to affect the eligibility requirements and offer structures for DER aggregations participating in ISOs, noting that continued research on computational methods may help reduce burdens for DER integration. The prospects for transmission and distribution system coordination is second major issue discussed, which will require minor changes to existing processes in the short term. In the longer term, there is more opportunity for more wide-ranging reforms, such as the development of a Distribution System Operator (DSO) framework. Newly proposed market rules may affect how Transactive Energy Systems (TES) will help facilitate efficient formation of DER aggregations and operation of the individual DERs within an aggregation. Within the TES context, the challenge is to fully understand how resource eligibility and operational and planning coordination methods will affect the design and implementation of TES.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Impact of Radial Reflector Fidelity on Neutronics and Vessel Fluence Simulations

The Consortium for Advanced Simulation of Light Water Reactors is developing the Virtual Environment for Reactor Applications (VERA), and the MPACT code, which is the primary deterministic neutron transport solver in VERA, provides sub-pin level flux and power distributions as part of full-scale cycle depletion and analysis. In such calculations, an important aspect is the radial reflector treatment. To improve the fidelity of the radial reflector treatment, MPACT was extended to approximate the modeling of the reactor’s structural components such as the core shroud, barrel, neutron pads, and vessel. This work explores several modeling configurations with varying levels of fidelity and computational burden and assesses the importance of modeling fidelity on the eigenvalue and pin power distribution. Two two-dimensional (2-D) problems were analyzed to assess the impact on eigenvalue and pin power distributions with low-fidelity, coarse square cell reflector representations: (1) a Watts Bar Nuclear Plant Unit 1 (WBN1) quarter-core slice with depletion and (2) an AP1000 quarter-core slice. In this work, the analyses showed that the effect on eigenvalue is fairly small, but the effect on pin power is more pronounced, especially locally in the assemblies closest to the periphery, where the maximum pin power difference is nearly 3.5% in the AP1000 case. Two additional 2-D problems were used to assess the comparison between the low-fidelity coarse square cell treatment and a high-fidelity geometric representation that uses subpin material specification: (1) the same WBN1 quarter-core slice and (2) a representative model of the NuScale small modular reactor (SMR), which features a solid reflector design with moderator holes. These results demonstrate that even a coarse, low-fidelity representation adequately captures the necessary simulation characteristics. Last, these capabilities were applied to the 2-D WBN1 quarter-core depletion to assess the impact on vessel fluence using VeraShift. From adjoint calculations, pins along the periphery were observed to be of highest importance for fluence calculation, so the impact of the reflector representation in MPACT could theoretically substantially affect the predicted result. However, it was observed that the change in pin powers along the periphery minimally impacts the maximum vessel fluence with a difference within the statistical uncertainty but provides terrific insight on the sensitivity of the peripheral pins.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Generation of group constants at GRS for the Rostov-2 benchmark

The OECD/NEA benchmark entitled 'Reactivity compensation of boron dilution by stepwise insertion of control rod cluster into the VVER-1000 core' aims at validating and assessing high fidelity multi-physics simulation code capabilities by comparison with the high-quality measurements performed at the nuclear power plant Rostov unit 2. The benchmark is divided into 2 phases: assembly wise and pin-by-pin resolution of the multi-physics problems. Multi-physics simulation requires the generation of an accurate parametrized few-group cross-section library, and so this benchmark offers an opportunity to validate the methodology for their generation. Based on the specifications of the benchmark, the core simulator KMACS developed at GRS was used to generate a library of cross-sections as well as the burnup distribution required to model the transient scenario of the benchmark at the assembly level. The assessment of the library is performed through comparison with measured values obtained at the initial state of the transient. Good agreement was obtained in terms of critical boron concentration, peaking factors and power profiles. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

CAFE AU LAIT: Compute-Aware Federated Augmented Low-Rank AI Training

Federated finetuning is crucial for unlocking the knowledge embedded in pretrained Large Language Models (LLMs) when data are geographically distributed across clients. Unlike finetuning with data from a single institution, federated finetuning allows collaboration across multiple institutions, enabling the utilization of diverse and decentralized datasets while preserving data privacy. Given the high computing costs of LLM training and the emphasis on energy efficiency in Federated Learning (FL), Low-Rank Adaptation (LoRA) has emerged as a widely adopted algorithm due to its significantly reduced number of trainable parameters. However, this assumes that all data silos have the necessary computing resources to compute local updates of LLMs. Nevertheless, in practice, the computing resources across clients are highly heterogeneous: while some may have access to hundreds of GPUs, others might have limited or no GPU access. Recently, federated finetuning using synthetic data has been proposed, allowing clients to participate in a collaborative training run without training LLMs locally. However, our experimental results reveal a performance gap between models trained using synthetic data and those trained using local updates. Motivated by the observed heterogeneity in computing resources and the performance gap, we propose a novel two-stage algorithm that leverages the storage and computing capabilities of a strong server. In the first stage, under the coordination of the strong server, clients with limited computing resources collaborate to generate synthetic data, which is transferred to and stored on the strong server. In the second stage, the strong server uses this synthetic data on behalf of the resource-constrained clients to perform federated LoRA finetuning alongside clients with sufficient computing resources. This approach ensures that all clients can participate in the finetuning process. Experimental results demonstrate that incorporating local updates from even a small fraction of clients improves performance compared to using synthetic data for all clients. Furthermore, we incorporate the Gaussian mechanism in both stages to guarantee client-level differential privacy.

Wang, Jiayi [ORNL]↗
DOE OSTI2025

Computationally efficient subglacial drainage modelling using Gaussian process emulators: GlaDS-GP v1.0

Subglacial drainage models represent water flow at the ice–bed interface through coupled distributed and channelized systems to determine water pressure, discharge, and drainage system geometry. While they are used to understand processes such as the relationship between surface melt and ice flow, the number of uncertain model parameters and the computational cost of running models makes it difficult to adequately explore the high-dimensional parameter space and evaluate uncertainty in model predictions. Here, we develop Gaussian process (GP) emulators that make fast predictions with associated uncertainty of subglacial drainage model outputs. Using a truncated principal component (PC) basis representation, we construct a GP emulator for diurnally averaged subglacial water pressure. We also explore emulation of scalar variables describing drainage efficiency and configuration. We train the emulators using ensembles of up to 512 simulations varying eight parameters of the Glacier Drainage System (GlaDS) model on a synthetic domain intended to represent an ice-sheet margin. The emulators make predictions ∼ 1000 times faster than GlaDS simulations, with errors <3 % for the water pressure field and ∼ 5 %–9 % for drainage efficiency and configuration. We apply the emulators to explore the eight-dimensional parameter space by computing variance-based parameter sensitivity indices, finding that three parameters (ice flow coefficient, bed bump aspect ratio, and the subglacial cavity system conductivity) explain 90 % of the variance in modelled water pressure in response to parameter changes. The GP emulator approach described here is well suited to integrating observational data with models to make calibrated, credible predictions of subglacial drainage.

58 GEOSCIENCES↗
DOE OSTI2025

Exascale granular microstructure reconstruction in 3D volumes of arbitrary geometries with generative learning

Reconstructing 3D granular microstructures within volumes of arbitrary geometries from limited 2D image data is crucial for predicting the material properties, as well as performances of structural components accounting for material microstructural effects. We present a novel generative learning framework that enables exascale reconstruction of granular microstructures within complex 3D geometric volumes. Building upon existing transfer learning techniques using pre-trained convolutional neural networks (CNN), we introduce several key innovations to overcome the difficulties inherent in arbitrary geometries. Our framework incorporates periodic boundary conditions using circular padding techniques, ensuring continuity and representativeness of the reconstructed microstructures. We also introduce a novel seamless transition reconstruction (STR) method that creates statistically equivalent transition zones to integrate multiple pre-existing 3D microstructure volumes. Based on STR, we propose a cost-effective strategy for reconstructing microstructures within complex geometric volumes, minimizing computational waste. Validation through numerical experiments using kinetic Monte Carlo simulations demonstrates accurate reproduction of grain statistics, including grain size distributions and morphology. A case study involving the reconstruction of a 4-blade propeller microstructure illustrates the method’s capability to efficiently handle complex geometries. In conclusion, the proposed framework significantly reduces computational demands while maintaining high reconstruction quality, paving the way for scalable microstructure reconstruction in materials design and analysis.

36 MATERIALS SCIENCE↗
DOE OSTI2023

IRIS-DMEM: Efficient Memory Management for Heterogeneous Computing

This paper proposes an efficient data memory management approach for the Intelligent RuntIme System (IRIS) heterogeneous computing framework along with new data transfer policies. IRIS provides a task-based programming model for extreme heterogeneous computing (e.g., CPU, GPU, DSP, FPGA) with support for today's most important programming languages (e.g., OpenMP, OpenCL, CUDA, HIP, OpenACC). However, the IRIS framework either forces the programmer to introduce data transfer commands for each task or relies on suboptimal memory management for automatic and transparent data transfers. The work described here extends IRIS with novel heterogeneous memory handling and introduces novel data transfer policies by employing the Distributed data MEMory handler (DMEM) for efficient and optimal movement of data among the various computing resources. The proposed approach achieves performance gains of up to 7× for tiled LU factorization and tiled DGEMM (i.e., matrix multiplication) benchmarks. Moreover, this approach also reduces data transfers by up to 71% when compared to previous IRIS heterogeneous memory management handlers. This work compares the performance results of the IRIS framework's novel DMEM with the StarPU runtime and MAGMA math library for GPUs. Experiments show a performance gain of up to 1.95× over StarPU and 2.1× over MAGMA.

Miniskar, Narasinga Rao↗
DOE OSTI2022

Computer-aided process intensification of natural gas to methanol process

The recent revolution in shale gas has presented opportunities for distributed manufacturing of key commodity chemicals, such as methanol, from methane. However, the conventional methane-to-methanol process is energy intensive which negatively affects the profitability and sustainability. Here an intensified process configuration that is both economically attractive and environmentally sustainable. This flowsheet is systematically discovered using the building block-based representation and optimization methodology. The new process configuration utilizes membrane-assisted reactive separations and can have as much as 190% higher total annual profit compared to a conventional configuration. Additionally, it has 57% less CO 2 -equivalent greenhouse gas emission. Such drastic improvement highlights the advantages of building block-based computer-aided process intensification method.

42 ENGINEERING↗
DOE OSTI2023

Estimating the Meridional Extent of Adiabatic Mixing in the Stratosphere Using Age-Of-Air

Wave-induced adiabatic mixing in the winter midlatitudes is one of the key processes impacting stratospheric transport. Understanding its strength and structure is vital to understanding the distribution of trace gases and their modulation under a changing climate. Age-of-air is often used to understand stratospheric transport, and this study proposes refinements to the vertical age gradient theory of Linz et al. (2021), https://doi.org/10.1029/2021JD035199. The theory assumes exchange of air between a well-mixed tropics and a well-mixed extratropics, separated by a transport barrier, quantifying the adiabatic mixing flux across the interface using age-based measures. These assumptions are re-evaluated and a refined framework that includes the effects of meridional tracer gradients is established to quantify the mixing flux. This is achieved, in part, by computing a circulation streamfunction in age-potential temperature coordinates to generate a complete distribution of parcel ages being mixed in the midlatitudes. The streamfunction quantifies the “true” age of parcels mixed between the tropics and the extratropics. Applying the revised theory to an idealized and a comprehensive climate model reveals that ignoring the meridional gradients in age leads to an underestimation of the wave-driven mixing flux. Stronger, and qualitatively similar fluxes are obtained in both models, especially in the lower-to-middle stratosphere. While the meridional span of adiabatic mixing in the two models exhibits some differences, they show that the deep tropical pipe, that is, latitudes equatorward of 15° barely mix with older midlatitude air. The novel age-potential temperature circulation can be used to quantify additional aspects of stratospheric transport.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Complexity-theoretic foundations of BosonSampling with a linear number of modes

BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the complexity-theoretic hardness arguments and current experiments. One of the largest gaps involves the ratio of {particles} to modes -- all current hardness evidence assumes a dilute regime in which the number of linear optical modes scales at least quadratically in the number of particles. By contrast, current experiments operate in a saturated regime with a linear number of modes. In this paper we bridge this gap, bringing the hardness evidence for experiments in the saturated regime to the same level as had been previously established for the dilute regime. This involves proving a new worst-to-average-case reduction for computing the Permanent which is robust to both large numbers of row repetitions and also to distributions over matrices with correlated entries. We also apply similar arguments to give evidence for hardness of Gaussian BosonSampling in the saturated regime.

Computational Complexity (cs.CC)↗
DOE OSTI2021

Approximating Nash Equilibrium in Day-ahead Electricity Market Bidding with Multi-agent Deep Reinforcement Learning

In this paper, a day-ahead electricity market bidding problem with multiple strategic generation company (GEN-CO) bidders is studied. The problem is formulated as a Markov game model, where GENCO bidders interact with each other todevelop their optimal day-ahead bidding strategies. Considering unobservable information in the problem, a model-free and data-driven approach, known as multi-agent deep deterministic policy gradient (MADDPG), is applied for approximating the Nash equilibrium (NE) in the above Markov game. The MADDPG algorithm has the advantage of generalization due to the automatic feature extraction ability of the deep neural networks. The algorithm is tested on an IEEE 30-bus system with three competitive GENCO bidders in both an uncongested caseand a congested case. Comparisons with a truthful bidding strategy and state-of-the-art deep reinforcement learning methods including deep Q network and deep deterministic policy gradient (DDPG) demonstrate that the applied MADDPG algorithm can find a superior bidding strategy for all the market participants with increased profit gains. In addition, the comparison with a conventional model-based method shows that the MADDPG algorithm has higher computational efficiency, which is feasible for real-world applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗