Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithm”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

An Ensemble-Based Smoother with Retrospectively Updated Weights for Highly Nonlinear Systems

Monte Carlo computational methods have been introduced into data assimilation for nonlinear systems in order to alleviate the computational burden of updating and propagating the full probability distribution. By propagating an ensemble of representative states, algorithms like the ensemble Kalman filter (EnKF) and the resampled particle filter (RPF) rely on the existing modeling infrastructure to approximate the distribution based on the evolution of this ensemble. This work presents an ensemble-based smoother that is applicable to the Monte Carlo filtering schemes like EnKF and RPF. At the minor cost of retrospectively updating a set of weights for ensemble members, this smoother has demonstrated superior capabilities in state tracking for two highly nonlinear problems: the double-well potential and trivariate Lorenz systems. The algorithm does not require retrospective adaptation of the ensemble members themselves, and it is thus suited to a streaming operational mode. The accuracy of the proposed backward-update scheme in estimating non-Gaussian distributions is evaluated by comparison to the more accurate estimates provided by a Markov chain Monte Carlo algorithm.

Monte Carlo↗
DOE OSTI2021

GPU-based Image Compression for Efficient Compositing in Distributed Rendering Applications

Visualizations of large-scale data sets are often created on graphics clusters that distribute the rendering task amongst many processes. When using real-time GPU-based graphics algorithms, the most time-consuming aspect of distributed rendering is typically the com-positing phase - combining all partial images from each rendering process into the final visualization. Compo siting requires image data to be copied off the GPU and sent over a network to other processes. While compression has been utilized in existing distributed rendering compositors to reduce the data being sent over the network, this compression tends to occur after the raw images are transferred from the GPU to main memory. In this paper, we present work that leverages OpenGL / CUDA interoperability to compress raw images on the GPU prior to transferring the data to main memory. This approach can significantly reduce the device-to-host data transfer time, thus enabling more efficient compositing of images generated by distributed rendering applications.

Lipinksi, Riley↗
NASA NTRS1999

TRMM Realtime Data Production, Transfer, and Future Plans

The Tropical Rainfall Measuring Mission, a joint US NASA and Japan NASDA mission, was launched on November 27, 1997 from Tanegashima Island, Japan on a NASDA provided H-II launch vehicle. The TRMM objectives are: to obtain and study multi-year science data sets of tropical and sub- tropical rainfall measurement; to understand how interactions between the sea, air, and land masses produce changes in global rainfall and climate; to help improve modeling of tropical rainfall processes; to test, evaluate, and improve the performance of satellite rainfall estimates measurements and techniques. The routine production and quick distribution of standard products provides an important underpinning to these objectives. The determination of standard TRMM algorithms and the requirements for routine production and distribution fall within the authority of the joint US-Japan Science Team. In April of 1998, the Joint TRMM Science team requested that TRMM data be made available in near real-time to approved international agencies and modelers. This request was an addition to the routine production of the standard TRMM data products. The science team requested that near-realtime products be as small as possible to facilitate their transfer via networks. Indeed, it was determined that only network transfer would be available. This presentation provides an overview of the type of products available from the realtime system and how the TRMM system was developed at the lowest cost in the shortest amount of time. It then describes the real-time data flow. The presentation also summarizes how the science quality of real-time data is maintained. It describes how interested groups can get access to this data and the importance of networks for the future of real-time data expansion. The presentation concludes real-time possibilities and improvements possible as part of the proposed Global Precipitation Mission. High speed network access availability is an important catalyst to real-time data flow during the proposed mission.

Stocker, Erich Franz↗
NASA NTRS1994

Rapid solution of large-scale systems of equations

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Storaasli, Olaf O.↗
NASA NTRS2017

NASA Computational Case Study: Spectral Energy Distribution Fitting

The need for faster, more efficient algorithms is an important aspect of scientific computing. Generally, scientists are only exposed to computational issues that arise in their field. Thus, collaboration between a numerical analyst and a scientist is becoming necessary for scientific computing. The purpose of this case study is to expose computer scientists to processes that an astronomer would use to obtain useful results from raw data. For example, astronomers are interested in determining the properties of galaxies and measuring changes in those properties as a function of time throughout cosmic history. To do so, they use certain models that are designed and refined over time via observations at different wavelengths of the light spectrum. The process of matching these models with observed data from studying celestial bodies is referred to as Spectral Energy Distribution (SED) fitting. In this case study, we learn how to perform the SED fit. This process requires knowledge of both the astronomical and computational issues involved when fitting flux, the total energy from a source as seen from Earth, to a set of physical templates. Once a fit is complete, one can classify the source and estimate a number of physical parameters. The goal is to demonstrate how the computer science skill set can be used in the scientific community and to possibly improve one or more of the computational aspects of this problem. The following provides some background on the astronomy issues, including information on the spectral energy distribution and related physical parameters, and the computational issues, including the fitting procedure..

modeling↗
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 OSTI2020

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Distributed Coordination of Demand-side Flexible Resources in Microgrid with All-Time Feasibility

The prevalence of distributed renewable generators motivates microgrid operators to exploit demand-side flexible resources (DFRs). Due to their dispersed nature, distributed DFR coordination has been a vibrant research area, while there are several issues awaiting to be addressed. On one hand, DFR power is internally coupled through power flow, while DFR usually cannot access grid information. On the other hand, in time-restricted scenarios, solution feasibility cannot be guaranteed by conventional dual-based algorithms. To fill these gaps, we propose a distributed DFR coordination framework with all-time feasibility. The proposed framework accounts for the distinct access of microgrid entities to grid information. A distributed and all-time feasible algorithm is proposed for optimal DFR coordination, which allows DFRs to make local decisions without violating constraints throughout iterations. The effectiveness of the proposed algorithm is demonstrated through case studies. The impact of peer-to-peer communication links on algorithm convergence is also investigated, which emphasizes the balance between communication investment and algorithm performance.

Li, Hongyi [Iowa State Univ., Ames, IA (United Sta↗
NASA NTRS1974

Cluster analysis based on dimensional information with applications to feature selection and classification

A new clustering algorithm is presented that is based on dimensional information. The algorithm includes an inherent feature selection criterion, which is discussed. Further, a heuristic method for choosing the proper number of intervals for a frequency distribution histogram, a feature necessary for the algorithm, is presented. The algorithm, although usable as a stand-alone clustering technique, is then utilized as a global approximator. Local clustering techniques and configuration of a global-local scheme are discussed, and finally the complete global-local and feature selector configuration is shown in application to a real-time adaptive classification scheme for the analysis of remote sensed multispectral scanner data.

Eigen, D. J.↗
NASA NTRS1993

A formally verified algorithm for interactive consistency under a hybrid fault model

Consistent distribution of single-source data to replicated computing channels is a fundamental problem in fault-tolerant system design. The 'Oral Messages' (OM) algorithm solves this problem of Interactive Consistency (Byzantine Agreement) assuming that all faults are worst-cass. Thambidurai and Park introduced a 'hybrid' fault model that distinguished three fault modes: asymmetric (Byzantine), symmetric, and benign; they also exhibited, along with an informal 'proof of correctness', a modified version of OM. Unfortunately, their algorithm is flawed. The discipline of mechanically checked formal verification eventually enabled us to develop a correct algorithm for Interactive Consistency under the hybrid fault model. This algorithm withstands $a$ asymmetric, $s$ symmetric, and $b$ benign faults simultaneously, using $m+1$ rounds, provided $n is greater than 2a + 2s + b + m$, and $m\geg a$. We present this algorithm, discuss its subtle points, and describe its formal specification and verification in PVS. We argue that formal verification systems such as PVS are now sufficiently effective that their application to fault-tolerance algorithms should be considered routine.

Lincoln, Patrick↗
DOE OSTI2023

Distributed Energy Management for Networked Microgrids with Hardware-in-the-Loop Validation

For the cooperative operation of networked microgrids, a distributed energy management considering network operational objectives and constraints is proposed in this work. Considering various ownership and privacy requirements of microgrids, utility directly interfaced distributed energy resources (DERs) and demand response, a distributed optimization is proposed for obtaining optimal network operational objectives with constraints satisfied through iteratively updated price signals. The alternating direction method of multipliers (ADMM) algorithm is utilized to solve the formulated distributed optimization. The proposed distributed energy management provides microgrids, utility-directly interfaced DERs and responsive demands the opportunity of contributing to better network operational objectives while preserving their privacy and autonomy. Results of numerical simulation using a networked microgrids system consisting of several microgrids, utility directly interfaced DERs and responsive demands validate the soundness and accuracy of the proposed distributed energy management. The proposed method is further tested on a practical two-microgrid system located in Adjuntas, Puerto Rico, and the applicability of the proposed strategy is validated through hardware-in-the-loop (HIL) testing.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2003

Production, Outflow Velocity, and Radial Distribution of H2O and OH in the Coma of Comet C/1995 O1 [Hale-Bopp] from Wide Field Imaging of OH

Observations of OH are a useful proxy of the water production rate (Q(sub H2O)) and outflow velocity (V(sub out)) in comets. From wide field images taken on 03/28/1997 and 04/08/1997 that capture the entire scale length of the OH coma of comet C/1995 O1 (Hale-Bopp), we obtain Q(sub H2O) from the model-independent method of aperture summation. With an adaptive ring summation algorithm, we extract the radial brightness distribution of OH 0-0 band emission out to cometocentric distances of up to 10(exp 6) km, both as azimuthal averages and in quadrants covering different position angles relative to the comet-Sun line. These profiles are fit using both fixed and variable velocity 2-component spherical expansion models to estimate V(sub OH) with increasing distance from the nucleus. The OH coma of Hale-Bopp was more spatially extended than previous comets, and this extension is best matched by a variable acceleration of H2O and OH that acted across the entire coma, but was strongest within 1-2 x 10(exp 4) km from the nucleus. Our models indicate that V(sub OH) at the edge of our detectable field of view (10(exp 6) km) was approx. 2-3 times greater in Hale-Bopp than for a 1P/Halley-class comet at 1 AU, which is consistent with the results of more sophisticated gas-kinetic models, extrapolation from previous observations of OH in comets with Q(sub H2O) greater than 10(exp 29)/s , and direct radio measurements of the outer coma Hale-Bopp OH velocity. The most probable source of this acceleration is thermalization of the excess energy of dissociation of H2O and OH over an extended collisional coma. When the coma is broken down by quadrants in position angle, we find an azimuthal asymmetry in the radial distribution that is characterized by an increase in the spatial extent of OH in the region between the orbit-trailing and anti-sunward directions. Model fits specific to this area and comparison with radio OH measurements suggest greater acceleration here, with V(sub OH) approx. 1.5 times greater at a 10(exp 6) km cometocentric distance than elsewhere in the coma. We discuss several mechanisms that may have acted within the coma to produce the observed effect.

Harris, Walter M.↗
DOE OSTI2021

Scalable FBP decomposition for cone-beam CT reconstruction

Filtered Back-Projection (FBP) is a fundamental compute intense algorithm used in tomographic image reconstruction. Cone-Beam Computed Tomography (CBCT) devices use a cone-shaped X-ray beam, in comparison to the parallel beam used in older CT generations. Distributed image reconstruction of cone-beam datasets typically relies on dividing batches of images into different nodes. This simple input decomposition, however, introduces limits on input/output sizes and scalability.We propose a novel decomposition scheme and reconstruction algorithm for distributed FPB. This scheme enables arbitrarily large input/output sizes, eliminates the redundancy arising in the end-to-end pipeline and improves the scalability by replacing two communication collectives with only one segmented reduction. Finally, we implement the proposed decomposition scheme in a framework that is useful for all current-generation CT devices (7th gen). In our experiments using up to 1024 GPUs, our framework can construct 40963 volumes, for real-world datasets, in under 16 seconds (including I/O).

Chen, Peng↗
DOE OSTI2021

Identifying and tracking bubbles and drops in simulations: A toolbox for obtaining sizes, lineages, and breakup and coalescence statistics

Knowledge of bubble and drop size distributions in two-phase flows is important for characterizing a wide range of phenomena, including combustor ignition, sonar communication, and cloud formation. The physical mechanisms driving the background flow also drive the time evolution of these distributions. Accurate and robust identification and tracking algorithms for the dispersed phase are necessary to reliably measure this evolution and thereby quantify the underlying mechanisms in interface-resolving flow simulations. The identification of individual bubbles and drops traditionally relies on an algorithm used to identify connected regions. This traditional algorithm can be sensitive to the presence of spurious structures. A cost-effective refinement is proposed to maximize volume accuracy while minimizing the identification of spurious bubbles and drops. An accurate identification scheme is crucial for distinguishing bubble and drop pairs with large size ratios. The identified bubbles and drops need to be tracked in time to obtain breakup and coalescence statistics that characterize the evolution of the size distribution, including breakup and coalescence frequencies, and the probability distributions of parent and child bubble and drop sizes. An algorithm based on mass conservation is proposed to construct bubble and drop lineages using simulation snapshots that are not necessarily from consecutive time steps. These lineages are then used to detect breakup and coalescence events, and obtain the desired statistics. Accurate identification of large-size-ratio bubble and drop pairs enables accurate detection of breakup and coalescence events over a large size range. Accurate detection of successive breakup and coalescence events requires that the snapshot interval be an order of magnitude smaller than the characteristic breakup and coalescence times to capture these successive events while minimizing the identification of repeated confounding events. Together, these algorithms serve as a toolbox for detailed analysis of two-phase simulations, and enable insights into the mechanisms behind bubble and drop formation and evolution in flows of practical importance.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Differentially Private K -Means Clustering Applied to Meter Data Analysis and Synthesis

The proliferation of smart meters has resulted in a large amount of data being generated. It is increasingly apparent that methods are required for allowing a variety of stakeholders to leverage the data in a manner that preserves the privacy of the consumers. The sector is scrambling to define policies, such as the so called ‘15/15 rule’, to respond to the need. However, the current policies fail to adequately guarantee privacy. Here, in this paper, we address the problem of allowing third parties to apply K-means clustering, obtaining customer labels and centroids for a set of load time series by applying the framework of differential privacy. We leverage the method to design an algorithm that generates differentially private synthetic load data consistent with the labeled data. We test our algorithm’s utility by answering summary statistics such as average daily load profiles for a 2-dimensional synthetic dataset and a real-world power load dataset.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1991

Efficient computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network

Aeroelastic analysis is multi-disciplinary and computationally expensive. Hence, it can greatly benefit from parallel processing. As part of an effort to develop an aeroelastic capability on a distributed memory transputer network, a parallel algorithm for the computation of aerodynamic influence coefficients is implemented on a network of 32 transputers. The aerodynamic influence coefficients are calculated using a 3-D unsteady aerodynamic model and a parallel discretization. Efficiencies up to 85 percent were demonstrated using 32 processors. The effect of subtask ordering, problem size, and network topology are presented. A comparison to results on a shared memory computer indicates that higher speedup is achieved on the distributed memory system.

Janetzke, David C.↗
NASA NTRS1991

Parallel computation of aerodynamic influence coefficients for aeroelastic analysis on a transputer network

Aeroelastic analysis is mult-disciplinary and computationally expensive. Hence, it can greatly benefit from parallel processing. As part of an effort to develop an aeroelastic analysis capability on a distributed-memory transputer network, a parallel algorithm for the computation of aerodynamic influence coefficients is implemented on a network of 32 transputers. The aerodynamic influence coefficients are calculated using a three-dimensional unsteady aerodynamic model and a panel discretization. Efficiencies up to 85 percent are demonstrated using 32 processors. The effects of subtask ordering, problem size and network topology are presented. A comparison to results on a shared-memory computer indicates that higher speedup is achieved on the distributed-memory system.

Janetzke, D. C.↗