Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithms”

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 397 records · Page 22

A moment-convergence method for stochastic analysis of biochemical reaction networks

Traditional moment-closure methods need to assume that high-order cumulants of a probability distribution approximate to zero. However, this strong assumption is not satisfied for many biochemical reaction networks. Here, we introduce convergent moments (defined in mathematics as the coefficients in the Taylor expansion of the probability-generating function at some point) to overcome this drawback of the moment-closure methods. As such, we develop a new analysis method for stochastic chemical kinetics. This method provides an accurate approximation for the master probability equation (MPE). In particular, the connection between low-order convergent moments and rate constants can be more easily derived in terms of explicit and analytical forms, allowing insights that would be difficult to obtain through direct simulation or manipulation of the MPE. In addition, it provides an accurate and efficient way to compute steady-state or transient probability distribution, avoiding the algorithmic difficulty associated with stiffness of the MPE due to large differences in sizes of rate constants. Applications of the method to several systems reveal nontrivial stochastic mechanisms of gene expression dynamics, e.g., intrinsic fluctuations can induce transient bimodality and amplify transient signals, and slow switching between promoter states can increase fluctuations in spatially heterogeneous signals. The overall approach has broad applications in modeling, analysis, and computation of complex biochemical networks with intrinsic noise.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A METHOD TO SEARCH FOR CORRELATIONS OF ULTRA-HIGH ENERGY COSMIC-RAY MASSES WITH THE LARGE-SCALE STRUCTURES IN THE LOCAL GALAXY DENSITY FIELD

One of the main goals of investigations using present and future giant extensive air shower (EAS) arrays is the mass composition of ultra-high energy cosmic rays (UHECRs). A new approach to the problem is presented, combining the analysis of arrival directions with the statistical test of the paired EAS samples. One of the ideas of the method is to search for possible correlations between UHECR masses and their separate sources; for instance, if there are two sources in different areas of the celestial sphere injecting different nuclei, but the fluxes are comparable so that arrival directions are isotropic, then the aim is to reveal a difference in the mass composition of cosmic-ray fluxes. The method is based on a non-parametric statistical test-the Wilcoxon signed-rank routine-which does not depend on the populations fitting any parameterized distributions. Two particular algorithms are proposed: first, using measurements of the depth of the EAS maximum position in the atmosphere; and second, relying on the age variance of air showers initiated by different primary particles. The formulated method is applied to the Yakutsk array data, in order to demonstrate the possibility of searching for a difference in average mass composition between the two UHECR sets, arriving particularly from the supergalactic plane and a complementary region.

79 ASTRONOMY AND ASTROPHYSICS↗

A Comprehensive Strategy for Grid Forming Control in DC Coupled Photovoltaic and Battery Energy Storage Inverters

This paper presents an integrated DC-DC and DCAC grid-forming control strategy for DC-coupled photovoltaic (PV) plus battery energy storage systems, considering the effect of DC link voltage variations caused by direct PV connections. A power reference algorithm determines power distribution between the PV and battery to the grid while observing device power ratings to prevent the over-rating of components and keep the battery's state of charge within an acceptable range. The simulated utility-scale model in MATLAB/Simulink illustrates its ability against extreme phase angle variation contingencies in the grid while controlled through grid-forming control with a fast dynamic on DC link voltage. The simulation results confirm the effectiveness of the proposed control in integrating PV plus battery configurations with grid forming control and maintaining reliable grid operation under severe grid disturbances.

battery, boost, control, energy storage, grid form↗

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗

ECP-ExaGraph/Submodular-b-matching

A b-MATCHING is a subset of edges M such that at most b(v) edges in M are incident on each vertex v, where b(v) is specified. We present a distributed-memory parallel algorithm, b-SUITOR, that computes a b-MATCHING with more than half the maximum weight in a graph with weights on the edges

Ferdous, S M↗

Applying Graph Partitioning Methods in Measurement-Based Dynamic Load Balancing

Load imbalance can lead to wasted CPU hours especially when running on a large number of processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing frame work. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, for measurement based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called Scotch that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using a micro-benchmark and the NAS BT multi-zone bench mark. New algorithms developed in Scotch lead to better performance compared to other existing partitioners, both in terms of the application execution time and fewer number of objects migrated.

97 MATHEMATICS AND COMPUTING↗

Citadels Final Report (GMLC 2.2.1: Citadels)

This is the final project report for the Grid Modernization Laboratory Consortium (GMLC) Resilient Distribution System (RDS) Citadels project. The primary goal of this GMLC project was to increase the operational flexibly of power systems by engaging microgrids distributedly, coordinated using consensus algorithms. The primary goal was successfully achieved. The primary goal was divided into three areas: Implement peer-to-peer control between microgrid controllers using the Open Field Message Bus (OpenFMB) approach; Develop and implement consensus algorithms on commercially available hardware that allows a group of microgrids to distributedly implement operational controls; Develop the architectures and controls to enable groups of microgrids to coordinate their operations to support the bulk power system during abnormal events, and end-use loads in the event the bulk power systems fail.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Transient Safety Verification via Robust Control Invariant Sets: A Microgrid Application

Modern safety-critical energy infrastructures are increasingly operated in a hierarchical and modular control framework which allows for limited data exchange between the modules. In this context, it is important for each module to synthesize and communicate constraints on the values of exchanged information in order to assure system-wide safety. To ensure transient safety in inverter-based microgrids, we develop a set invariance-based distributed safety verification algorithm for each inverter module. Applying Nagumo's invariance condition, we construct a robust polynomial optimization problem to jointly search for safety-admissible set of control set-points and design parameters, under allowable disturbances from neighbors. We use sum-of-squares (SOS) programming to solve the verification problem and we perform numerical simulations using grid-forming inverters to illustrate the algorithm.

Bouvier, Jean-Baptiste H.↗

Challenging a Global Land Surface Model in a Local Socio-Environmental System

Land surface models (LSMs) predict how terrestrial fluxes of carbon, water, and energy change with abiotic drivers to inform the other components of Earth system models. Here, we focus on a single human-dominated watershed in southwestern Michigan, USA. We compare multiple processes in a commonly used LSM, the Community Land Model (CLM), to observational data at the single grid cell scale. For model inputs, we show correlations (Pearson’s R) ranging from 0.46 to 0.81 for annual temperature and precipitation, but a substantial mismatch between land cover distributions and their changes over time, with CLM correctly representing total agricultural area, but assuming large areas of natural grasslands where forests grow in reality. For CLM processes (outputs), seasonal changes in leaf area index (LAI; phenology) do not track satellite estimates well, and peak LAI in CLM is nearly double the satellite record (5.1 versus 2.8). Estimates of greenness and productivity, however, are more similar between CLM and observations. Summer soil moisture tracks in timing but not magnitude. Land surface reflectance (albedo) shows significant positive correlations in the winter, but not in the summer. Looking forward, key areas for model improvement include land cover distribution estimates, phenology algorithms, summertime radiative transfer modelling, and plant stress responses.

54 ENVIRONMENTAL SCIENCES↗

Distribution System Voltage Regulation by Distributed Energy Resources

This paper proposes a control method to regulate voltages in 3 phase unbalanced electrical distribution systems. A constrained optimization problem to minimize voltage deviations and maximize distributed energy resource (DER) active power output is solved by harmony search algorithm. IEEE 13 Bus Distribution Test System was modified to test three different cases: a) only voltage regulator controlled system b) only DER controlled system and c) both voltage regulator and DER controlled system. The simulation results show that systems with both voltage regulators and DER control provide better voltage profile.

Distributed energy resources↗

Scalable Approaches to Selecting Key Entities in Large Networked Infrastructure Systems

This work aims at bringing advances in discrete optimization algorithms to solving practical engineering problems at scale. Often times, in many engineering design problems, there is a need to select a small set of influential or representative elements from a large ground set of entities in an optimal fashion. Submodular optimization provides for a formal way to solve such problems. Common examples with infrastructure systems involve sensor placement and identification of key entities with certain objectives. However, scaling these approaches to large infrastructure systems can be challenging because of the high computational complexity of the overall framework that include the optimization algorithms as well as high-complexity compute-oracles that provide the necessary objective function values. In this work, we explore a well-studied and widely-applicable paradigm, namely leader-selection in a multi-agent networked setting in the context of scalable methodologies. We demonstrate novel frameworks that utilize variations of accelerated submodular optimization algorithms along with linear-algebraic methods that can help accelerate the oracle computations. We further explore this combination in conjunction with graph partitioning paradigms to take advantage of the accelerated algorithms in a distributed setting. Finally we demonstrate the key findings on a practical problem in an operational setting. For this, we leverage an example road network with approximately 18k nodes and 27k edges in a traffic control application, where we seek a limited number of k=200 key intersections. This problem can be solved in a serial setting in just under 5 hours providing more than 2 orders of magnitude speed-up over methods that do not consider acceleration techniques.

Visweswara Sathanur, Arun↗

Systems and methods for quality of service (QoS) based management of bottlenecks and flows in networks

Techniques based on the Theory of Bottleneck Ordering can reveal the bottleneck structure of a network, and the Theory of Flow ordering can take advantage of the revealed bottleneck structure to manage and configure network flows so as to improve the overall network performance. These two techniques provide insights into the inherent topological properties of a network at least in three areas: (1) identification of the regions of influence of each bottleneck; (2) the order in which bottlenecks (and flows traversing them) may converge to their steady state transmission rates in distributed congestion control algorithms; and (3) the design of optimized traffic engineering policies.

97 MATHEMATICS AND COMPUTING↗

Application of the GBFP Method to Electron Partial-Wave Expansion Elastic Scattering Differential Cross Sections Within the Geant4 Toolkit - Paper 69

Analog Monte Carlo simulation of electrons in complex material geometries is generally impractical because the long range Coulomb interactions result in highly peaked differential cross sections (DCS) for scattering and energy-loss and extremely small collision mean free paths (mfp). The condensed history (CH) Monte Carlo method attempts to alleviate this limitation by advancing electrons in fixed steps and sampling angular deflections and energy losses from precomputed distributions obtained from approximate solutions to the underlying transport equation that are valid only for thin layers. Though CH is efficient and is widely employed in production codes (ITS, MCNP, EGS, Geant), step size restrictions and inconsistent handling of material and free surface boundaries limit the ultimate accuracy possible with this approach, especially in applications to highly heterogeneous media. Recently proposed alternatives to the CH method, such as the Generalized Boltzmann Fokker-Planck (GBFP) method, restore the correct transport mechanics by simulating single events based on a Boltzmann transport equation but with efficiency and accuracy achieved through the use of reduced-physics interaction models. Motivated by Lewis theory, various moment-preserving strategies are employed in the GBFP approach to construct DCSs that are less singular, and with mfps shorter than analog. Specifically, the approximate cross sections are constructed to rigorously preserve a finite number of angular and energy-loss moments of the analog DCSs while all higher moments are approximated in terms of the exact lower moments. By systematically increasing the number of moments retained, any desired accuracy can be obtained for integrated quantities, such as dose, reflection and transmission yields, as well as distributed quantities such as energy and angular distributions. For relativistic Rutherford cross section models, the GBFP method has been demonstrated in Monte Carlo simulation to yield accuracy comparable to analog but at a fraction of the cost. One advantage of the GBFP approach is that angular deflection and energy-loss interactions depend only on Legendre moments and energy-loss moments and not the detailed form of the analog DCSs. This feature allows moment-preservation to be enforced through DCSs expressed as a superposition of discrete (i.e., using delta-functions) angular deflections and discrete energy losses. This promotes extremely efficient computation when compared to analog and completely continuous or hybrid discrete-continuous moment-based DCS reconstructions, while yielding highly accurate results for integrated and distributed quantities. In this paper, we demonstrate that the moment-preserving algorithms central to our fully discrete GBFP method can be readily extended to apply to tabulated DCS data, specifically to the partial-wave expansion (PWE) elastic scattering DCSs. Since data libraries for the PWE DCSs for energy and material combinations of interest can be prohibitively large, the GBFP method provides a means to reduce data storage requirements. We implemented our algorithm in the Geant4 Monte Carlo code and all numerical results are obtained using this implementation. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

GOING THE DISTANCE: MAPPING HOST GALAXIES OF LIGO AND VIRGO SOURCES IN THREE DIMENSIONS USING LOCAL COSMOGRAPHY AND TARGETED FOLLOW-UP

The Advanced Laser Interferometer Gravitational-wave Observatory (LIGO) discovered gravitational waves (GWs) from a binary black hole merger in 2015 September and may soon observe signals from neutron star mergers. There is considerable interest in searching for their faint and rapidly fading electromagnetic (EM) counterparts, though GW position uncertainties are as coarse as hundreds of square degrees. Because LIGO’s sensitivity to binary neutron stars is limited to the local universe, the area on the sky that must be searched could be reduced by weighting positions by mass, luminosity, or star formation in nearby galaxies. Since GW observations provide information about luminosity distance, combining the reconstructed volume with positions and redshifts of galaxies could reduce the area even more dramatically. A key missing ingredient has been a rapid GW parameter estimation algorithm that reconstructs the full distribution of sky location and distance. We demonstrate the first such algorithm, which takes under a minute, fast enough to enable immediate EM follow-up. By combining the three-dimensional posterior with a galaxy catalog, we can reduce the number of galaxies that could conceivably host the event by a factor of 1.4, the total exposure time for the Swift X-ray Telescope by a factor of 2, the total exposure time for a synoptic optical survey by a factor of 2, and the total exposure time for a narrow-field optical telescope by a factor of 3. This encourages us to suggest a new role for small field of view optical instruments in performing targeted searches of the most massive galaxies within the reconstructed volumes.

79 ASTRONOMY AND ASTROPHYSICS↗

AN ADAPTIVE PARTICLE-MESH GRAVITY SOLVER FOR ENZO

We describe and implement an adaptive particle-mesh algorithm to solve the Poisson equation for grid-based hydrodynamics codes with nested grids. The algorithm is implemented and extensively tested within the astrophysical code Enzo against the multigrid solver available by default. We find that while both algorithms show similar accuracy for smooth mass distributions, the adaptive particle-mesh algorithm is more accurate for the case of point masses, and is generally less noisy. We also demonstrate that the two-body problem can be solved accurately in a configuration with nested grids. In addition, we discuss the effect of subcycling, and demonstrate that evolving all the levels with the same timestep yields even greater precision.

79 ASTRONOMY AND ASTROPHYSICS↗

Computing Angular Distributions from Simulation Data

The essential idea of this algorithm is to compute the angular distribution of a vector quantity, then create an informative image. In our example, we will compute the angular distribution of linear momentum from an xRage simulation of an exploding shaped charge. We will then explore one possible method for adding information to the resulting image.

97 MATHEMATICS AND COMPUTING↗

Systematic Characterization of Power Hardware-in-the-Loop Evaluation Platform Stability: Preprint

This paper presents a systematic approach to characterize the stability of a power-hardware-in-the-loop (PHIL) platform, an important step in PHIL tests. Many existing works focus the stability assessments on the PHIL interface algorithm; however, this work considers all software and hardware subsystems that form the closed loop of the PHIL experiment and develops a complete closed-loop stability assessment. This assessment is developed in the context of a common framework that can be readily applied to other PHIL platforms. This paper presents methods for characterizing key PHIL subsystems toward obtaining transfer functions to be used for analysis. The systematic stability assessment approach is demonstrated for a case study involving PHIL testing of a solar inverter and validated using experimental data. assessment. This assessment is developed in the context of a common framework that can be readily applied to other PHIL platforms. This paper presents methods for characterizing key PHIL subsystems toward obtaining transfer functions to be used for analysis. The systematic stability assessment approach is demonstrated for a case study involving PHIL testing of a solar inverter and validated using experimental data.

24 POWER TRANSMISSION AND DISTRIBUTION↗