Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed System and Computing”

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,297 records · Page 72

The method of lines in analyzing solids containing cracks

A semi-numerical method is reviewed for solving a set of coupled partial differential equations subject to mixed and possibly coupled boundary conditions. The line method of analysis is applied to the Navier-Cauchy equations of elastic and elastoplastic equilibrium to calculate the displacement distributions in various, simple geometry bodies containing cracks. The application of this method to the appropriate field equations leads to coupled sets of simultaneous ordinary differential equations whose solutions are obtained along sets of lines in a discretized region. When decoupling of the equations and their boundary conditions is not possible, the use of a successive approximation procedure permits the analytical solution of the resulting ordinary differential equations. The use of this method is illustrated by reviewing and presenting selected solutions of mixed boundary value problems in three dimensional fracture mechanics. These solutions are of great importance in fracture toughness testing, where accurate stress and displacement distributions are required for the calculation of certain fracture parameters. Computations obtained for typical flawed specimens include that for elastic as well as elastoplastic response. Problems in both Cartesian and cylindrical coordinate systems are included. Results are summarized for a finite geometry rectangular bar with a central through-the-thickness or rectangular surface crack under remote uniaxial tension. In addition, stress and displacement distributions are reviewed for finite circular bars with embedded penny-shaped cracks, and rods with external annular or ring cracks under opening mode tension. The results obtained show that the method of lines presents a systematic approach to the solution of some three-dimensional mechanics problems with arbitrary boundary conditions. The advantage of this method over other numerical solutions is that good results are obtained even from the use of a relatively coarse grid.

Gyekenyesi, John P.↗

Dynamic Matrix Completion Based State Estimation in Distribution Grids

The power distribution network is undergoing tremendous transformation due to an increase in the penetration of renewable energy resources and electric vehicles. These changes have resulted in greater uncertainty and dynamics in the distribution grid states. Therefore, the ability to track and monitor system states has become a critical need for accurate and timely control actions. In this paper, we propose two dynamic sparsity-based state estimation approaches for distribution systems: (1) locally weighted matrix completion (LW-MC) and (2) Bayesian matrix completion with Kalman filter prediction (BMC-KF). The performance of the proposed dynamic state estimation strategies is compared with the classic/static matrix completion (static-MC) approach using the IEEE 37 and IEEE 123 bus test systems. Finally, results indicate that BMC-KF approach outperforms both LW-MC as well as static-MC even when 30% of the measurement data is available. Computational complexity associated with both approaches is quantified.

42 ENGINEERING↗

Transmission-and-Distribution Dynamic Co-simulation Framework for Distributed Energy Resource Frequency Response

The rapid deployment of distributed energy resources (DERs) in distribution networks has made it challenging to balance the transmission system and stabilize frequency. DERs have the ability to provide frequency regulation services; however, existing frequency dynamic simulation tools - which were developed mainly for the transmission system - lack the capability to simulate distribution network dynamics with high penetrations of DERs. Although electromagnetic transient simulation tools can simulate distribution network dynamics, the computation efficiency limits their use for large-scale transmission-and-distribution (T&D) co-simulation. This paper presents an efficient open-source T&D dynamic co-simulation framework for DER frequency response based on the HELICS platform and off-the-shelf T&D simulators. The challenge of synchronizing the simulation time between the transmission network and the DERs in the distribution network is solved through the detailed modeling of DERs in frequency dynamic models while DER power flow models are also preserved in the distribution networks, thereby respecting local voltage constraints when dispatching DER power for frequency response. DER frequency response (primary and secondary) is simulated in case studies to validate the proposed framework. Last, the accuracy of the proposed co-simulation model is benchmarked, and a large T&D system simulation (2k transmission and 1M distribution nodes) is presented to demonstrate the efficiency and effectiveness of the overall framework.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Nearly optimal state preparation for quantum simulations of lattice gauge theories

Here, we present several improvements to the recently developed ground-state preparation algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in (2+1) dimensions, as well as propose an alternative application of QETU, a highly efficient preparation of Gaussian distributions. The QETU technique was originally proposed as an algorithm for nearly optimal ground-state preparation and ground-state energy estimation on early fault-tolerant devices. It uses the time-evolution input model, which can potentially overcome the large overall prefactor in the asymptotic gate cost arising in similar algorithms based on the Hamiltonian input model. We present modifications to the original QETU algorithm that significantly reduce the cost for the cases of both exact and Trotterized implementation of the time evolution circuit. We use QETU to prepare the ground state of a U(1) lattice gauge theory in two spatial dimensions, explore the dependence of computational resources on the desired precision and system parameters, and discuss the applicability of our results to general lattice gauge theories. We also demonstrate how the QETU technique can be utilized for preparing Gaussian distributions and wave packets in a way which outperforms existing algorithms for as little as n q ≳ 2–5 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Distributed and recoverable digital control system

A real-time multi-tasking digital control system with rapid recovery capability is disclosed. The control system includes a plurality of computing units comprising a plurality of redundant processing units, with each of the processing units configured to generate one or more redundant control commands. One or more internal monitors are employed for detecting data errors in the control commands. One or more recovery triggers are provided for initiating rapid recovery of a processing unit if data errors are detected. The control system also includes a plurality of actuator control units each in operative communication with the computing units. The actuator control units are configured to initiate a rapid recovery if data errors are detected in one or more of the processing units. A plurality of smart actuators communicates with the actuator control units, and a plurality of redundant sensors communicates with the computing units.

Stange, Kent↗

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems

This work presents methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices play a critical role in many power system applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

large scale↗

Verifying the Computational Integrity of Power Grid Controls with Zero-Knowledge Proof

The control of future power grids is migrating from a centralized to a distributed/decentralized scheme to enable a massive penetration of distributed energy resources with rising dependence on communication infrastructure. A common assumption made for most existing distributed/decentralized controllers is that local controllers would faithfully follow the designated controller dynamics based on the data received from communication channels. However, with increased probability of cyberattacks on Operational Technology infrastructure, such an assumption could be risky because proper execution of the controller dynamics is then built on trust in secure communication and computation. In this work, we leverage a cryptography technology known as zero-knowledge scalable transparent arguments of knowledge (zk-STARK) to verify the computational integrity of power grid control algorithms, with projected linear dynamics-based control schemes as the initial proof-of-concept test case. The method presented here converts the cybersecurity challenge of data integrity for grid control into a subset of computational integrity.

computational integrity↗

Cosmic Reionization on Computers: Statistics, Physical Properties, and Environments of Lyman Limit Systems at z ~ 6

Lyman limit systems (LLSs) are dense hydrogen clouds with high enough H i column densities to absorb Lyman continuum photons emitted from distant quasars. Their high column densities imply an origin in dense environments; however, the statistics and distribution of LLSs at high redshifts still remain uncertain. In this paper, we use self-consistent radiative transfer cosmological simulations from the Cosmic Reionization on Computers (CROC) project to study the physical properties of LLSs at the tail end of cosmic reionization at z ~ 6. We generate 3000 synthetic quasar sight lines to obtain a large number of LLS samples in the simulations. In addition, with the high physical fidelity and resolution of CROC, we are able to quantify the association between these LLS samples and nearby galaxies. Our results show that the fraction of LLSs spatially associated with nearby galaxies increases with H i column density. Moreover, we find that LLSs that are not near any galaxy typically reside in filamentary structures connecting neighboring galaxies in the intergalactic medium (IGM). This quantification of the distribution and association of LLSs to large-scale structure informs our understanding of the IGM–galaxy connection during the "Epoch of Reionization," and provides a theoretical basis for interpreting future observations.

79 ASTRONOMY AND ASTROPHYSICS↗

SYMBIOSYS: A Methodology for Performance Analysis of Composable HPC Data Services

Microservices are a powerful new way of building, customizing, and deploying distributed services owing to their flexibility and maintainability. Several large-scale distributed platforms have emerged to serve the growing needs of data-centric workloads and services in commercial computing. Concurrently, high-performance computing (HPC) systems and software are rapidly evolving to meet the demands of diversified applications and heterogeneity. The interplay of hardware factors, software configuration parameters, and the flexibility offered with a microservice architecture makes it nontrivial to estimate the optimal service instantiation for a given application workload. Further, this problem is exacerbated when considering that these services operate in a dynamic and heterogeneous HPC environment. An optimally integrated service can be vastly more performant than a haphazardly integrated one. Existing performance tools for HPC either fail to understand the request-response model of communication inherent to microservices or they operate within a narrow scope, limiting the insight that can be gleaned from employing them in isolation. We propose a methodology for integrated performance analysis of HPC microservices frameworks and applications called SYMBIOSYS. We describe its design and implementation within the context of the Mochi framework. This integration is achieved by combining distributed callpath profiling and tracing with a performance data exchange strategy that collects fine-grained, low-level metrics from the RPC communication library and network layers. The result is a portable, low-overhead performance analysis setup that provides a holistic profile of the dependencies among microservices and how they interact with the Mochi RPC software stack. Using HEPnOS, a production-quality Mochi data service, we demonstrate the low-overhead operation of SYMBIOSYS at scale and use it to identify the root causes of poorly performing service configurations.

microservices↗

Chapter Nine - Automated Optimal Control in Energy Systems: The Reinforcement Learning Approach

With the development of smart grid technologies an increasing number of new devices and participants have joined modern energy systems and are inevitably making them more complicated and interdependent than ever. Optimally controlling such a complex energy system and maintaining its operation in a high-efficient, secure, and resilient manner are challenging tasks to the system operators. Fortunately, the revolution in deep learning and artificial intelligence (AI), both from hardware and algorithms perspectives, has provided new ideas and solutions to many previously intractable problems. As a result, this advance in computer science also sparked great research interests in utilizing AI in solving engineering problems related to the modern energy systems. Among many AI techniques, deep reinforcement learning (DRL) has demonstrated great potential for solving sequential optimization problems, which are very common in the engineering domains. Its ability to handle nonlinearity and stochasticity in controlled systems has out-competed many traditional optimal control algorithms. Therefore in this chapter, we focus on the state-of-the-art of DRL concepts and related algorithms, compare their pros and cons with traditional optimal control approaches and discuss the typical workflow for leveraging RL in solving complex problems in modern energy systems.

artificial intelligence↗

Resilient Operations of Networked Microgrids (RONM)

Objective: Improve the resiliency of power systems with optimization-based methods that leverage advanced microgrid technologies to reduce system recovery times after extreme event induced outages. Outcome: First-of-kind, high-fidelity physics-based optimization method for modeling networked microgrids which includes key engineering constraints associated with system recovery after extreme events.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Current possibilities and future opportunities for erasure coded computations

The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.

97 MATHEMATICS AND COMPUTING↗

Narrow-band Photometry of the Galilean Satellites

Observations were made of the Galilean satellites in a narrow-band photometric system with a resolution of approximately 30 that covers the wavelength range from 0.3-1.1 microns. The absolute scale of the system is determined from stellar model computations. It is concluded that 35 Leo, the main comparison star used, has an energy distribution similar to the sun. An attempt is made to interpret the albedo curves in terms of surface constituents.

Wamsteker, W.↗

Narrow-band photometry of the Galilean satellites.

Observations were made of the Galilean satellites in a narrow-band photometric system with a resolution of about 30 that covers the wavelength range from 0.3 to 1.1 micron. The absolute scale of the system is determined from stellar model computations. It is concluded that 35 Leo, the main comparison star used, has an energy distribution similar to the sun. An attempt is made to interpret the albedo curves in terms of surface constituents.

Wamsteker, W.↗

Identifying and locating land irrigated by center-pivot irrigation systems using satellite imagery

A methodology for using Landsat imagery for the identification and location of land irrigated by center-pivot irrigation systems is presented. The procedure involves the use of sets of Landsat band 5 imagery taken separated in time by about three weeks during the irrigation season, a zoom transfer scope and mylar base maps to record the locations of center pivots. Further computer processing of the data has been used to obtain plots of center-pivot irrigation systems and tables indicating the distribution and growth of systems by county for the state of Nebraska, and has been found to be in 95% agreement with current high-altitude IR photography. The information obtainable can be used for models of ground-water aquifers or resource planning.

Hoffman, R. O.↗

A multiple access communication network based on adaptive arrays

A single frequency communication system is considered consisting of K possibly moving users distributed in space simultaneously communicating with a central station equipped with a computationally adapted array of n = or K antennas. Such a configuration could result if K spacecraft were to be simultaneously tracked by a single DSN complex consisting of an n antennas array. The array employs K sets of n weights to segregate the signals received from the K users. The weights are determined by direct computation based on known position information of the K users. Currently known techniques require (for n = K) about (4/3)K to the 4th power computer operations (multiply and add) to perform such computations. A technique that accomplishes this same goal in 8 K to the 3rd power operations, yielding a reduction by a factor K/6, was developed.

Zohar, S.↗

Application of viscous and inviscid computation methods for rocket turbopump systems

This paper examines current research efforts underway at Lewis Research Center which have focused on improving the structural durability of the SSME turbodrive system through more fully examining the aerothermodynamics of the flow system. This objective was achieved by developing three-dimensional viscous and inviscid computer codes to predict the pressure and temperature distributions in the engine flow passages, particularly within the SSME turbines and turnaround ducts.

Povinelli, L. A.↗