Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Outage Forecast-Based Preventative Scheduling Model for Distribution System Resilience Enhancement

Distribution system resilience enhancement is an important topic to ensure customers have access to power supply during extreme events. In fact, certain weather-related extreme events can be predicted ahead of time. Therefore, it is important to investigate how to predict grid outages using extreme weather forecasts, and how outage predictions can be incorporated into distribution system resilience enhancement. In this paper, a preventative scheduling model for distribution systems is proposed. The model targets at allocating resources, especially mobile responsive resources such as mobile backup generators and mobile energy storage systems, to prepare for an extreme event in the day-ahead context. To achieve efficient resource allocation and scheduling, a machine learning-based outage prediction module is developed to predict vulnerable or risky segments of the distribution system based on historical operating records and extreme weather event forecast. By integrating the outage prediction results into the scheduling model, optimal resource allocation can be derived to help distribution systems prepare for an upcoming event and improve resilience performance. A real distribution feeder in North Carolina, U.S. is used in the case study to validate the proposed approach.

distributed energy resources↗
DOE OSTI2025

Energy Scheduling-based Operating Envelopes including a Distribution System Branch Screening Algorithm

This paper presents an energy scheduling-based formulation for computing operating envelopes including a distribution branch screening algorithm, termed DBS-ES. The contribution of the paper is two-fold: firstly, it presents an innovative methodology for calculating operating envelopes using energy scheduling (baseline), and secondly, it enhances this methodology by incorporating a custom distribution branch screening algorithm (DBS-ES). The custom algorithm leverages power system knowledge to reduce both model build time and total processing time while maintaining the same scheduling results as the baseline. The effectiveness of the proposed approach is demonstrated through experiments on the IEEE13, IEEE123, and EPRI Secondary test feeders. Results highlight a 24.5% decrease in model build time and an 8.17% decrease in total processing time when using DBS-ES compared to the baseline, specifically for the IEEE123 test feeder. Additionally, the paper briefly discusses the influence of utility-controlled storage on computing operating envelopes, noting a general incre

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

QoS-aware edge AI placement and scheduling with multiple implementations in FaaS-based edge computing

Resource constraints on the computing continuum require that we make smart decisions for serving AI-based services at the network edge. AI-based services typically have multiple implementations (e.g., image classification implementations include SqueezeNet, DenseNet, and others) with varying trade-offs (e.g., latency and accuracy). The question then is how should AI-based services be placed across Function-as-a-Service (FaaS) based edge computing systems in order to maximize total Quality-of-Service (QoS). To address this question, we propose a problem that jointly aims to solve (i) edge AI service placement and (ii) request scheduling. These are done across two time-scales (one for placement and one for scheduling). Here we first cast the problem as an integer linear program. We then decompose the problem into separate placement and scheduling subproblems and prove that both are NP-hard. We then propose a novel placement algorithm that places services while considering device-to-device communication across edge clouds to offload requests to one another. Our results show that the proposed placement algorithm is able to outperform a state-of-the-art placement algorithm for AI-based services, and other baseline heuristics, with regard to maximizing total QoS. Additionally, we present a federated learning-based framework, FLIES, to predict the future incoming service requests and their QoS requirements. Our results also show that our FLIES algorithm is able to outperform a standard decentralized learning baseline for predicting incoming requests and show comparable predictive performance when compared to centralized training.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Control coordination in inverter‐based microgrids using AoI‐based 5G schedulers

Abstract A coordinated set point automatic adjustment with correction enabled (C‐SPAACE) framework that uses 5G communication for real‐time control coordination between inverter‐based resources (IBR) in microgrids is proposed. Utilising slicing capability, 5G offers low‐latency communication to C‐SPAACE under normal conditions. However, given the multitude of power grid use cases, a certain 5G slice for C‐SPAACE may have access only to limited radio spectrum resources, which if not managed well, greatly undermines the communication needs of C‐SPAACE framework. Thus, optimally scheduling the available spectrum resources among IBRs in a sliced 5G network‐based C‐SPAACE framework becomes a critical problem. To address this issue, the authors utilise a novel age of information (AoI) metric and designs an AoI‐based 5G scheduler to provide low‐latency communication to C‐SPAACE. Following this, a co‐simulation environment is designed using PSCAD/EMTDC and Python to simulate a microgrid supported by 5G communication. Time‐domain simulation case studies are performed using the proposed co‐simulation environment to evaluate the performance of C‐SPAACE using 5G with both AoI‐based and other baseline (non‐AoI) schedulers.

Choudhury, Biplav↗
DOE OSTI2020

Using OpenMP for HEP framework algorithm scheduling

The OpenMP standard is the primary mechanism used at high performance computing facilities to allow intra-process parallelization. In contrast, many HEP specific software packages (such as CMSSW, GaudiHive, and ROOT) make use of Intel’s Threading Building Blocks (TBB) library to accomplish the same goal. In these proceedings we will discuss our work to compare TBB and OpenMP when used for scheduling algorithms to be run by a HEP style data processing framework. This includes both scheduling of different interdependent algorithms to be run concurrently as well as scheduling concurrent work within one algorithm. As part of the discussion we present an overview of the OpenMP threading model. We also explain how we used OpenMP when creating a simplified HEP-like processing framework. Using that simplified framework, and a similar one written using TBB, we will present performance comparisons between TBB and different compiler versions of OpenMP.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Leveraging Pre-Built Catalogs and Object-Level Scheduling to Eliminate I/O Bottlenecks in HPC Environments

Modern High-Performance Computing (HPC) environments face mounting challenges due to the shift from large to small file datasets, along with an increasing number of users and parallelized applications. As HPC systems rely on Parallel File Systems (PFS), such as Lustre for data processing, performance bottlenecks stemming from Object Storage Target (OST) contention have become a significant concern. Existing solutions, such as LADS with its object-level scheduling approach, fall short in large-scale HPC environments due to their inability to effectively address metadata I/O bottlenecks and the growing number of I/O processes. This study highlights the pressing need for a comprehensive solution that tackles both OST contention and metadata I/O challenges in diverse HPC workloads. To address these challenges, we propose SwiftLoad, an object-level I/O scheduling framework that leverages a metadata catalog to enhance the performance and efficiency of parallel HPC utilities. The adoption of the metadata catalog mitigates the metadata I/O bottlenecks that commonly occur in HPC utilities, a challenge that is particularly pronounced in object-level I/O scheduling. SwiftLoad addresses OST contention and the uneven distribution of I/O processes across different OSTs through mathematical modeling and incorporates a Loader Configuration Module to regulate the number of I/O processes. Evaluated with two representative utilities—data deduplication profiling and data augmentation—SwiftLoad achieved performance improvements of up to 5.63x and 11.0x, respectively, on a production supercomputer.

HPC↗
DOE OSTI2025

Adaptive PID Gain Scheduling Control for Hydropower Turbine Using Neural CDE and Stochastic Distribution Shaping

This paper introduces a gain-scheduling PID controller design strategy for hydroturbine frequency control mode. This scheme first uses real data to learn the nonlinear dynamics of the hydroturbine using neural controlled differential equations and then perturbs the obtained nonlinear system at different equilibrium points, based on which a static output feedback adaptive dynamic programming algorithm is then used to optimize the PID gains for each equilibrium point. Moreover, a continuous-time version of stochastic distribution control is proposed to further fine-tune the optimized PID gains. Finally, the controller is obtained by implementing linear interpolation between the optimized PID control gains. The simulation results show that the proposed gain-scheduling PID controller can control a larger range of operation points compared with the given fixed PID controller and the baseline method. Compared with the given fixed PID controller, the proposed gain-scheduling PID controller can regulate hydroturbine frequency against disturbances induced by power-load variation with over 50% less overshoot for some operation points.

13 HYDRO ENERGY↗
DOE OSTI2022

MICCO: An Enhanced Multi-GPU Scheduling Framework for Many-Body Correlation Functions

Calculation of many-body correlation functions is one of the critical kernels utilized in many scientific computing areas, especially in Lattice Quantum Chromodynamics (Lattice QCD). It is formalized as a sum of a large number of contraction terms each of which can be represented by a graph consisting of vertices describing quarks inside a hadron node and edges designating quark propagations at specific time intervals. Due to its computation- and memory-intensive nature, real-world physics systems (e.g., multi-meson or multi-baryon systems) explored by Lattice QCD prefer to leverage multi-GPUs. Different from general graph processing, many-body correlation function calculations show two specific features: a large number of computation-/data-intensive kernels and frequently repeated appearances of original and intermediate data. The former results in expensive memory operations such as tensor movements and evictions. The latter offers data reuse opportunities to mitigate the data-intensive nature of many-body correlation function calculations. However, existing graph-based multi-GPU schedulers cannot capture these data-centric features, thus resulting in a sub-optimal performance for many-body correlation function calculations. To address this issue, this paper presents a multi-GPU scheduling framework, MICCO, to accelerate contractions for correlation functions particularly by taking the data dimension (e.g., data reuse and data eviction) into account. This work first performs a comprehensive study on the interplay of data reuse and load balance, and designs two new concepts: local reuse pattern and reuse bound to study the opportunity of achieving the optimal trade-off between them. Based on this study, MICCO proposes a heuristic scheduling algorithm and a machine-learning-based regression model to generate the optimal setting of reuse bounds. Specifically, MICCO is integrated into a real-world Lattice QCD system, Redstar, for the first time running on multiple GPUs. The evaluation demonstrates MICCO outperforms other state-of-art works, achieving up to 2.25× speedup in synthesized datasets, and 1.49× speedup in real-world correlation functions.

Wang, Qihan↗
DOE OSTI2024

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗
DOE OSTI2021

Secured Reserve Scheduling of Pumped-Storage Hydropower Plants in ISO Day-ahead Market

Due to the fast response ability and high ramping rates, pumped-storage hydropower (PSH) plants are playing an increasingly critical role in mitigating power generation fluctuations induced by the growing proliferation of renewable energy resources. However, because they are energy-limited resources, actual reserve deployment from PSHs would cause the deviation of state-of-charge (SOC) from the scheduled value, which, once accumulated over time, could induce potential violations on SOC limits and cause non-dispatchability of PSHs. In recognizing this potential issue, it can become important to securing the reserve schedule of PSHs and other energy limited resources preventively in the day-ahead market clearing. To ensure reserve dispatchability of PSHs despite SOC deviations, this paper proposes the reserve secure constraints, which are cast as a distributionally robust chance-constrained formulation by judiciously introducing random parameters to describe deployment ratios of scheduled regulation reserve from PSHs. Furthermore, these constraints are converted into tractable second-order cone constraints, and further approximated as linear constraints to be compatible with the current ISO day-ahead market clearing model. A modified IEEE 118-bus system with multiple PSHs is adopted to verify the proposed approach.

13 HYDRO ENERGY↗
DOE OSTI2021

Night shift schedule causes circadian dysregulation of DNA repair genes and elevated DNA damage in humans

Circadian disruption has been identified as a risk factor for health disorders such as obesity, cardiovascular disease, and cancer. Although epidemiological studies suggest an increased risk of various cancers associated with circadian misalignment due to night shift work, the underlying mechanisms have yet to be elucidated. Here, we sought to investigate the potential mechanistic role that circadian disruption of cancer hallmark pathway genes may play in the increased cancer risk in shift workers. In a controlled laboratory study, we investigated the circadian transcriptome of cancer hallmark pathway genes and associated biological pathways in circulating leukocytes obtained from healthy young adults during a 24‐hour constant routine protocol following 3 days of simulated day shift or night shift. The simulated night shift schedule significantly altered the normal circadian rhythmicity of genes involved in cancer hallmark pathways. A DNA repair pathway showed significant enrichment of rhythmic genes following the simulated day shift schedule, but not following the simulated night shift schedule. In functional assessments, we demonstrated that there was an increased sensitivity to both endogenous and exogenous sources of DNA damage after exposure to simulated night shift. Our results suggest that circadian dysregulation of DNA repair may increase DNA damage and potentiate elevated cancer risk in night shift workers.

circadian misalignment↗
DOE OSTI2025

Flexible Resource Scheduler for FAST-DERMS (FRS-FASTDERMS) v0.9

The Flexible Resource Scheduler is a hierarchical controller that manages the distributed energy resources in a distribution substation or distribution feeder to provide a firm commitment of power flow at the substation or feeder head to be scheduled in transmission-level markets as an aggregated demand resource. It is the reference controller for the FAST-DERMS Architecture, developed in tandem with the architecture under the DOE FAST-DERMS project. It is comprised of a day-ahead stochastic optimization, which schedules substation power flow and reserves, a intra-hour MPC, which generates dispatch base points for DER, and a real-time PID controller maintaining that dispatches DER to maintain the substation power around the base points. The repository also includes a representative aggregator controller, and all of the necessary components to run a simulation using PNNL's GridAPPS-D software with the controller.

MacDonald, Jason [Lawrence Berkeley National Labor↗
DOE OSTI2022

Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) for Transportation Hubs (Final Report)

This report summarizes the work performed under the award number EE0008524. The project develops the Multi-modal Energy-optimal Trip Scheduling in Real-time (METS-R) platform as the next-generation transportation solution based on autonomous electric vehicles (AEV) serving passenger trips from and to urban transportation hubs, to substantially reduce transportation energy consumption. Extensive data collection and analyses were first conducted to understand the demand patterns and energy consumption of hub-based on-road trips. Then, a data-driven framework that consists of an analytical module and a simulation module was proposed. For the analytical module, five planning + operation tools were developed to support the planning and energy-efficient operations of urban AEV services: the charging station planning that robotically allocates charging supplies based on the stationary charging demand distribution; the transit planning and demand adaptive scheduling model that efficiently generates\ candidate transit routes from hubs to other places and dynamically adjusts the transit time table to fit the current demand; the online energy-efficient routing that learns the energy-optimal paths from observations of link-level energy consumption in real-time; the hub-based ridesharing that matches trip requests together with account for the uncertainty of future trip demand and vehicle supply; and finally, the integrated demand prediction and anomaly detection pipeline that leverages the flight/train time table and support other planning/operation tools. To demonstrate the performance of these tools, a scalable high-performance agent-based simulator was built. We divided the urban space into multiple service zones where each zone was considered as an agent for passenger generation and vehicle charging. Two types of AEV agents were coded to model two types of mobility services: AEV taxi and AEV transit. For the AEV taxi, the team implemented the functions of pickup/drop-off passengers, energy-efficient routing, ridesharing, fleet rebalancing, and recharging. For the AEV bus, the team implemented the functions of demand-adaptive route scheduling, passenger boarding, and recharging. A high-performance computing framework was introduced to receive various profiling information (such as link energy updates, vehicle speed) from the simulator instances and communicate the operational commands back to the instances. The numerical experiments show that each of the proposed operational algorithms can reduce energy consumption and improve system efficiency. Furthermore, there exists the need to collectively consider multiple planning + operational strategies as multiple strategies can influence each other in terms of performance impacts. Recommendations for future work related to AEV planning and simulation are discussed.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Milestone Report: Co-Scheduling Applications on Current and Future Architectures

This report evaluates the viability and performance of co-scheduling scientific applications and workloads between CPUs and GPUs on current and future hardware architectures. This study was performed by collecting hardware independent and memory performance characteristics of 6 ECP mini-applications through Byfl and NSight Systems, by measuring the applications’ co-scheduled performance on current node architectures, and by gathering memory bandwidth utilization data with Intel Advisor and nvprof to begin reasoning about the feasibility of co-scheduling applications on future APU architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

DeepSurveySim: Simulation Software and Benchmark Challenges for Astronomical Observation Scheduling

Modern astronomical surveys have multiple competing scientific goals. Optimizing the observation schedule for these goals presents significant computational and theoretical challenges, and state-of-the-art methods rely on expensive human inspection of simulated telescope schedules. Automated methods, such as Reinforcement Learning (RL), have recently been explored to accelerate scheduling. DeepSurveySim provides methods for tracking and approximating sky conditions for a set of observations from a user-supplied telescope configuration.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

Scheduler Modeling of Distributed Energy Resources for Providing Ancillary Services

Distribution energy resources (DERs) have been integral components of modern power systems, and their capability to provide grid services has been widely studied. To promote the deployment of these resources in providing grid services in real-world utility operations, this paper proposes a day-ahead scheduler model for a distribution system connected DER plant. A certain amount of generation capacity of this DER plant is reserved for frequency services, and some ancillary services for the distribution system-including peak load reduction, voltage regulation, and power factor control-are integrated into the model. The model is tested on a real-world distribution system. From the simulation results, the energy and reserve schedule of the solar photovoltaic (PV) unit and battery energy storage system (BESS) can be determined, and voltage and power factor are well maintained. Additionally, in order to demonstrate the specific characteristics of the co-located and hybrid operation modes for the PV and BESS, these two modes are analyzed both theoretically and through real-time simulation. Simulation results show that most of PV's variability is transferred to the net power in the co-located mode, whereas it is transferred to the BESS in the hybrid mode. This proposed scheduler model and the comparison of co-located and hybrid modes can provide practical guidance for the applications of DER plant in the real-world utility.

14 SOLAR ENERGY↗
DOE OSTI2024

Adaptive Framework for Maintenance Scheduling Based on Dynamic Preventive Intervals and Remaining Useful Life Estimation

Data-based prognostic methods exploit sensor data to forecast the remaining useful life (RUL) of industrial settings to optimize the scheduling of maintenance actions. However, implementing sensors may not be cost-effective or practical for all components. Traditional preventive approaches are not based on sensor data; however, they schedule maintenance at equally spaced intervals, which is not a cost-effective approach since the distribution of the time between failures changes with the degradation state of other parts or changes in working conditions. This study introduces a novel framework comprising two maintenance scheduling strategies. In the absence of sensor data, we propose a novel dynamic preventive policy that adjusts intervention intervals based on the most recent failure data. When sensor data are available, a method for RUL prediction, designated k-LSTM-GFT, is enhanced to dynamically account for RUL prediction uncertainty. The results demonstrate that dynamic preventive maintenance can yield cost reductions of up to 51.8% compared to conventional approaches. The predictive approach optimizes the exploitation of RUL, achieving costs that are only 3–5% higher than the minimum cost achievable while ensuring the safety of critical systems since all of the failures are avoided.

Nunes, Pedro (ORCID:0000000180012172)↗
DOE OSTI2021

A Decision Support Framework for Grid-Aware Electric Bus Charge Scheduling

While there are many advantages to electric public transit vehicles, they also pose new challenges for fleet operators. One key challenge is defining a charge scheduling policy that minimizes operating costs and power grid disruptions while maintaining schedule adherence. An uncoordinated policy could result in some buses running out of charge before completing their trip, while a grid agnostic policy might incur higher energy costs or cause an adverse impact on the grid’s distribution system. We present a grid aware decision-theoretic framework for electric bus charge scheduling that accounts for energy price, grid load, and bus status. The framework connects environmental models for traffic (SUMO) and the electric grid (GridLAB-D) to a planner, which evaluates bus charging decisions with regard to their long-term effect on grid reliability and cost. The framework has been evaluated on a simulation of Richland, WA’s bus and grid network, and compared to greedy methods.

EV, machine leaning, EV-Grid, Transportation, Grid↗