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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Scalable Predictive Control and Optimization for Grid Integration of Large-Scale Distributed Energy Resources

Integrating a large number of distributed energy resources (DERs) into the power grid needs a scalable power balancing method. We formulate the power balancing problem as a look-ahead optimization problem to be solved sequentially by a power distribution system aggregator based on a model predictive control (MPC) framework. Solving large-scale look-ahead control problems requires proper configuration of the control steps. In this paper, to solve large-scale control problems, we propose a variable time granularity where control time steps nearby the current control step have finer resolutions. The aggregator objective includes maximization of power production revenue and minimization of power purchasing expense, renewable power curtailment, and mileage costs for energy storage and electric vehicle (EV) charging stations while satisfying system capacity and operational constraints. The control problem is formulated as a mixed-integer linear program (MILP) and solved using the XpressMP solver. We perform simulations considering a copper plate representation of a large distribution network consisting of 2507 devices (controllable DERs), including curtailable photovoltaics (PVs), energy storage batteries, EV charging stations, and buildings with heating, ventilation, and air conditioning units (HVACs). We show the effectiveness of the proposed approach in managing DERs interactively for maximum energy trading profit and local supply-demand power balancing. Finally, we demonstrate that the proposed method outperforms other benchmark controllers regarding computation time without compromising operational performance.

DER↗
DOE OSTI2021

Using Pilot Jobs and CernVM File System for Simplified Use of Containers and Software Distribution

High Energy Physics (HEP) experiments entail an abundance of computing resources, i.e. sites, to run simulations and analyses by processing data. This requirement is fulfilled by local batch farms, grid sites, private/commercial clouds, and supercomputing centers via High Throughput Computing (HTC). The growing needs of such experiments and resources being prone to trends of heterogeneity make it difficult for physicists to handle these resources directly. Additionally, HEP collaborations heavily rely on data and software releases, typically in the order of tens of gigabytes, while conducting simulations and analyses. Hence, aspects of scalability, reliability, and maintenance become crucial with regards to the distribution of the necessary data and software stack. The GlideinWMS [4] framework helps with the resource management problem by using pilot jobs, aka Glideins, to provision reliable elastic virtual clusters. Glideins are submitted to unreliable heterogeneous resources which are validated and customized by the Glideins to make the worker nodes available for end-user job execution. On the other hand, the CernVM File System (CernVM-FS or CVMFS) [1] helps with data distribution. It is a write-once, read-everywhere filesystem used to deploy scientific software to thousands of nodes on a worldwide distributed computing infrastructure. CVMFS is based on the Hyper Text Transfer Protocol and has been widely used within the particle physics community for (1) distributing experiment software and data such as calibrations, and (2) facilitating containerization by efficiently hosting container images along with providing containerization software, especially Singularity [3] GlideinWMS relies on CVMFS installed locally on the computing resources to satisfy the experiments' software needs. This requires system administrators' effort to install and maintain CVMFS at the sites and limits the use of sites, especially HPC resources, that do not have CVMFS installed. This poster presents a solution, taking advantage of Glideins to provide CVMFS at most sites without the need for a local installation. Doing so expands the pool of resources available for HEP experiments and reduces the effort of system administrators for current resources. Additionally, the proposed solution allows GlideinWMS to also start Singularity [3], a containerization software that can run unprivileged, on sites where neither CVMFS nor Singularity are available, including HPC sites. The benefits provided by this solution are: (1) lower overhead for site administrators in that they have less software to install, (2) an expanded pool of resources that run user jobs with easy access to software and data provided by CVMFS, thus making life easier for the scientists, and (3) improved flexibility to use HPC resources by enabling GlideinWMS pilot jobs to support HPC sites.

Urs, Namratha↗
DOE OSTI2026

Powered By ERAD [Slides]

Energy Resilience Analysis for Distribution Power System (ERAD) is a free, open-source Python toolkit for estimating the energy and service impacts of hazards like earthquakes and flooding. It uses a graph-based approach to capture high resolution connectivity among the grid, critical services, and customers and rapidly compute household level metrics and aggregated statistics across large distribution systems. It uses asset fragility curves that relate hazard severity to survival probability for power system equipment including cables, transformers, substations, etc. The tool is designed to be modular and extensible, allowing it to interface with third-party hazard simulators and integrate into broader resilience analysis workflows. ERAD enables researchers, students, communities, distribution utilities, and other stakeholders to understand hazard impacts and evaluate the effectiveness of different programs to improve energy resilience. The webinar was hosted by NLR researcher Aadil Latif.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Visibility-enhanced model-free deep reinforcement learning algorithm for voltage control in realistic distribution systems using smart inverters

Increasing integration of distributed solar photovoltaic (PV) into distribution networks could result in adverse effects on grid operation. Traditional model-based control algorithms require accurate model information that is difficult to acquire and thus are challenging to implement in practice. Here, this paper proposes a surrogate model-enabled grid visibility scheme to empower deep reinforcement learning (DRL) approach for distribution network voltage regulation using PV inverters with minimal system knowledge. In contrast to existing DRL methods, this paper presents and corroborates the adverse impact of missing load information on DRL performance and, based on this finding, proposes a surrogate model methodology to impute load information utilizing observable data. Additionally, a multi-fidelity neural network is utilized to construct the DRL training environment, chosen for its efficient data utilization and enhanced robustness to data uncertainty. The feasibility and effectiveness of the proposed algorithm are assessed by considering DRL testing across varying degrees of observable load information and diverse training environments on a realistic power system.

14 SOLAR ENERGY↗
DOE OSTI2022

Defensive Islanding to Enhance the Resilience of Distribution Systems Against Cyber-Induced Failures

The extensive integration of communication, computation, and control technologies into cyber-physical power systems (CPPSs) has increased the vulnerabilities of CPPSs to cyberattacks. This calls for developing solutions that assess and reduce the impacts of cyber-induced failures on CPPSs. This paper proposes a defensive islanding strategy to isolate impacted parts of the CPPS and form self-sufficient islanded grids with an objective of minimum load curtailment. The defensive islanding aims to split a power system into smaller grids to improve its resilience against a potential extreme event. A clustering approach that leverages the hierarchical spectral clustering method is utilized for the optimal defensive islanding. The proposed approach captures the fragility behavior and loading conditions of power system components due to cyber-induced failures. A graphical-based coupling framework is used to map the impacts of cyber failures into operation of power system components. The proposed method is demonstrated on a modified 33-node distribution feeder system integrated with distributed energy resources. The amount of load curtailment and radiality constraints have been used to evaluate the performance of the proposed clustering strategies. The results show the capability of the proposed algorithm to create islands considering the cyber-induced failures for enhanced resilience.

cyber-induced failures↗
DOE OSTI2021

Transient Simulations with a Large Penetration of Converter-Interfaced Generation: Scientific Computing Challenges and Opportunities

Current trends in energy systems point to renewable energy sources (RESs) and battery energy storage systems (BESSs) becoming prevalent in power system operations. As of writing this article, the United States has more than 37 GW of utility-scale solar capacity and an additional 112 GW under development. With the rapidly declining capital costs of many of these technologies, we can expect significant deployments in the coming years.

analytical models↗
DOE OSTI2020

TriC: Distributed-memory Triangle Counting by Exploiting the Graph Structure

Graph analytics has emerged as an important tool in the analysis of large scale data from diverse application domains such as social networks, cyber security and bioinformatics. Counting the number of triangles in a graph is a fundamental kernel with several applications such as detecting the community structure of a graph or in identifying important vertices in a graph. The ubiquity of massive datasets is driving the need to scale graph analytics on parallel systems. However, numerous challenges exist in efficiently parallelizing graph algorithms, especially on distributed-memory systems. Irregular memory accesses and communication patterns, low computation to communication ratios, and the need for frequent synchronization are some of the leading challenges. In this paper, we present TriC, our distributed-memory implementation of triangle counting in graphs using the Message Passing Interface (MPI), as a submission to the 2020 GraphChallenge competition. Using a set of synthetic and real-world inputs from the challenge, we demonstrate a speedup of up to 90x relative to previous work on 32 processor-cores of a NERSC Cori node. We also provide details from distributed runs with up to8192 processes along with strong scaling results. The observations presented in this work provide an understanding of the system-level bottlenecks at scale that specifically impact sparse-irregular workloads and will therefore benefit other efforts to parallelize graph algorithms.

Halappanavar, Mahantesh↗
DOE OSTI2022

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗
DOE OSTI2024

Distributionally Robust Bilevel Optimization Model for Distribution Network With Demand Response Under Uncertain Renewables Using Wasserstein Metrics

Here, we consider a distribution network integrating demand response (DR) participants in the presence of uncertain renewable suppliers and outdoor temperatures. A bilevel optimization model is proposed to capture the intricate dynamics between price-incentivized DR participants and distribution system operations, including energy procurement and active/reactive power flows. The model is formulated as a distributional robust bilevel optimization using Wasserstein metrics. We show favorable data-driven properties including out-of-sample guarantee and asymptotic consistency. Furthermore, we present a tractable mixed-integer linear programming reformulation and characterize the worst-case distribution. Computational experiments are conducted on a modified 33-bus system. Our findings underscore the efficacy of the pricing strategies derived from the proposed bilevel optimization model. These strategies not only effectively manage DR participants' behavior but also bring equity considerations among households with various characteristics to light. The results contribute to a deeper understanding of the interplay between distribution system operators and DR participants.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

QuComm: Optimizing Collective Communication for Distributed Quantum Computing

Distributed quantum computing (DQC) is a scalable way to build a large-scale quantum computing system while the error-prone nonlocal communication between DQC nodes may heavily degrade the fidelity of the distributed quantum program and thus demands specific compiler optimizations. Previous compilers on DQC communication optimization either assumes unlimited communication resource or a few communication qubits due to the hardware limitation. The former compilers may not be efficient when interfacing with communication-resource-constrained DQC hardware while the latter compilers lose the opportunities of optimizing collective communication and routing concurrent communication as they unnecessarily couple limited communication qubits with the implementation of expensive inter-node operations. In this paper, we invent the communication buffer, a communication facility consisting of idle qubits in each compute node, to decouple the execution of inter-node quantum operations from communication qubits: communication qubits are devoted to generating inter-node entanglement while internode operations are conducted in the communication buffer. The communication buffer provides an intermediate layer for inter-node communication and paves the way for collective communication optimization. We then propose QuComm, a buffer-based compiler framework that first performs smart buffer allocation according to communication characteristics of the distributed quantum program and then optimizes and collectively routes inter-node quantum operations. Experimental results on a hierarchical DQC system show that the proposed QuComm can reduce the most expensive inter-node communication request and the latency of various distributed quantum programs by 50.4% and 47.6% on average, respectively.

Wu, Anbang↗
DOE OSTI2025

Grey-Box System Identification of Grid-Forming Inverters

This paper demonstrates the use of grey-box system identification methods for simplifying and understanding the nonlinear power dynamics of grid-forming inverters (GFMs). The power and frequency outputs of complex high-order GFM models are fed into system identification software in order to fit them to a predetermined LTI system and learn system parameters such as (synthetic) inertia and droop constants. The same process is then run for a high-order synchronous generator model, and the outputs are fit to the same set of LTI equations. Simulation of a network of GFM inverters with diverse control architecture is also performed for the same process. The intent is threefold: first, to demonstrate the appropriateness of unified LTI models for describing the power and frequency dynamics of individual resources and connected networks, in order to facilitate analysis of larger heterogeneous networked systems; second, to discover the relationship between internal control parameters of GFMs and their externally observed values; and third, to validate that grey-box data-driven system identification techniques can be a valuable tool to discover the values of important parameters in the absence of explicit vendor models.

analytical models↗
DOE OSTI2021

A Network-Aware Distributed Energy Resource Aggregation Framework for Flexible, Cost-Optimal, and Resilient Operation

To efficiently use the ubiquitous behind-the-meter distributed energy resources (DERs) in distribution systems for providing grid services, this paper presents a hierarchical control framework for DER optimal aggregation and control. We first develop a convex optimization model to evaluate the DER flexibility, and then use a convex model-predictive-control based approach to dispatch those DERs. The hierarchical control framework consists of a utility controller, community aggregators and multiple home energy management systems. The flexibility of the DERs is evaluated by each controller in the hierarchy such that the resultant flexibility is feasible given its operational domain. Based on the determined flexibility, the hierarchical controllers then compute optimal setpoints for the DERs to help the distribution system regulate node voltages and provide other distribution grid services. Numerical simulations performed on a model of a real distribution feeder in Colorado, using actual DER data in a residential community demonstrate that the proposed approach can effectively alleviate voltage issues and support resilient operation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Accelerating Simulation for High-Fidelity PV Inverter System Reliability Assessment with High-Performance Computing

The overall cost of photovoltaic (PV) systems has shown a downward trend during the last decade; however, PV inverter failures account for the highest cost of operation and maintenance. To address this, reliability tools with powerful computation and better accuracy are required for the lifetime prediction and degradation evaluation of PV inverters. This paper proposes an event-driven parallel computing-based simulator. The proposed simulator applies high-performance computing techniques and other accessory optimization techniques-including cluster merging, adaptive model updates, and steady-state identification-to make reliability assessments for PV inverters under given input mission profiles and operating conditions with high efficiency and high fidelity. The main idea of the simulator and its workflow are introduced. Then, a demo PV inverter system simulator is implemented, and the speedup of the total simulations of the switching model reaches 123.03 times.

high-performance computing↗
DOE OSTI2025

Data Management in the Continuum: Cross-facility Object-based Data Transfers

Scientific workflows are evolving from relying on a monolithic storage subsystem at a single High-Performance Computing (HPC) facility to using geographically distributed file systems, repositories, and cloud storage. As a result, storing, accessing, transferring, and managing scientific data have become highly complex and prone to performance inefficiencies. This paper delves into these challenges by exploring an optimized end-to-end interface designed to seamlessly connect various local and remote storage systems, enabling efficient data movement of objects across HPC–Cloud and HPC–HPC environments. We showcase this capability through an object-focused data management runtime system, discuss the effects of relaxed consistency semantics in distributed object scenarios, and illustrate its application in an earthquake simulation workflow. Besides reducing the amount of data by selectively transferring regions of interest, our facility-local results achieved a speedup of 45 × over an optimized HDF5 usage and 15 × over the HDF5 with caching by using the new interface in PDC-XF.

Bez, Jean Luca↗
DOE OSTI2026

Modernizing GlideinWMS Factory Monitoring with Prometheus & Grafana

Large-scale scientific experiments like CMS and DUNE rely on the distributed workload management system GlideinWMS to efficiently utilize computing resources across heterogeneous computing environments. GlideinWMS currently records Factory statistics using Round Robin Databases (RRDBs), XML, and JSON files, and these statistics are displayed via custom monitoring Web pages, thereby limiting integration with modern observability platforms. This project investigates the use of Prometheus-based instrumentation to expose Factory metrics using OpenTelemetry principles. Factory statistics related to Glidein submission and job execution are exported as Prometheus metrics through the Prometheus Python Client Library and are served via an HTTP metrics endpoint. The collected metrics are inspected using the Prometheus web-based interface and are visualized through Grafana dashboards within the Landscape monitoring infrastructure at Fermilab. This project significantly streamlines the integration of modern monitoring technologies into GlideinWMS and establishes a framework for extending observability across additional system components.

Appiah, Gideon [Grambling State U.]↗
DOE OSTI2022

Coordinated neutron and X-ray computed tomography of meteorites: Detection and distribution of hydrogen-bearing materials

The presence and distribution of hydrogen-bearing materials in meteorites are important constraints on processes in the early solar system, and the delivery of volatile constituents to growing planets. Here, in this paper, we show that coordinated neutron and X-ray computed tomography, NXCT, can reveal the presence and distributions of hydrogen-bearing materials in meteorites, and thus help constrain the presence and actions of water in the early solar system. NXCT is nearly nondestructive of meteorite samples. Neutron fluence in NXCT is approximately seven orders of magnitude less than in typical instrumental neutron activation analysis, and so produces little residual radioactivity and currently undetectable changes in isotope ratios. Heating during NXCT is minimal, but NXCT will overprint the record of cosmic ray exposure held in natural thermoluminescence. Two meteorites were examined. EET 87503 is a howardite, a regolith breccia inferred to be from the asteroid 4 Vesta, and contains fragments of eucrite basalt, diogenite pyroxenite, and H-rich carbonaceous chondrites. With NXCT, the chondrite fragments within the meteorite piece can be clearly located and characterized, in preparation for possible extraction and detailed analyses. Graves Nunataks (GRA) 06100 is a CR2 chondrite meteorite that contains abundant iron metal and H-bearing silicates from aqueous alteration. In NXCT, H-bearing altered material is clearly distinguished from metal, and its distribution in three dimensions is revealed as a constraint on the processes of alteration.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

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)↗