Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic scheduling”

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

Characterizing the Response of Commercial and Industrial Facilities to Dynamic Pricing Signals from the Utility

We describe a method to generate statistical models of electricity demand from Commercial and Industrial (C&I) facilities including their response to dynamic pricing signals. Models are built with historical electricity demand data. A facility model is the sum of a baseline demand model and a residual demand model; the latter quantifies deviations from the baseline model due to dynamic pricing signals from the utility. Three regression-based baseline computation methods were developed and analyzed. All methods performed similarly. To understand the diversity of facility responses to dynamic pricing signals, we have characterized the response of 44 C&I facilities participating in a Demand Response (DR) program using dynamic pricing in California (Pacific Gas and Electric's Critical Peak Pricing Program). In most cases, facilities shed load during DR events but there is significant heterogeneity in facility responses. Modeling facility response to dynamic price signals is beneficial to the Independent System Operator for scheduling supply to meet demand, to the utility for improving dynamic pricing programs, and to the customer for minimizing energy costs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Koopman-based Differentiable Predictive Control for the Dynamics-Aware Economic Dispatch Problem

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, the incorporation of differential equations that govern the system dynamics makes DED an optimization problem that is computationally prohibitive to solve. In this work, we present a new data-driven approach based on differentiable programming to efficiently obtain offline parametric solutions to the underlying DED problem. In particular, we employ the recently proposed differentiable predictive control (DPC) for offline learning of explicit neural control policies based on identified Koopman operator (KO) model of the system dynamics. We demonstrate the high solution quality and five orders of magnitude computational-time savings of the DPC method over the original optimization-based DED approach on a 9-bus test power grid network.

King, Ethan↗

Solving the Dynamics-Aware Economic Dispatch Problem with the Koopman Operator

The dynamics-aware economic dispatch (DED) problem embeds low-level generator dynamics and operational constraints to enable near real-time scheduling of generation units in a power network. DED produces a more dynamic supervisory control policy than traditional economic dispatch (T-ED) that reduces overall generation costs. However, in contrast to T-ED, DED is a nonlinear, non-convex optimization problem that is computationally prohibitive to solve. We introduce a machine learning-based operator-theoretic approach for solving the DED problem efficiently. Specifically, we develop a novel discrete-time Koopman Operator (KO) formulation that embeds domain information into the structure of the KO to learn high-fidelity approximations of the generator dynamics. Using the KO approximation, the DED problem can be reformulated as a computationally tractable linear program (abbreviated DED-KO). We demonstrate the high solution quality and computational-time savings of the DED-KO model over the original DED formulation on a 9-bus test system.

King, Ethan↗

EJFAT: Towards Intelligent Compute Destination Load Balancing

To handle increased data flow, Jefferson Lab (JLab) is partnering with ESnet for development of an AI/ML directed compute work Load Balancer (LB) of UDP streamed data. The LB is FPGA based featuring dynamically configurable, low latency and high throughput destination address switching. The LB provides integration of edge and core computing to support JLab experimental programs, the Electron-Ion Collider, as well as data centers of the future. In the ESnet/JLab FPGA Accelerated Transport (EJFAT) initiative, the function of the LB Data Plane (DP) is to redirect data streams to selectable (but unknown to sender) destination hosts based on current worload and within that host to destination ports as a function of sub- stream id. This effects hierarchical scaling, first across compute machines for processing over a series of events and second, across ports so different data source sub-streams may be assigned to different processors for further parallelization. The LB Control Plane (CP) programs the DP using compute farm telemetry to direct and balance workloads across a compute cluster as the operating conditions require. While Proportional/Integrative/Derivative (PID) controllers are often seen in similar applications, here we investigate the feasibility of a Reinforcement Learning (RL) based schedule manager running in the CP to provide dynamic updates to the DP scheduling policy.

Lawrence, David↗

Uncertainty-based Estimation of the Secure Range for ISO New England Dynamic Interchange Adjustment

The paper proposes an approach to estimate the secure range for dynamic interchange adjustment, which assists system operators in scheduling the interchange with neighboring control areas. Uncertainties associated with various sources are incorporated. The proposed method is implemented in the dynamic interchange adjustment (DINA) tool developed by Pacific Northwest National Laboratory (PNNL) for ISO New England. Simulation results are used to validate the effectiveness of the proposed method.

forecast errors↗

Shared automated vehicle fleet operations for first-mile last-mile transit connections with dynamic pooling

Shared automated vehicles (SAVs) have the potential to promote transit ridership by providing efficient first-mile last-mile (FMLM) connections through reduced operational costs to fleet providers and lower out-of-pocket costs to riders. To help plan for a future of integrated mobility, this paper investigates the impacts of SAVs serving FMLM connections, as a mode that provides flexibility in access/egress decisions and is well coordinated with train station schedules. To achieve this objective, a novel dynamic pooling algorithm was introduced to match SAVs with riders while coordinating the riders' arrival times at the light-rail station to a known train schedule. Microsimulations of SAVs and travelers throughout two central Austin neighborhoods show how larger service areas, higher levels of SAV demand, and longer arrival times between successive trains require larger SAV fleet sizes and higher SAV utilization rates to deliver close traveler wait times. Four-person SAVs appear to perform similar to 6-seat SAVs but will cost less to provide. Using a dynamic pooling algorithm tightly coordinated with train arrivals (every 15 min) delivers 87% of travelers to their stations in time to catch the next train, whereas uncoordinated assignments deliver just 58% of travelers in time.

33 ADVANCED PROPULSION SYSTEMS↗

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Machine learning-enhanced MPC for demand flexibility in small commercial buildings: An experimental study

Small- and medium-sized commercial buildings (SMCBs) represent the majority of U.S. commercial building stock and a significant share of peak electricity demand, yet they often lack centralized building automation systems, representing a significant untapped resource for urban energy management. This infrastructure gap makes advanced control implementation challenging, limiting the potential for widespread demand flexibility. Model Predictive Control (MPC) has shown strong potential for load shifting, peak demand reduction, and cost savings, but its effectiveness is hindered by unmeasured disturbances such as internal heat gains. This paper presents a Hybrid MPC framework that integrates a physics-based gray-box building thermal model, identified using a lumped disturbance (LD) approach, with a machine learning (ML) model for forecasting unmeasured disturbances. The hybrid approach is designed for buildings with multiple individually controlled heat pump and thermostat pairs, common in SMCBs, and aims to optimize coordinated scheduling of multiple heat pumps under dynamic electricity pricing while respecting comfort constraints. The methodology is validated through both simulations of case study buildings and experimental studies at a highly-instrumented test facility. Simulation results show that the Hybrid MPC achieves substantial load shifting and peak demand reduction, approaching the performance of an ideal MPC with perfect disturbance knowledge, and outperforming a conventional MPC without disturbance forecasting. In experiments, the Hybrid MPC reduced daily HVAC energy costs by 8.7%, peak-price time load (load shifting) by 41.7%, and peak demand by 29.2% compared to baseline control, demonstrating comparable benefits to the 11.6% cost savings, 42.9% load shifting, and 23.2% peak reduction of the ideal MPC. These results demonstrate that the proposed hybrid modeling approach can significantly improve MPC performance in real-world SMCB applications without requiring additional disturbance measurements.

Demand Flexibility↗

Deadlock prediction via generalized dependency

Deadlocks are notorious bugs in multithreaded programs, causing serious reliability issues. However, they are difficult to be fully expunged before deployment, as their appearances typically depend on specific inputs and thread schedules, which require the assistance of dynamic tools. However, existing deadlock detection tools mainly focus on locks, but cannot detect deadlocks related to condition variables. This paper presents a novel approach to fill this gap. It extends the classic lock dependency to generalized dependency by abstracting the signal for the condition variable as a special resource so that communication deadlocks can be modeled as hold-and-wait cycles as well. It further designs multiple practical mechanisms to record and analyze generalized dependencies. In the end, this paper presents the implementation of the tool, called UnHang. Experimental results on real applications show that UnHang is able to find all known deadlocks and uncover two new deadlocks. Overall, UnHang only imposes around 3% performance overhead and 8% memory overhead, making it a practical tool for the deployment environment.

Zhou, Jinpeng↗

XPRESS: eXascale PRogramming Environment and System Software

The XPRESS Project is one of four major projects of the DOE Office of Science Advanced Scientific Computing Research X-stack Program initiated in September, 2012. The purpose of XPRESS is to devise an innovative system software stack to enable practical and useful exascale computing around the end of the decade with near-term contributions to efficient and scalable operation of trans-Petaflops performance systems in the next two to three years; both for DOE mission-critical applications. To this end, XPRESS directly addresses critical challenges in computing of efficiency, scalability, and programmability through introspective methods of dynamic adaptive resource management and task scheduling.

97 MATHEMATICS AND COMPUTING↗

Load Balancing for Multiphysics. In: AIAA 2013-2856,

Coupled Multi-Physics simulations, such as hybrid CFD-MD simulations, represent an increasingly important class of scientific applications. Often the physical problems of interest demand the use of high-end computers, such as TeraGrid resources, which are often accessible only via batch-queues. Batch-queue systems are not developed to natively support the coordinated scheduling of jobs – which in turn is required to support the concurrent execution required by coupled multi-physics simulations. In this paper we develop and demonstrate a novel approach to overcome the lack of native support for coordinated job submission requirement associated with coupled runs. We establish the performance advantages arising from our solution, which is a generalization of the Pilot-Job concept – which in of itself is not new, but is being applied to coupled simulations for the first time. Our solution not only overcomes the initial co-scheduling problem, but also provides a dynamic resource allocation mechanism. Support for such dynamic resources is critical for a load balancing mechanism, which we develop and demonstrate to be effective at reducing the total time-to-solution of the problem. We establish that the performance advantage of using Big Jobs is invariant with the size of the machine as well as the size of the physical model under investigation. The Pilot-Job abstraction is developed using SAGA, which provides an infrastructure agnostic implementation, and which can seamlessly execute and utilize distributed resources.

Lohner, Rainald↗

Active workflow system for near real-time extreme-scale science. In: PPAA '14 Proceedings of the first workshop on Parallel programming for analytics applications

In recent years, streaming-based data processing has been gaining substantial traction for dealing with overwhelming data generated by real-time applications, from both enterprise sources and scientific computing. In this work, however, we look at an emerging class of scientific data with Near Real-Time (NRT) requirement, in which data is typically generated in a bursty fashion with the near real-time constraints being applied primarily between bursts, rather than within a stream. A key challenge for this types of data sources is that the processing time per data element is not uniform, and not always feasible to predict. Given the observations on the increasing unpredictability of compute load and system dynamics, this work looks to adapt streaming-based approach to the context of this new class of large experiments and simulations that have complex run-time control and analysis issues. In particular, we deploy a novel two-tier scheme for handling the increasing unpredictability of runtime behaviors: Instead of relying on determining what and where to run the scientific workflows beforehand or partial dynamically, the decision will also be adaptively enhanced online according to system runtime status. This is enabled by embedding workflow along with data streams. Specifically, we break data outputs generated from experiments or simulations into multiple self-describing "chunks", which we call active data objects. As such, if there is a transient hotspot observed, a data object with unfinished workflow pipeline can break its previous schedule and search for a least loaded location to continue the execution. Our preliminary experiment results based on synthetic workloads demonstrate the proposed active workflow system as a very promising solution by outperforming the state-of-the-art semi-dynamic workflow schedulers with an improved workflow completion time, as well as a good scalability.

Zhang, Yanwei↗

A New Distributed Optimization for Community Microgrids Scheduling

This paper proposes a distributed optimization model for community microgrids considering the building thermal dynamics and customer comfort preference. The microgrid central controller (MCC) minimizes the total cost of operating the community microgrid, including fuel cost, purchasing cost, battery degradation cost and voluntary load shedding cost based on the customers' consumption, while the building energy management systems (BEMS) minimize their electricity bills as well as the cost associated with customer discomfort due to room temperature deviation from the set point. The BEMSs and the MCC exchange information on energy consumption and prices. When the optimization converges, the distributed generation scheduling, energy storage charging/discharging and customers' consumption as well as the energy prices are determined. In particular, we integrate the detailed thermal dynamic characteristics of buildings into the proposed model. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of proposed model.

alternating direction method of multipliers (ADMM)↗

Dynamic advance reservation with delayed allocation

A method of scheduling data transmissions from a source to a destination, includes the steps of: providing a communication system having a number of channels and a number of paths, each of the channels having a plurality of designated time slots; receiving two or more data transmission requests; provisioning the transmission of the data; receiving data corresponding to at least one of the two or more data transmission requests; waiting until an earliest requested start time T.sub.s; allocating at the current time each of the two or more data transmission requests; transmitting the data; and repeating the steps of waiting, allocating, and transmitting until each of the two or more data transmission requests that have been provisioned for a transmission of data is satisfied. A system to perform the method of scheduling data transmissions is also described.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Task Based Approach for Co-Scheduling Ensemble Workloads on Heterogeneous Nodes

Scientific workflows consist of multiple, connected applications, with data and results flowing from one to another in a pipeline. Traditionally, such workflows are executed in sequential order, storing intermediate data in storage disks. Co-scheduling application workflows concurrently on the same compute nodes would greatly reduce the cost of moving data to/from storage and allow real-time analysis of intermediate results. Nevertheless, most parallel programming runtimes do not allow seamless integration of various applications in a scientific workflow, in part due to the complexity of managing data and resources. The situation is even more complicated for heterogeneous systems. In this work we extend the Minos Computing Library (MCL) runtime to accelerate pipe-lined and parallel workloads where multiple applications are running in the same system. MCL’s asynchronous task library and runtime dynamically manages resources to allow co-scheduling of multiple processes sharing heterogeneous resources. In addition, we design a custom ex- tension of the Open Compute Language (OpenCL) to enable multiple processes to share device memory. We enable MCL to coordinate these shared buffers to allow for easy, fast data sharing between applications. Using malleable micro-benchmarks and two application workflows that combine scientific simulation and AI-based analysis, we show that our method outperforms traditional approaches.

Index Terms—Parallel systems, Scheduling and Task ↗

Dynamic Workflows for Routine Materials Discovery in Surface Science

The rising application of informatics and data science tools for studying inorganic crystals and small molecules has revolutionized approaches to materials discovery and driven the development of accurate machine learning structure/property relationships. In this paper, we discuss how informatics tools can accelerate research, and we present various combinations of workflows, databases, and surrogate models in the literature. This paradigm has been slower to infiltrate the catalysis community due to larger configuration spaces, difficulty in describing necessary calculations, and thermodynamic/kinetic quantities that require many interdependent calculations. We present our own informatics tool that uses dynamic dependency graphs to share, organize, and schedule calculations to enable new, flexible research workflows in surface science. This approach is illustrated for the large-scale screening of intermetallic surfaces for electrochemical catalyst activity. Similar approaches will be important to bring the benefits of informatics and data science to surface science research. Lastly, we provide our perspective on when to use these tools and considerations when creating them.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

ALTRIOS (Advanced Locomotive Technology and Rail Infrastructure Optimization System) [SWR-22-54]

The Advanced Locomotive Technology and Rail Infrastructure Optimization System (ALTRIOS) is a unique, fully integrated, open-source software tool to evaluate strategies for deploying advanced locomotive technologies and associated infrastructure for cost-effective decarbonization. ALTRIOS simulates freight-demand driven train scheduling, mainline meet-pass planning, locomotive dynamics, train dynamics, energy conversion efficiencies, and energy storage dynamics of line-haul train operations. Because new locomotives represent a significant long-term capital investment and new technologies must be thoroughly demonstrated before deployment, this tool provides guidance on the risk/reward tradeoffs of different technology rollout strategies. An open, integrated simulation tool is invaluable for identifying future research needs and making decisions on technology development, routes, and train selection. ALTRIOS was developed as part of a collaborative effort by a team comprising the National Renewable Energy Laboratory (NREL), University of Illinois Urbana-Champaign (UIUC), Southwest Research Institute (SwRI), and BNSF Railway. Python Package: https://pypi.org/project/altrios/ Rust Crate: https://crates.io/crates/altrios-core

Baker, Chad↗