SEARCH · Search NASA

Results for “communication constraints”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 37 records · Page 2

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Stochastic scheduling of generating units with weekly energy storage: A hybrid decomposition approach

We propose a solution method for the large-scale stochastic unit commitment (SUC) problem with weekly-dispatched energy storage and significant weather-dependent stochastic generating capacity. Weekly storage facilities that mostly charge during weekends and discharge during weekdays require a weekly scheduling of generating units, which result in a large-scale optimization problem. This SUC problem is formulated as a two-stage stochastic model and we use the conditional value-at-risk as a risk measure. Using a Benders framework, the proposed solution method decomposes the problem into a mixed-integer linear master problem and linear and continuous subproblems. The master problem corresponds to the first-stage decisions throughout the week and includes all the commitment (binary) variables and their corresponding constraints. The subproblems correspond to the actual dispatch of the generating units on a weekly basis. Based on the success of column-and-constraint generation algorithms to solve robust optimization problems, we improve the low communication between the master problem and the subproblems in the standard Benders decomposition by adding primal variables and constraints from the subproblems to the master problem, which provides a better approximation of the recourse function. Furthermore, our computational experiments demonstrate the effectiveness of the proposed decomposition method using an instance of the South Carolina synthetic system with 90 generating units under 40 scenarios.

25 ENERGY STORAGE↗

DOE OSTI2020

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Current Noisy Intermediate-Scale Quantum (NISQ) computers and forward-looking Fault-Tolerant (FT) quantum computers have fundamentally different constraints such as data locality, instruction parallelism, and communication overhead. Our heuristic-based ancilla-reuse algorithm balances these considerations and fits computations into resource-constrained NISQ or FT quantum machines, throttling parallelism when necessary. To precisely capture the workload of a program, we propose an improved metric, the "active quantum volume," and use this metric to evaluate the effectiveness of our algorithm. Furthermore, our results show that SQUARE improves the average success rate of NISQ applications by 1.47X. Surprisingly, the additional gates for uncomputation create ancilla with better locality, and result in substantially fewer swap gates and less gate noise overall. SQUARE also achieves an average reduction of 1.5X (and up to 9.6X) in active quantum volume for FT machines.

compiler optimization↗

DOE OSTI2024

Modeling Grid Data Flows for Transmission and Distribution Operations: Review, Design, Next Steps

Operational scenarios of the power grids grow multifold to accommodate the diverse needs of both the utilities and end consumers, and the various other stakeholders in-between. To comprehensively model and apply analytics to support objectives and business functions of grid sectors, a reliable approach to characterize and design data flows is crucial. The flows bridge business functions with communications protocols, stakeholders such as the grid actors, and data interfaces comprising different data objects. Additionally, constraints applied to the flow such as cybersecurity, trust, privacy, and ownership among others intersect these entities, requiring the delineation of their interactions under different scenarios. This paper aims to not only highlight relevant research in the space of grid data flows, but also proposes, for the transmission-distribution sector, a novel modeling approach that marries the aforementioned entities: objectives, business functions, data interfaces, communication protocols, data stakeholders, and flow constraints. It elaborates on the design philosophy and the significance of each entity within the model and applies it to an example function of fault location, isolation and service restoration (FLISR). Finally, the next steps to extend the application of this data flow model for other practical operational scenarios are discussed.

Sundararajan, Aditya [ORNL] (ORCID:000000033577854↗

DOE OSTI2025

Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels

We investigate the generation of EPR pairs between three observers in a general causally structured setting, where communication occurs via a noisy quantum broadcast channel. The most general quantum codes for this setup take the form of tripartite quantum channels. Since the receivers are constrained by causal ordering, additional temporal relationships naturally emerge between the parties. These causal constraints enforce intrinsic no-signalling conditions on any tripartite operation, ensuring that it constitutes a physically realizable quantum code for a quantum broadcast channel. We analyze these constraints and, more broadly, characterize the most general quantum codes for communication over such channels. We examine the capabilities of codes that are fully no-signalling among the three parties, positive partial transpose (PPT)-preserving, or both, and derive simple semidefinite programs to compute the achievable entanglement fidelity. We then establish a hierarchy of semidefinite programming converse bounds -- both weak and strong -- for the capacity of quantum broadcast channels for EPR pair generation, in both one-shot and asymptotic regimes. Notably, in the special case of a point-to-point channel, our strong converse bound recovers and strengthens existing results. Finally, we demonstrate how the PPT-preserving codes we develop can be leveraged to construct PPT-preserving entanglement combing schemes, and vice versa.

FOS: Physical sciences↗

DOE OSTI2021

Emergency Voltage Regulation in Power Systems via Ripple-Type Control

With increasing penetrations of volatile renewable generation and cyber-physical disruptions, ensuring the safe operation of bulk power systems has become unprecedentedly challenging. Because communication and computational costs restrict centralized system dispatch to being called upon every few minutes, and because purely local schemes are shown to be insufficient, distributed controls have been advocated for handling unanticipated system conditions in real time. The applicability of distributed control schemes, however, is fundamentally limited by their need for widespread communication and model cognizance. In this context, we put forth a hybrid, low-communication, saturation-driven protocol for the coordination of control agents that are distributed over a physical system and are allowed to communicate with peers over a "hotline" communication network. Under this protocol, when agents observe a constraint violation based on local measurements, they respond locally until their control resources saturate, in which case they send a beacon for assistance to peer agents. The scheme ensures that minor violations are efficiently mitigated via fast local controls, whereas severe violations can be handled by collaboration among a relatively small set of agents. We evaluate the performance of this scheme via numerical tests on the IEEE 14-bus test feeder, where agents act upon noisy measurements under diverse scenarios of load variations and severe low-/high-voltage events.

collaboration↗

DOE OSTI2023

Bi-Level Adaptive Storage Expansion Strategy for Microgrids Using Deep Reinforcement Learning

Battery energy storage (BES) is a versatile resource for the secure and economic operation of microgrids (MGs). Prevailing stochastic optimization-based approaches for BES expansion planning for MGs are computationally complicated. This work proposes a data-driven bi-level multi-period BES expansion planning framework to determine the siting, sizing, and timing of BES installations. The proposed planning framework unifies deep reinforcement learning (DRL) and linear programming, thereby decoupling the determinations for the integer and continuous decision variables in two time scales, respectively. In the upper level, a rainbow DRL agent with quantile regression is trained to provide dynamic planning policies to accommodate stochastic renewable energy resources (RESs), load, and battery price changes efficiently. Further, the lower level computes the optimal operation of MGs with frequency constraints to hedge the islanding contingency. The two levels communicate with one another by exchanging storage configuration and operating expenses in order to accomplish the shared goal of minimizing investment and operation costs. Comparative case studies on an MG are carried out to demonstrate the superiority of the proposed DRL-based solution to the mixed-integer linear programming counterpart on efficiency, scalability, and adaptability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2021

Emergency Voltage Regulation in Power Systems via Ripple-Type Control: Preprint

With increasing penetration of volatile renewable generation and cyber-physical disruptions, ensuring safe operation of bulk power systems has become unprecedentedly challenging. Since communication and computational costs restrict centralized system dispatch to be called upon every few minutes; and purely local schemes are shown to be insufficient, distributed controls have been advocated for handling unanticipated system conditions in real time. However, the applicability of distributed control schemes is fundamentally limited by their need for widespread communication and model cognizance. In this con-text, we put forth a hybrid low-communication saturation-driven protocol for the coordination of control agents that are distributed over a physical system and are allowed to communicate with peers over a ‘hotline’ communication network. Under this protocol, when agents observe a constraint violation based on local measurements, they respond locally until their control resources saturate, in which case they send a beacon for assistance to peer agents. The scheme ensures that minor violations are efficiently mitigated via fast local controls, while severe violations may be handled by a collaboration of a relatively small set of agents. We evaluate the performance of this scheme via extensive numerical tests on the IEEE 14-bus test feeder, where agents act upon noisy measurements under diverse scenarios of random load variations and severe low/high voltage events.

distributed control↗

DOE OSTI2021

Seeding picoscale solutions for social macro goals: complex thinking in projects for vulnerable communities

This chapter presents lessons learned from two experiences of implementing sociopoliticalsustainability strategies to achieve environmental and economic sustainability.The projects were carried out in rural communities in Guinea-Bissau andJamaica, which are both vulnerable to climate change. Each experience, developedfrom a systemic perspective and under two frameworks (the water–food–energynexus and ‘Appropriate Technology’), is described in four phases (problemcharacterization, solution design, solution pre-evaluation, and implementation),with the significant findings made by the team in terms of challenges, rewards, andessential conditions for development. Both deal with environment-friendly solutionsthat solve the problems of water and energy provision. Based on complex thinking,the experiences are analyzed from the social inclusion, participation, empowerment,and learning theory viewpoints. Finally, the insights gained by the team arehighlighted: communication requirements, the level of dependency of industrializedsolutions, budget constraints, training, testing, and planning recommendations, thediversity of interaction with the communities, and partners’ skills. As a result, futureactions can exploit these experiences and contribute to the success of subsequentprojects.

Pereira Pinto, Joao↗

DOE OSTI2025

CMIP7 data request: impacts and adaptation priorities and opportunities

The Coupled Model Intercomparison Project Phase 7 (CMIP7) undertook an extensive process to gather community input and refine data requests related to impacts and adaptation applications of Earth System Model (ESM) outputs. The Impacts and Adaptation (I&A) Data Request Team worked with CMIP7 leadership to distribute an open solicitation across many communities that use climate model outputs requesting inputs for new and existing variables, the most applicable temporal characteristics, and groupings of variables that together allow for specific application opportunities. This input was then collated and translated into CMIP7 standard templates for inclusion in the broader data request, leading to 13 I&A data request opportunities, 60 variable groups and 539 unique variables sought by vulnerability, impacts, adaptation, and climate services user communities. Here, we describe these opportunities and variable groups, as well as new insights into how ESM groups can prioritize outputs that set off a chain of further analyses, ultimately informing decisions impacting society and natural systems. These include an emphasis on high-resolution outputs to allow further modeling of climate impacts at regional and local scales, improved representation of extreme weather events, enhanced accuracy of downscaling and bias-adjustment techniques, and support for more detailed assessments for decision-making in adaptation and mitigation strategies. There is also broad interest in more extensive provisioning of two-dimensional variables at the Earth's surface, prioritizing experiments that enhance our understanding of both the recent past and future scenarios, and providing outputs that allow further downscaling and bias adjustment. We emphasize that variable groups are the fundamental level at which to engage with the I&A data request, matching the scale of input and the way output provision enables specific I&A applications. Given resource constraints, we applaud CMIP7 efforts to foster strong engagement and communication between ESM groups and the I&A team to build consensus around prudent compromises in priority variables, temporal resolutions, simulation experiments, time subsets, and ensemble members.

Ruane, Alex C. [NASA Goddard Inst. for Space Studi↗

DOE OSTI2024

Finding MIDDLE Ground: Scalable and Secure Distributed Learning

Edge computing methods allow devices to efficiently train a high-performing, robust, and personalized model for predictive tasks. However, these methods succumb to privacy and scalability concerns such as adversarial data recovery and expensive model communication. Furthermore, edge computing methods unrealistically assume that all devices train an identical model. In practice, edge devices have varying computational and memory constraints which may not allow certain devices to have the space or speed to train a specific model. To overcome these issues, we propose MIDDLE: a model independent distributed learning algorithm which allows heterogeneous edge devices to assist each other’s training while communicating only non-sensitive information. MIDDLE unlocks the ability for edge devices, regardless of computational or memory constraints, to assist each other even with completely different model architectures. Furthermore, MIDDLE does not require model or gradient communication which greatly reduces communication size and time. We prove that MIDDLE attains the optimal convergence rate O(1/sqrt(TM)) of stochastic gradient descent for convex and non-convex smooth optimization (for total iterations T and batch size M). Finally, our experimental results demonstrate that MIDDLE (even in non-IID data settings) attains robust and high-performing models without model or gradient communication.

Bornstein, Marc I.↗

DOE OSTI2022

Hierarchical Model-Free Transactional Control of Building Loads to Support Grid Services

A transition from generation on demand to consumption on demand is one of the solutions to overcome the many limitations associated with the higher penetration of renewable energy sources. Such a transition, however, requires a considerable amount of load flexibility in the demand side. Demand response (DR) programs can reveal and utilize this demand flexibility by enabling the participation of a large number of grid-interactive efficient buildings (GEB). Existing approaches on DR require significant modelling or training efforts, are computationally expensive, and do not guarantee the satisfaction of end users. To address the aforementioned limitations, this software code considers a scalable hierarchical model-free transactional control approach that incorporates elements of virtual battery, game theory, and model-free control (MFC) mechanisms. The developed approach separates the control mechanism into upper and lower levels. The MFC modulates the flexible GEB in the lower level with guaranteed thermal comfort of end users in response to the optimal pricing and power signals determined in the upper layer using a Stackelberg game integrated with aggregate virtual battery constraints. Additionally, the usage of MFC necessitates less burdensome computational and communication requirements, thus, it is easily deployable even on small, embedded devices. This software code enables the use of residential and small-size commercial buildings to offer a potentially substantial source of ancillary grid services that are currently underutilized. A hierarchical, model-free transactive building control provides a smooth interface between the grid service requests of utilities and the reliable control required by participating buildings. Model-free control, which supports distributed control architecture, will be a more scalable solution that can be deployed in neighborhood-size systems as well as individual buildings. The proposed approach contributes to the body of knowledge on two main aspects. First, it couples the MFC with the game-theoretic control and proposes a scalable model-free transactive control approach. MFC does not require any modeling effort or model training for the various building loads. This is very beneficial since deriving an accurate model for every single unit participating in DR programs and obtaining all the parameters about the units (e.g., thermal coefficients, standby losses) are infeasible. Also, MFC is computationally efficient, easily deployable even on small, embedded devices, and can be implemented in real time. Second, it integrates the concept of virtual battery into DR via the Stackelberg game. The concept of virtual battery enables efficient coordination and aggregation of a large number of flexible GEB with guaranteed thermal comfort of end users.

Olama, Mohammed [Oak Ridge National Lab. (ORNL), O↗

DOE OSTI2021

PLANC: Parallel Low-rank Approximation with Nonnegativity Constraints

In this work, we consider the problem of low-rank approximation of massive dense nonnegative tensor data, for example, to discover latent patterns in video and imaging applications. As the size of data sets grows, single workstations are hitting bottlenecks in both computation time and available memory. We propose a distributed-memory parallel computing solution to handle massive data sets, loading the input data across the memories of multiple nodes, and performing efficient and scalable parallel algorithms to compute the low-rank approximation. We present a software package called Parallel Low-rank Approximation with Nonnegativity Constraints, which implements our solution and allows for extension in terms of data (dense or sparse, matrices or tensors of any order), algorithm (e.g., from multiplicative updating techniques to alternating direction method of multipliers), and architecture (we exploit GPUs to accelerate the computation in this work). We describe our parallel distributions and algorithms, which are careful to avoid unnecessary communication and computation, show how to extend the software to include new algorithms and/or constraints, and report efficiency and scalability results for both synthetic and real-world data sets.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Synchrophasor Data Anomaly Detection on Grid Edge by 5G Communication and Adjacent Compute

The fifth-generation mobile communication (5G) technology offers the opportunities to enhance the grid real-time monitoring. The 5G-enabled phasor measurement units (PMUs) features flexible positioning and cost-effective long-term maintenance, without constraints of fixing wire. This paper is the first to demonstrate the applicability of 5G in PMU communication, and the experiment was carried out at Verizon non-standalone testbed at Pacific Northwest National Laboratory (PNNL) Advanced Wireless Communication lab. The performance of 5G-enabled PMU communication setup is reviewed and discussed in this paper, and the paper presents a real-time dynamic linear model (DML) based synchrophasor data anomaly detection application. Last but not least, the practicability of implementing 5G for wide-area protection strategies is explored and discussed by analyzing the experimental results.

5G, Synchrophasor data, machine learning, anomaly ↗

DOE OSTI2024

Implementing One Sided Partitioned Communication in Open MPI

This report introduces partitioned communication, a new MPI 4.0 interface that enables early bird communication by overlapping communication and computation. By partitioning messages into smaller sub-messages, MPI can start partial data transfers early. Performance studies show that the RMA implementation outperforms the Persistent implementation, despite some constraints. This report details a new opt-in RMA implementation, offering a high-performance option for partitioned communication that imposes some additional limitations.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Quantum routing with teleportation

We study the problem of implementing arbitrary permutations of qubits under interaction constraints in quantum systems that allow for arbitrarily fast local operations and classical communication (LOCC). In particular, we show examples of speedups over swap-based and more general unitary routing methods by distributing entanglement and using LOCC to perform quantum teleportation. We further describe an example of an interaction graph for which teleportation gives a logarithmic speedup in the worst-case routing time over swap-based routing. We also study limits on the speedup afforded by quantum teleportation—showing an O ( N log N ) upper bound on the separation in routing time for any interaction graph—and give tighter bounds for some common classes of graphs. Published by the American Physical Society 2024

Devulapalli, Dhruv (ORCID:000000022612308X)↗

DOE OSTI2024

Chalcogenide phase-change material advances programmable terahertz metamaterials: a non-volatile perspective for reconfigurable intelligent surfaces

Terahertz (THz) waves have gained considerable attention in the rising 6G communication due to their large bandwidth. However, the cost and power consumption become the major constraints for the commercialization of 6G THz systems as the frequency increases. Reconfigurable intelligent surface (RIS) comprising active metasurfaces and digital controllers has been proposed for beamforming in the 6G multiple-input-multiple-output systems, showing good potential to suppress the system size, weight, and power consumption (SWaP). Currently, their controlling diodes can hardly work up to THz frequencies. Therefore, several active stimuli have been investigated as alternatives. Among them, chalcogenide phase-change material Ge 2 Sb 2 Te 5 (GST) addresses large modulation depth, picosecond switching speed, and non-volatile properties. Notably, the non-volatile GST may enable RIS systems with memory and low control power. This work briefly reviews the advances of GST-tuned THz metamaterials (MTMs), discusses the current obstacles to overcome, and gives a perspective of GST applications in the rising 6G communications.

6G↗

DOE OSTI2020

Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods

Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both internode communications and even moreso in intranode data motion. A new approach to address this limitation is to make use of data compression in the form of a compressed data array. Storing data in a compressed data array and converting to standard IEEE-754 types as needed during a computation can reduce the pressure on bandwidth and storage. However, repeated conversions (lossy compression and decompression) introduce additional approximation errors, which need to be shown to not significantly affect the simulation results. Here, we extend recent work that analyzed the error of a single use of compression and decompression of the ZFP compressed data array representation to the case of time-stepping and iterative schemes, where an advancement operator is repeatedly applied in addition to the conversions. We show that the accumulated error for iterative methods involving fixed-point and time evolving iterations is bounded under standard constraints. An upper bound is established on the number of additional iterations required for the convergence of stationary fixed-point iterations. An additional analysis of traditional forward and backward error of stationary iterative methods using ZFP compressed arrays is also presented. The results of several 1D, 2D, and 3D test problems are provided to demonstrate the correctness of the theoretical bounds.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Scrambling Signal Modularity in Bottom-up Assembled Synthetic Pseudomonas Consortia Reveals Robust Information Transfer

There is immense potential in crafting synthetic microbial communities for application in human health, agriculture, the environment, and even biomanufacturing where an appropriately constructed consortium can be assembled with tremendous biosynthetic or degradative capabilities. In many of these cases, bacterial signaling serves as a form of intercellular information transfer that guides the collective’s behavior. Such communication is complex, as many signals, signal disruptors, microbial species, physical barriers, and spatiotemporal constraints may be involved. Here, in this work, we demonstrate that a multisignal pathway for molecular information transfer within a consortium of several Pseudomonas spp. can be scrambled (genetically and organizationally) while the original message is still effectively conveyed. Assembled from the bottom up, we have employed two types of signaling molecules (i) a redox active secondary metabolite (rhizospheric signal, phloroglucinol), and (ii) a bacterial quorum sensing signal (3-oxo-C12 acylhomoserine lactone, AI-1). These signals can be intraconverted and acted upon by designated community members. We show how the order in which the signals are received, transduced, and subsequently transmitted can be rearranged with minimal impact on the intended outcome. In the consortial context, we found this messaging structure can be remarkably robust. Inspired by rhizospheric molecular signaling mechanisms, this work provides a conceptual framework for designing signaling and information transfer processes within assembled communities.

Biological and medical sciences↗