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 145 records · Page 8

Data-driven quantum approximate optimization algorithm for power systems

Abstract Quantum technology provides a ground-breaking methodology to tackle challenging computational issues in power systems. It is especially promising for Distributed Energy Resources (DERs) dominant systems that have been widely developed to promote energy sustainability. In those systems, knowing the maximum sections of power and data delivery is essential for monitoring, operation, and control. However, high computational effort is required. By leveraging quantum resources, Quantum Approximate Optimization Algorithm (QAOA) provides a means to search for these sections efficiently. However, QAOA performance relies heavily on critical parameters, especially for weighted graphs. Here we present a data-driven QAOA, which transfers quasi-optimal parameters between weighted graphs based on the normalized graph density. We verify the strategy with 39,774 expectation value calculations. Without parameter optimization, our data-driven QAOA is comparable with the Goemans-Williamson algorithm. This work advances QAOA and pilots its practical application to power systems in noisy intermediate-scale quantum devices.

Jing, Hang (ORCID:0000000256343489)↗

Allocating Reserves in Active Distribution Systems for Tertiary Frequency Regulation

This paper proposes a cooperative game theory-based approach for reserve optimization to enable distributed energy resources (DERs) participate in tertiary frequency regulation. Tertiary frequency regulation schemes ensure that reserve requirements of primary and secondary frequency regulation are fulfilled with a minimum cost. While the available reserve from a single distribution system may not suffice tertiary frequency regulation, stacked reserve from several distribution systems can enable them participate in tertiary frequency regulation at scale. In this paper, a two-stage strategy is proposed to effectively and precisely allocate spinning reserve requirement from each DER in distribution systems. In the first stage, two types of characteristic functions are computed: worthiness index (WI) and power loss reduction (PLR). In the second stage, the equivalent Shapley values are computed based on the characteristic functions, which are used to determine distribution factors for reserve allocation among DERs. The effectiveness of the proposed method for allocating reserves among DERs is demonstrated through several case studies on modified versions of the IEEE 13-node and 33-node distribution systems.

Gautam, Mukesh↗

Lowering entry barriers to developing custom simulators of distributed applications and platforms with SimGrid

Researchers in parallel and distributed computing (PDC) often resort to simulation because experiments conducted using a simulator can be for arbitrary experimental scenarios, are less resource-, labor-, and time-consuming than their real-world counterparts, and are perfectly repeatable and observable. Many frameworks have been developed to ease the development of PDC simulators, and these frameworks provide different levels of accuracy, scalability, versatility, extensibility, and usability. Further, the SimGrid framework has been used by many PDC researchers to produce a wide range of simulators for over two decades. Its popularity is due to a large emphasis placed on accuracy, scalability, and versatility, and is in spite of shortcomings in terms of extensibility and usability. Although SimGrid provides sensible simulation models for the common case, it was difficult for users to extend these models to meet domain-specific needs. Furthermore, SimGrid only provided relatively low-level simulation abstractions, making the implementation of a simulator of a complex system a labor-intensive undertaking. In this work we describe developments in the last decade that have contributed to vastly improving extensibility and usability, thus lowering or removing entry barriers for users to develop custom SimGrid simulators.

97 MATHEMATICS AND COMPUTING↗

Atomistic Insights into Lithium–Glyme Solvate Ionic Liquids: Effects of Chain Length and Anion Coordination

For this study, mixtures of lithium bis(trifluoromethanesulfonyl)imide (LiTFSI) in diglyme (G2), triglyme (G3) and tetraglyme (G4) at solvate ionic liquid (SIL) concentrations were investigated using classical molecular dynamics (cMD) simulations with a physically motivated force-field specifically developed for modeling these systems. The structural and dynamical properties of the mixtures were computed and analyzed. Lithium solvation shells, radial distribution functions, and X-ray structure factors were studied across the different SIL systems. Translational diffusion and rotational relaxation times were also evaluated, exhibiting similar trends with increasing glyme chain length. The results are consistent with experimental data and in good agreement with previous computational studies on G3 and G4. These findings validate the accuracy of the force field in modeling glyme systems and its use for describing the [Li(G2) 4/3 ][TFSI] mixture. Additionally, the thermal and electrochemical stability of these electrolytes were systematically examined. The thermal stability appears to be governed by cooperative interactions among glyme molecules, while the electrochemical stability is primarily influenced by Li + -anion interactions, which vary significantly with glyme chain length. Overall, the study sheds light on the crucial role of the anion in these glyme-based SILs and offers valuable insights into Li + -glyme systems at SIL concentrations, highlighting their promise as potential Li-ion battery electrolytes.

anions↗

A New Distributed Model-Free Control Strategy to Diminish Distribution System Voltage Violations

This paper proposes a new distributed model-free control (MFC) strategy for dynamic voltage control to diminish distribution systems' voltage violations. The objective is to maintain all critical load bus voltages within the acceptable ANSI Range A (+/- 5% of nominal). The distributed MFC strategy, which only requires local voltage measurements from designated load buses, controls online the reactive power generation of available synchronous generator (SG)-based and photovoltaic (PV)-based distributed generators (DGs). The distributed MFC strategy is computationally efficient and does not require modelling of the different system components and disturbances. Time-domain dynamic simulations are conducted for the 21-bus test distribution system fed by multiple DGs to verify the performance of the proposed MFC strategy, and the results are compared against the conventional model-based microgrid voltage stabilizer (MGVS) control strategy. The simulation results show that the distributed MFC strategy provides minimal voltage violations and achieves the dynamic voltage stability of the system under diverse disturbances.

Hatipoglu, Kenan↗

Integrated Framework of Multisource Data Fusion for Outage Location in Looped Distribution Systems

Accurate outage location is essential for expediting post-outage power restoration, minimizing outage duration, and enhancing the resilience of distribution networks. With the advent of advanced metering infrastructure, data-driven outage location methods have significantly advanced beyond traditional approaches that rely on manual inspections. However, existing methods still face critical challenges, like reliance on single-source data, limited ability to handle partially observable systems or difficulties with loop networks. To the best of our knowledge, no single approach has comprehensively addressed all of these challenges at once. To this end, this paper proposes a comprehensive multisource data fusion framework for outage locations via probabilistic graph networks. The framework consists of three key phases. First, a novel method for reconstituting distribution networks with loops is developed, transforming looped networks into multiple radial subnetworks that retain all outage causalities of the original network. Second, Bayesian network (BN) models are established for each subnetwork, integrating multiple data sources and network structures. Finally, a joint Gibbs sampling mechanism, featuring forward and backward information flow, is designed to merge data from separate BN models and maximize the utilization of limited evidence, ensuring accurate outage location identification. In conclusion, the framework was validated on two modified public test systems, and comparative studies confirmed its effectiveness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Standardizing Performance Metrics for Building-Level Electrical Distribution Systems

Building-level electrical distribution systems comprise a myriad of current-carrying equipment, conversion devices, and protection devices that deliver power from the utility or local distributed energy resources to end-use building loads. Electric power has traditionally been generated, transmitted, and distributed in alternating current (AC). However, the last decade has seen a significant increase in the integration of native direct current (DC) equipment that has elevated the importance of DC distribution systems. Numerous studies have comparatively examined the performance of various electrical distribution systems in buildings but have failed to achieve uniform conclusions, primarily because of a lack of consistent and analogous performance evaluation methods. This paper aims to fill this gap by providing a standard set of metrics and measurement boundaries to consistently evaluate the performance of AC, DC, or hybrid AC/DC electrical distribution systems. The efficacy of the proposed approach is evaluated on a representative medium-sized commercial office building model with AC distribution and an equivalent hybrid AC/DC and DC distribution model, wherein the AC distribution model is concluded to be the most efficient. The simulation results show variation in computed metrics with different selected boundaries that verify the effectiveness of the proposed approach in ensuring consistent computation of the performance of building-level electrical distribution systems. This paper provides an initial set of guidelines for building energy system stakeholders to adopt appropriate solutions, thus leading to more efficient energy systems.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Bayesian learning of orthogonal embeddings for multi-fidelity Gaussian Processes

Uncertainty propagation in complex engineering systems often poses significant computational challenges related to modeling and quantifying probability distributions of model outputs, as those emerge as the result of various sources of uncertainty that are inherent in the system under investigation. Gaussian Processes regression (GPs) is a robust meta-modeling technique that allows for fast model prediction and exploration of response surfaces. Multi-fidelity variations of GPs further leverage information from cheap and low fidelity model simulations in order to improve their predictive performance on the high fidelity model. In order to cope with the high volume of data required to train GPs in high dimensional design spaces, a common practice is to introduce latent design variables that are typically projections of the original input space to a lower dimensional subspace, and therefore substitute the problem of learning the initial high dimensional mapping, with that of training a GP on a low dimensional space. Here in this paper, we present a Bayesian approach to identify optimal transformations that map the input points to low dimensional latent variables. The \projection" mapping consists of an orthonormal matrix that is considered a priori unknown and needs to be inferred jointly with the GP parameters, conditioned on the available training data. The proposed Bayesian inference scheme relies on a two-step iterative algorithm that samples from the marginal posteriors of the GP parameters and the projection matrix respectively, both using Markov Chain Monte Carlo (MCMC) sampling. In order to take into account the orthogonality constraints imposed on the orthonormal projection matrix, a Geodesic Monte Carlo sampling algorithm is employed, that is suitable for exploiting probability measures on manifolds. We extend the proposed framework to multi-fidelity models using GPs including the scenarios of training multiple outputs together. We validate our framework on three synthetic problems with a known lower-dimensional subspace. The benefits of our proposed framework, are illustrated on the computationally challenging aerodynamic optimization of a last-stage blade for an industrial gas turbine, where we study the effect of an 85-dimensional shape parameterization of a three-dimensional airfoil on two output quantities of interest, specifically on the aerodynamic efficiency and the degree of reaction

42 ENGINEERING↗

Safe Deep Reinforcement Learning for Active Distribution System Model Predictive Control with EVs and DERs

The temporal and spatial mismatch between PV generation and electric vehicle (EV) charging and discharging may cause voltage violations in active distribution networks. Despite the widespread use of deep reinforcement learning (DRL) in power system optimization and control, it lacks guarantees on constraint satisfaction during both training and deployment. This paper proposes a Lagrangian-based safe DRL approach for model predictive control (MPC) of active distribution systems with large-scale integration of PVs, EVs, and energy storage systems (ESSs). A Transformer-LSTM time-series model is proposed to forecast EV charging demand, which is then formulated as a constraint to ensure charging requirements are met. Using this prediction, a Lagrangian-based safe soft actor-critic (SAC) framework is developed for real-time control in a three-phase unbalanced distribution system, enforcing voltage safety constraints while optimizing the cumulative net reward. By integrating the forecasting model with multi-period constraints, the proposed framework jointly coordinates PV systems, EV charging and discharging, and ESS scheduling within the MPC horizon. Numerical experiments on a modified IEEE 123-bus system with real-world data show that, under a high PV penetration scenario, the proposed method increases the net reward by 30.74% and reduces average voltage violations from 0.0011 p.u. to 0.0002 p.u. compared with standard SAC. Compared with the optimal power flow (OPF) approach, it achieves similar voltage security while yielding lower line losses. It also maintains real-time control capability, reducing operation latency to 53.21 ms per 15-minute control interval. The proposed method remains effective under varying PV/EV penetrations and load conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

GPS Spoofing Mitigation and Timing Risk Analysis in Networked Phasor Measurement Units via Stochastic Reachability

To address phasor measurement unit (PMU) vulnerability to spoofing, we propose the use of a set-valued state estimation technique known as stochastic reachability (SR)-based distributed Kalman filter (DKF) that computes secure global positioning system (GPS) timing across a network of receivers. Utilizing SR, we estimate not only GPS time but also its stochastic reachable set, which is parameterized by probabilistic zonotope (p-Zonotope). While requiring known measurement error bounds in only non-spoofed conditions, we designed a two-tiered approach. We first performed measurement-level spoofing mitigation via deviation of a measurement innovation from its expected p-Zonotope. We then performed state-level timing risk analysis via a determination of the intersection probability of the estimated p-Zonotope with an unsafe set that violates IEEE C37.118.1a-2014 standards. Finally, we validated our SR-DKF algorithm by subjecting it to a simulated receiver network to coordinate signal-level spoofing. We demonstrate improved timing accuracy and successful spoofing mitigation via the use of our SR-DKF algorithm. We also validated the robustness of the estimated timing risk as the number of receivers were varied.

47 OTHER INSTRUMENTATION↗

Distributed Data-Driven Optimization for Voltage Regulation in Distribution Systems

Here, this paper proposes a distributed data-driven optimization framework for voltage regulation in distribution systems. The recursive kernel regression and alternating direction method of multipliers (ADMM) are selected to cover the system learning and distributed optimization tasks. The proposed distributed data-driven framework is capable of having a rapid response to system or load changes while considering the operation optimality. Besides, the distributed algorithm parallels the computation tasks and reduces the computational expense of a single agent. To validate the performance of the proposed method, a hypothetical 7-Bus system and the IEEE 123-Bus system are selected to show the effectiveness of the proposed data-driven framework. According to the numerical study results, the proposed method offers great flexibility for selecting customized kernel models for different regions and can effectively improve the system voltage profile in a distributed manner.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantifying dispersity in size and shape of nanoparticles from small-angle scattering data using machine learning based CREASE

Here, we use machine learning (ML) enhanced computational reverse engineering analysis of scattering experiments (CREASE) to interpret small-angle X-ray scattering (SAXS) data obtained from a system of nanoparticles without a priori knowledge of their exact shapes (e.g. spheres or ellipsoids), sizes (0.5–50 nm) and distributions. The SAXS measurements yielded three categories of scattering profiles exhibiting 'strong', 'weak' and 'no' features. Diminishing features (e.g. broadening or disappearing peaks) in scattering profiles have always been attributed to the presence of significant dispersity in the system. Such featureless SAXS data are not suitable for traditional analysis using analytical models. If one were to fit a relevant analytical model (e.g. the lmfit analytical model for polydisperse spheres) to these 'weak' and 'no' SAXS profiles from our nanoparticle systems, one would obtain non-unique interpretations of the data. Relying on electron microscopy to identify the distributions of nanoparticle shapes and sizes is also unfeasible, especially in high-throughput synthesis and characterization loops. In such situations, to identify the distributions of particle sizes and shapes that could be present in the sample, one must rely on methods like ML-CREASE to interpret the data quickly and output all relevant interpretations about the structure present in the system. The ML-CREASE optimization loop takes the experimental scattering profile as input and outputs multiple candidate solutions whose computed scattering profiles match the SAXS profile input. The ML-CREASE method outputs distributions of relevant structural features, such as the volume fraction of the nanoparticles in the system and the mean and standard deviation of the particle size and aspect ratio, assuming a type of distribution (e.g. normal, log-normal) for size and aspect ratio. We find that, for the SAXS profiles analyzed here, accounting for the shape dispersity along with size dispersity of the nanoparticles using ML-CREASE improved the match between the computed scattering profiles and input experimental profiles.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The git based ATLAS data acquisition configuration service in LHC Run 3

The ATLAS experiment at the LHC at CERN uses a large, distributed trigger and data acquisition system composed of many computing nodes, networks, and hardware modules. Its configuration service is used to provide descriptions of control, monitoring, diagnostic, recovery, dataflow and data quality configurations, interconnections, and parameters for modules, chips, and channels of various online systems, detectors, and the whole ATLAS experiment. Those descriptions have historically been stored in more than one thousand interconnected XML files, which are updated by various experts many times per day. Maintaining error-free and consistent sets of such files and providing reliable and fast access to current and historical configurations is a major challenge. This paper gives details of the configuration service upgrade on the modern Git version control system backend for LHC Run 3 and its exploitation experience. It may be interesting for developers using human-readable file formats, where consistency of the files, performance, access control, traceability of modifications, and effective archiving are key requirements.

Soloviev, Igor [Univ. of California, Irvine, CA (U↗

BULKI-Store v0.3.2

BULKI-Store is a distributed object storage system optimized for high-performance computing environments. Built with a Rust core and Python bindings, it efficiently manages scientific and machine learning datasets across HPC clusters. The system employs a client-server architecture with MPI integration, enabling seamless scaling on supercomputers like Perlmutter. BULKI-Store's object-oriented approach provides intuitive data organization with rich metadata support, contrasting with traditional file-based solutions. Key optimizations include selective checkpoint loading, unified checkpoint files, and object chunking for large data transfers. For machine learning workloads, BULKI-Store offers advantages through fine-grained access patterns, dynamic data sharing between training instances, and reduced memory pressure. Memory management features include strategic Python GC calls, minimized data copies, and batch processing capabilities. The system leverages Rayon's thread pool for asynchronous data prefetching and supports multiple CPU architectures (ARM64, x86, AMD, RISC-V). By combining performance optimizations with developer-friendly APIs, BULKI-Store addresses the complex data management challenges of modern HPC applications while maintaining compatibility across heterogeneous computing environments.

Zhang, Wei [Lawrence Berkeley National Laboratory ↗

Enhancement of Distribution System Resilience Through the Application of Volt-Var Regulation Devices

This paper discusses a practical implementation of locating and sizing dynamic reactive compensation using an impedance matrix (Zbus) approach to improve distribution system resilience in scenarios with high penetration of distributed resources. The modeled system is a 14.2 kV radial residential system modified to be fed by a combination of traditional sources and solar resources. Time-varying loads and PV sources are connected along the feeder to simulate the challenging operational voltage regulation scenarios faced by Modern Distribution Systems. Additionally, enhancement of the resilience of the electrical system is demonstrated through analyzing the effect of a topology change to the system. This study uses the GridLAB-D software.

42 ENGINEERING↗

Exploring finite temperature properties of materials with quantum computers

Abstract Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.

36 MATERIALS SCIENCE↗

BCS-BEC crossover of the strongly interacting 6 Li − 40 K mixture

Here, we present quantum Monte Carlo calculations of the properties of a two-component mass-imbalanced Fermi gas, corresponding to the 6 Li − 40 K mixture. We compute the equation of state of the unpolarized system as a function of the scattering length with particular attention paid to the unitary limit, where the effect of the effective range of the interaction is explored. In order to investigate differences from the equal-mass case we also compute the pair-distribution function and the momentum distribution over a range of interaction strengths, which can provide information about the structure of the system. Finally, we compute the heavy-light quasiparticle spectrum for the full crossover regime. Our theoretical predictions, based on quantum Monte Carlo calculations, should inform future theoretical studies and can be tested by experiments with ultracold fermionic gases.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Towards scaling community detection on distributed-memory heterogeneous systems

Distributed multi-GPU systems pose significant challenges and opportunities for efficient execution of parallel applications. Graph algorithms are generally characterized by irregular memory accesses, low computation to communication ratios, and load balancing problems that are especially hard to address on multi-GPU systems. Graph community detection is an important problem in the emerging domain of graph analytics with numerous applications. In this paper, we present our ongoing work on distributed-memory multi-GPU implementation for graph community detection. Our work parallelizes the widely used (albeit serial) Louvain method on distributed multi-GPU platforms. Supported by an extensive set of experiments on a multi-GPU enabled supercomputer (OLCF Summit) and a single compute node (Nvidia DGX-2®), we demonstrate competitive performance to existing distributed-memory CPU-based implementation, and up to 6.5 better results than Nvidia RAPIDS® CUGRAPH. To the best of our knowledge, this work represents the first effort for community detection on distributed multi-GPU systems. Our approach and related findings can be extended to numerous other iterative graph algorithms on multi-GPU systems.

97 MATHEMATICS AND COMPUTING↗