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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS1981

The feasibility of using time-dependent photochemical calculations to infer radical species concentrations from solar occultation absorption measurements

In connection with fast chemical reactions, short-lived stratospheric species experience rapid concentration variations at sunset and sunrise. For solar occultation absorption measurements, these rapid concentration variations may introduce significant errors with respect to the inference of atmospheric abundances for some species due to asymmetrical concentration distributions. Most retrieval algorithms assume that concentration distributions are spherically symmetric. The effect of this assumption on the accuracy of inferred concentrations has been studied by Kerr et al. (1977). The present investigation considers the feasibility of using a time-dependent one-dimensional photochemical model to provide detailed information about the asymmetrical distribution for use in the retrieval procedure. As shown by Boughner et al. (1980), diurnal effects can be represented by an inhomogeneity factor. It is found that the NO retrieval improves considerably with the inclusion of a correction factor containing the asymmetrical variations.

Larsen, J. C.↗

NASA NTRS2018

Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services

This paper presents the development of ICAROUS-2 (Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services), the second generation of a software architecture that integrates several algorithms as distributed onboard services to enable robust autonomous UAS applications. In particular, the ICAROUS architecture defines a framework to perform detect and avoid, geofencing, path monitoring, path planning, and autonomous decision making to ensure safety and mission progress. Most of the core algorithms implemented in ICAROUS are formally verified using an interactive theorem prover. These algorithms are composed together using a plan execution engine, whose operational semantics is formally specified. A description of the integrated architecture, services currently available, and flight test results highlighting the capability of ICAROUS are presented.

Balachandran, Swee↗

NASA NTRS2018

Independent Configurable Architecture for Reliable Operation of Unmanned Systems with Distributed Onboard Services

Balachandran, Swee↗

DOE OSTI2023

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation

Here we propose a decomposition algorithm for multistage stochastic programming that resembles the progressive hedging method of Rockafellar and Wets but is provably capable of several forms of asynchronous operation. We derive the method from a class of projective operator splitting methods fairly recently proposed by Combettes and Eckstein, significantly expanding the known applications of those methods. Our derivation assures convergence for convex problems whose feasible set is compact, subject to some standard regularity conditions and a mild “fairness” condition on subproblem selection. The method’s convergence guarantees are deterministic and do not require randomization, in contrast to other proposed asynchronous variations of progressive hedging. Computational experiments described in an online appendix show the method to outperform progressive hedging on large-scale problems in a highly parallel computing environment.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Real-Time Optimization and Control of Next-Generation Distribution Infrastructure

This presentation highlights the key developments of the ARAP-e NODES project, including the innovative real-time optimal power flow (RT-OPF) algorithm for distributed energy resource (DER) management, trip planning for T+D coordination, and extensive validation of the RT-OPF algorithm in NREL ESIF laboratory with 100+ physical hardware devices, controller-hardware-in-the-loop test at Southern California Edison (SCE), and two field demonstrations.

hardware-in-the-loop↗

DOE OSTI2020

Real-Time Distributed Control of Smart Inverters for Network-level Optimization

The limitations of centralized optimization methods in managing electric power distribution systems operations have led to the distributed paradigm of computing and decision-making. Unfortunately, the existing distributed optimization algorithms are limited in their applicability to managing fast varying phenomena such as those resulting from highly variable Distributed Energy Resource (DER) generation patterns. They require a large number of communication rounds (in the order of 10 2 to 10 3 ) among the computing agents to solve one instance of the optimization problem. Related real-time distributed control methods are equally limited in their applications to power distribution systems with fast-changing DER generation; they require hundreds of rounds of communication and thus are slow in tracking the network-level optimal solutions. In this paper, we propose a novel distributed voltage controller that provides a fast-tracking of rapidly varying DER generation profiles while simultaneously converging to network-level optimal solutions within a few communication rounds. The proposed control algorithm leverages the radial topology of the system, which reduces the required communication rounds to reach the network-level optimum solution by order of magnitude. The novelty lies in carefully reducing the electrical network model from the perspective of each distributed controller and enabling appropriate data sharing among upstream and downstream nodes to achieve fast convergence. The simulation results demonstrate the effectiveness of the proposed approach in minimizing the feeder losses while maintaining the node voltage within the pre-specified limits.

voltage control, optimization, reactive power, inv↗

DOE OSTI2021

Review of Power System Support Functions for Inverter-Based Distributed Energy Resources - Standards, Control Algorithms, and Trends

Penetration of renewable energy in power systems has been increasing in the past decades in response to increased global electricity demand and concerns for the environment. Distributed energy resources (DERs) based on renewables have experienced rapid growth thanks to the incentive programs and broad-based participation. With the growing prevalence of DERs, the risk of grid instability and vulnerability increases due to the intermittent nature of renewable energy. At the same time, the voltage and frequency deviation problems emerge more often when the reverse power flow occurs under supply-demand imbalance in distributed power systems. Standards and grid codes have been issued for DER inverters to interconnect with the distribution grid. The updated standard and grid codes expect DERs to provide a variety of power system support functions in order to incorporate higher DER penetration and to maximize DER value to the grid. This paper provides an overview of the power system support functions from renewable DER inverters, which are categorized as: voltage regulation by active/reactive power control, frequency regulation by active power control, voltage ride-through, and frequency ride-through. The benefits and drawbacks of each algorithm are presented and compared with its predecessor, manifesting the logic in the evolution of the algorithms.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1992

Survivable algorithms and redundancy management in NASA's distributed computing systems

The design of survivable algorithms requires a solid foundation for executing them. While hardware techniques for fault-tolerant computing are relatively well understood, fault-tolerant operating systems, as well as fault-tolerant applications (survivable algorithms), are, by contrast, little understood, and much more work in this field is required. We outline some of our work that contributes to the foundation of ultrareliable operating systems and fault-tolerant algorithm design. We introduce our consensus-based framework for fault-tolerant system design. This is followed by a description of a hierarchical partitioning method for efficient consensus. A scheduler for redundancy management is introduced, and application-specific fault tolerance is described. We give an overview of our hybrid algorithm technique, which is an alternative to the formal approach given.

Malek, Miroslaw↗

NASA NTRS2007

Integrated Hardware and Software for No-Loss Computing

When an algorithm is distributed across multiple threads executing on many distinct processors, a loss of one of those threads or processors can potentially result in the total loss of all the incremental results up to that point. When implementation is massively hardware distributed, then the probability of a hardware failure during the course of a long execution is potentially high. Traditionally, this problem has been addressed by establishing checkpoints where the current state of some or part of the execution is saved. Then in the event of a failure, this state information can be used to recompute that point in the execution and resume the computation from that point. A serious problem arises when one distributes a problem across multiple threads and physical processors is that one increases the likelihood of the algorithm failing due to no fault of the scientist but as a result of hardware faults coupled with operating system problems. With good reason, scientists expect their computing tools to serve them and not the other way around. What is novel here is a unique combination of hardware and software that reformulates an application into monolithic structure that can be monitored in real-time and dynamically reconfigured in the event of a failure. This unique reformulation of hardware and software will provide advanced aeronautical technologies to meet the challenges of next-generation systems in aviation, for civilian and scientific purposes, in our atmosphere and in atmospheres of other worlds. In particular, with respect to NASA s manned flight to Mars, this technology addresses the critical requirements for improving safety and increasing reliability of manned spacecraft.

James, Mark↗

DOE OSTI2022

Pele: An Exascale-Ready Suite of Combustion Codes

High fidelity simulations of realistic combustion devices are extremely demanding computationally because of the requirements to capture complex fuel chemical decomposition, its intricate interactions with turbulent, often multiphase, flows, and the wide separation of space and time scales between the thin flame and the device boundaries. Software required to carry out such computations tends to be extremely complex, particularly when designed to exploit hardware accelerators, and can be difficult to port and maintain. We present Pele, a performance portable suite of tools for the simulation of combustion systems, including codes to evolve reactive multiphase configurations in the low Mach number and compressible flow regimes, along with a set of inter-compatible post processing and in situ analysis tools. The Pele suite of tools is built on top of the AMReX framework for block-structured adaptive mesh refinement, which provides efficient data structures and algorithms that enable the development of a wide variety of efficient mesh and particle based PDE integration schemes. A hierarchical MPI+X parallelism scheme supports CPU-only and accelerated architectures, where X can be OpenMP, CUDA, and HIP based approaches for intra-node computational work distribution. The algorithms and data structures underlying the Pele simulation and analysis tools are highly scalable and performant across a wide variety of high-performance computing platforms, including DOEs newest exascale-class machines, Frontier and Aurora. The simulation and analysis tools are fully documented and freely distributed as open source via GitHub. We present key algorithmic and software challenges, solution strategies, performance and resulting set of capabilities.

AMReX↗

DOE OSTI2021

Peer-to-Peer Energy Management System for Distributed Microgrid Coordination [SWR-21-92]

Resiliency is one of the key challenges in today's power system. Natural disasters and cyber-attacks both can limit communications between microgrids and the central management system. Thus, having a Distributed Microgrid Coordination (DMC) algorithm can improve the system resiliency, which enables the microgrids to operate without communication with the central management system. Peer-to-Peer Energy Management System for Distributed Microgrid Coordination adopts a primal-dual approach, where each microgrid controller keeps a local estimate of the dual variables. The estimate is updated with local measurements and peer-to-peer communication, leading to a fully distributed algorithm. While the DMC is developed for microgrid coordination, it can be used for general distributed control purpose.

Li, Yashen↗

NASA NTRS1984

Numerical algorithm conjugating steady and transient, separated, compressible flow and a solid body having arbitrarily distributed heat sources

A numerical algorithm that is second-order accurate in time has been developed for the conjugated problem of a separated, compressible flow field and a conductive solid body. The full two-dimensional time-dependent Navier-Stokes equations are coupled with the time-dependent energy equation for the solid body and are solved simultaneously. using implicit algorithms. The energy equation for the solid body may include arbitrarily distributed heat sources. The algorithm has been exmined for the case of two-dimensional supersonic compression-corner interaction, with a heat source embedded in the wall in the vicinity of the separation bubble and the attached boundary layer. The effect of the heat source on the flow field is studied for steady and transient cases.

Degani, D.↗

DOE OSTI2024

Validation of the Scientific Program for the Dark Energy Spectroscopic Instrument

The Dark Energy Spectroscopic Instrument (DESI) was designed to conduct a survey covering 14,000 deg$^{2}$ over 5 yr to constrain the cosmic expansion history through precise measurements of baryon acoustic oscillations (BAO). The scientific program for DESI was evaluated during a 5 month survey validation (SV) campaign before beginning full operations. This program produced deep spectra of tens of thousands of objects from each of the stellar Milky Way Survey (MWS), Bright Galaxy Survey (BGS), luminous red galaxy (LRG), emission line galaxy (ELG), and quasar target classes. These SV spectra were used to optimize redshift distributions, characterize exposure times, determine calibration procedures, and assess observational overheads for the 5 yr program. In this paper, we present the final target selection algorithms, redshift distributions, and projected cosmology constraints resulting from those studies. We also present a One-Percent Survey conducted at the conclusion of SV covering 140 deg$^{2}$ using the final target selection algorithms with exposures of a depth typical of the main survey. The SV indicates that DESI will be able to complete the full 14,000 deg$^{2}$ program with spectroscopically confirmed targets from the MWS, BGS, LRG, ELG, and quasar programs with total sample sizes of 7.2, 13.8, 7.46, 15.7, and 2.87 million, respectively. These samples will allow exploration of the Milky Way halo, clustering on all scales, and BAO measurements with a statistical precision of 0.28% over the redshift interval z < 1.1, 0.39% over the redshift interval 1.1 < z < 1.9, and 0.46% over the redshift interval 1.9 < z < 3.5.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Fault-Tolerant Decentralized Control for Large-Scale Inverter-Based Resources for Active Power Tracking

Integration of inverter-based resources (IBRs) which lack the intrinsic characteristics such as the inertial response of the traditional synchronous-generator (SG)-based sources presents a new challenge in the form of analyzing the grid stability under their presence. While the dynamic composition of IBRs differs from that of the SGs, the control objective remains similar in terms of tracking the desired active power. This letter presents a decentralized primal-dual-based fault-tolerant control framework for the power allocation in IBRs. Overall, a hierarchical control algorithm is developed with a lower level addressing the current control and the parameter estimation for the IBRs and the higher level acting as the reference power generator to the low level based on the desired active power profile. The decentralized network-based algorithm adaptively splits the desired power between the IBRs taking into consideration the health of the IBRs transmission lines. The proposed framework is tested through a simulation on the network of IBRs and the high-level controller performance is compared against the existing framework in the literature. The proposed algorithm shows significant performance improvement in the magnitude of power deviation and settling time to the nominal value under faulty conditions as compared to the algorithm in the literature.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS2003

An Agent Inspired Reconfigurable Computing Implementation of a Genetic Algorithm

Many software systems have been successfully implemented using an agent paradigm which employs a number of independent entities that communicate with one another to achieve a common goal. The distributed nature of such a paradigm makes it an excellent candidate for use in high speed reconfigurable computing hardware environments such as those present in modem FPGA's. In this paper, a distributed genetic algorithm that can be applied to the agent based reconfigurable hardware model is introduced. The effectiveness of this new algorithm is evaluated by comparing the quality of the solutions found by the new algorithm with those found by traditional genetic algorithms. The performance of a reconfigurable hardware implementation of the new algorithm on an FPGA is compared to traditional single processor implementations.

Weir, John M.↗

NASA NTRS1993

Mapping robust parallel multigrid algorithms to scalable memory architectures

The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. In this paper, we look at the parallel implementation of a V-cycle multiple semicoarsened grid (MSG) algorithm on distributed-memory architectures such as the Intel iPSC/860 and Paragon computers. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. This paper describes a mapping of an MSG algorithm to distributed-memory architectures that demonstrates how both levels of parallelism can be exploited. The result is a robust and effective multigrid algorithm for distributed-memory machines.

Overman, Andrea↗

NASA NTRS1992

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗

DOE OSTI2022

Genetic-algorithm retrieval of the molecular alignment distribution with high-order harmonics generated from transiently aligned CO 2 molecules

Using genetic algorithm, we propose a method to retrieve the alignment distribution of transiently aligned CO 2 molecules from the high-order harmonic generation (HHG) spectra. The retrieval method is based on the quantitative rescattering (QRS) model where averaged photorecombination transition dipole can be factored out from the parallel (or perpendicular) harmonic spectra after the propagation of the harmonic fields in the gas medium. We examine how the retrieved alignment distributions are affected by uncertainty in alignment dependent ionization probability and on multiple orbital contribution to the HHG. We further confirm that alignment distribution is more accurately retrieved by using the minima in the HHG spectra driven by a long-wavelength laser. In addition, we show that earlier experimental data on the ratios between the perpendicular and the parallel HHG components of aligned CO 2 molecules are in better agreement with the QRS model if the macroscopic propagation and multiple orbital interference are included in the theoretical calculation.

74 ATOMIC AND MOLECULAR PHYSICS↗