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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Stochastic Continuous-time Flexibility Scheduling and Pricing in Wholesale Electricity Markets

Large-scale integration of intermittent renewable energy sources (RES) is calling for additional flexibility resources as well as more advanced modeling and optimization techniques to account for the increasing uncertainty and variability in power systems operation. As the RES integration gains momentum, the magnitude and frequency of their variations increase, which may trigger ramping scarcity events in real-time power systems operation. This necessitates revisiting the present definition of power systems flexibility and reserve services to reflect their robustness and adequacy towards sub-interval variations of the load and RES, as well as adjusting the operation models to accommodate the new reserve services. This project took a fundamental approach and aimed at developing continuous-time scheduling and pricing model that accurately models the continuous-time variations of load and RES and efficiently deploys the ramping capability of flexible resources to compensate the sources of variability and uncertainty in the market. In this regard, this project pursued the following goals: Developing stochastic multi-fidelity continuous-time optimization models for scheduling of energy storage (ES) systems and flexible loads in wholesale energy markets; Developing the theory and practices of continuous-time locational marginal pricing for valuating energy storage systems and flexible loads in wholesale energy markets; Developing function space solution approach to convert the proposed stochastic multi-fidelity continuous-time optimization models into tractable mixed-integer linear optimization models; and Defining flexibility reserve as a new type of reserve in markets that would enable ultimate participation of energy storage devices in provision of services to compensate the variability and uncertainty of RES in electricity markets. This project successfully completed all five major tasks defined in the SOPO, and produced 8 high-impact journal papers, 6 conference papers, 3 published U.S. patents, and one web-based software for continuous-time operation optimization of power systems. The application of the proposed flexibility reserve and the stochastic multi-fidelity continuous-time operation scheduling models would modify the forward commitment and schedule of generating units, ES devices and flexible loads, and would line up the resources in such a way that the composition of available resources is better prepared to respond to the sub-hourly variations of the load and renewable resources in real-time operation. Therefore, this project paves the way to sustainable, reliable, and economic integration of renewable energy resources in power system, supporting the progress towards reaching the national targets on energy independence. Even if the proposed models offers a radically different point of view as compared to existing models, it does not alter fundamentally the architecture of power systems operations, nor the complexity of the scheduling problem, so the integration of this project in power systems is extremely practical.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

On the Feasibility of Simulation-Driven Portfolio Scheduling for Cyberinfrastructure Runtime Systems

Runtime systems that automate the execution of applications on distributed cyberinfrastructures need to make scheduling decisions. Researchers have proposed many scheduling algorithms, but most of them are designed based on analytical models and assumptions that may not hold in practice. The literature is thus rife with algorithms that have been evaluated only within the scope of their underlying assumptions but whose practical effectiveness is unclear. It is thus difficult for developers to decide which algorithm to implement in their runtime systems.To obviate the above difficulty, we propose an approach by which the runtime system executes, throughout application execution, simulations of this very execution. Each simulation is for a different algorithm in a scheduling algorithm portfolio, and the best algorithm is selected based on simulation results. The main objective of this work is to evaluate the feasibility and potential merit of this portfolio scheduling approach, even in the presence of simulation inaccuracy, when compared to the traditional one-algorithm approach. We perform this evaluation via a case study in the context of scientific workflows. Our main finding is that portfolio scheduling can outperform the best one-algorithm approach even in the presence of relatively large simulation inaccuracies.

Casanova, Henri↗
DOE OSTI2026

Consumer safety-oriented scheduling of rotating power outages during heat waves

Extreme heat events have widespread effects on power systems, reducing available generation capacity, limiting transmission capabilities, and causing unusual demand patterns on the consumer side. As these combined effects expose bulk transmission systems to potential large-scale blackouts, utilities may be required to schedule and apply rotating outages, by temporarily and alternately disconnecting distribution substations to reduce overload. However, utilities lack mechanisms to inform these events, exacerbating the negative effects of heat waves on affected communities. This paper introduces a novel framework for scheduling rotating outages during heat waves while considering impacts on consumers’ safety. Instead of random sequential load shedding, we propose a methodology to rotate power outages considering a metric that quantifies the indoor overheating risk of groups of consumers during a power outage. The overheating risk is derived from a detailed building simulation using CityBES, where the buildings are modeled based on available data—use type, year built, floor area, number of stories, location—while presence of air conditioning and occupancy are calibrated from smart meter data. Based on the metric, an algorithm to schedule the rotating outages is applied to prioritize feeders for disconnection at each hour according to their overheating risk to meet a utility load reduction target. Applied to two substations and seven feeders in the Portland General Electric territory, the results show that this approach effectively leads to the lowest overheating risk during the resulting outage schedules, with an average 10.1% lower overheating compared to uninformed schedules.

Building thermal simulation↗
DOE OSTI2023

Computer-controlled finishing via dynamically constraint position-velocity-time scheduler

In a Computer Numerical Controlled (CNC) finishing process, the target material removal from an optical surface is guided by the convolution between the influence function of a machine tool and its dwell time at certain points over the surface. To reduce dynamics stressing and increase machining efficiency, the dwell time must be converted to varying velocities, which are the actual inputs to the machine tool controller. Conventionally, the conversion assumed constant acceleration and relied on linear motion interpolation, which caused discontinuities in velocities. This unsmooth motion affects the material removal distribution, and, thus, the accuracy of the finished surface shape. Many modern CNC machines support the smoother, cubic-polynomial interpolated Position-Velocity-Time (PVT) motion mode; however, the conventional scheduler may fail to provide suitable velocities for the PVT. Here in this study answers this challenge by proposing a novel PVT-based velocity scheduler that achieves smooth motion while considering CNC dynamic limits. Firstly, the principle of the PVT is explained, and the PVT-based velocity scheduler is formulated. Secondly, a quadratic programming is used to optimize the velocities by imposing the CNC dynamic constraints and the C 1 continuities (zeroth and first derivatives are continuous) simultaneously. Thirdly, the smoothness and accuracy of the scheduled velocities are studied on different kinds of tool paths via simulation. Finally, a sub-0.3 nm level surface finishing experiment using ion beam figuring is demonstrated to verify the feasibility of the proposed method. The PVT-based scheduler and simulator code is open-sourced.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Improving I/O-aware Workflow Scheduling via Data Flow Characterization and trade-off Analysis

The scientific computing paradigm has transitioned from compute-intensive to I/O-intensive and memory-intensive in the past decade, especially when data-driven science has become common practice. Numerous empirical I/O-aware scheduling optimizations have been developed by incorporating I/O capacity and bandwidth as constraints into scheduling. Unfortunately, there is a lack of data flow (I/O) characterization tool and an understanding of trade-offs between concurrency, locality, and I/O bandwidth. To bridge the gap, this work 1) presents a set of descriptors to characterize, organize, and visualize I/O profiles, including flow size, I/O bandwidth, and operation count, which group data flows by I/O types, tasks, and files; 2) proposes an I/O Roofline model-based trade-off analysis to find the optimal trade-off between flow operational intensity, concurrency, and flow performance. The I/O descriptors generate useful insights into complicated I/O behaviors, suggesting distinct concurrency, storage, and scheduling to be used by types, tasks, and files. The proposed trade-off analysis guides scheduling decisions that generate resource assignment with the best flow parallelism. We evaluate our I/O-aware scheduling methodology on a highly I/O-intensive workflow–1000 Genomes. The experimental results demonstrate speedups of up to 2.4× compared to the state-of-the- art methods.

Guo, Luanzheng [BATTELLE (PACIFIC NW LAB)]↗
DOE OSTI2021

A Non-cooperative Game-based Approach to Distributed Beam Scheduling in Millimeter-Wave Networks

We consider the distributed beam scheduling problem in mm-Wave networks where the base stations may belong to different operators and there is no centralized coordination among them. Our goal is to design distributed beam scheduling algorithms such that the network utility, which is defined as a logarithm function of the average throughput of the user equipment, can be maximized. We propose a non-cooperative game-based scheduling approach where the base stations are modeled as players that greedily maximize their own utilities. The Nash Equilibrium (NE) then provides a distributed solution to the network utility maximization problem. By employing the Lyapunov optimization, the asymptotic optimality of the proposed scheduling can be guaranteed. We prove the existence and provide sufficient conditions which guarantee the uniqueness of the NE by establishing an equivalence to the Variational Inequality (VI) problem. We also propose a parallel power adaptation algorithm which is proved to converge to the NE. Numerical results show the superiority of the proposed scheduling over several distributed baseline schemes.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2024

IRIS: Exploring Performance Scaling of the Intelligent Runtime System and its Dynamic Scheduling Policies

High-Performance Computing is becoming increasingly heterogeneous, relying on a diverse mix of hardware to achieve good performance. Paradoxically, current drivers and frameworks for these devices typically require separate languages and implementations for each vendor. Furthermore, there are few tools and little support to schedule codes between these devices in a truly heterogeneous manner-partly because of this fragmentation between vendors and the languages each supports. To overcome both limitations, the Intelligent Runtime System (IRIS) was developed. It allows a common task abstraction to automatically be shared among contemporary vendors and is run from a single host-side API. At runtime, IRIS queries the host system and registers which frameworks and drivers are available, these determine which kernels can be used by the scheduler-CPUs via OpenMP, Nvidia GPUs (CUDA), AMD GPUs (HIP), and Intel and Xilinx FPGAs with OpenCL. IRIS enables tasks to be scheduled to any heterogeneous device and resolves to the appropriate kernel binary at runtimeit only uses the devices supported by the system on which it is run. IRIS supports single-task and graph-based expressions of dependencies of tasks. Additionally, IRIS features a range of dynamic scheduling policies, allowing complex chains of tasks and interactions to be executed, relieving the programmer/user from considering the system to assign tasks to devices optimally. This paper presents the peak performance attainable by IRIS over a range of systems-each with different numbers and types of accelerator devices, it highlights the flexibility of IRIS since these devices are truly heterogeneous, relying on different backends (drivers, frameworks, and languages) which historically required unique implementations to utilize them. We then use this peak performance as a baseline to compare increasingly complex chains of tasks (with increasingly complex task dependencies) and evaluate how IRIS copes. Finally, we consider the performance of different IRIS scheduling policies on this range of task graphs.

Johnston, Beau↗
DOE OSTI2022

Secure mmWave Spectrum Sharing with Autonomous Beam Scheduling for 5G and Beyond

Spectrum Sharing (SS) has seen a renewed set of initiatives in 5G with the availability of shared and unlicensed spectrum bands that can be used by multiple cellular service providers and private cellular networks. Beam based transmission, instead of the traditional sector based transmission in conjunction with the spectrum agility of the 5G New Radio (NR) has brought new opportunities to optimized sharing of spectrum. Currently in the U.S., a centralized Spectrum Access Server (SAS) is used to co-ordinate spectrum sharing among networks sharing the same spectrum band. However, SAS becomes a focal point for security attacks and a performance bottleneck. In addition, SAS relies on an Environmental Sensor Network (ESN), separate from the 5G network. Without trusted spectral occupancy information, false reporting of spectrum sensing data can create sub-optimal and unfair spectrum usage. This paper summarizes our recent research findings in using a decentralized scheme for multiple networks to securely share spectrum with autonomous beam scheduling : 1) A new stochastic network framework based on Lyapunov Optimization approach is developed to optimize scheduling at the base stations; 2) Game theoretic (GT) approach is used to formulate the distributed scheduler; 3) Another distributed scheduler with Q-learning is presented that utilizes the Reinforcement Learning (RL) approach; 4) The performance and convergence rate of these distributed solutions to use shared and unlicensed spectrum are compared with existing solutions. Conditions under which the performance of these schedulers approach the theoretical upper bound, which is the performance possible with no interference among the operators sharing the spectrum, are presented; 5) The ability of a base station to use its own user equipment as sensors, for optimal spectrum sharing with base stations in other operator networks, is demonstrated to be an effective approach.

5G↗
DOE OSTI2022

Co-scheduling Ensembles of In Situ Workflows

Molecular dynamics (MD) simulations are widely used to study large-scale molecular systems. HPC systems are ideal platforms to run these studies, however, reaching the necessary simulation timescale to detect rare processes is challenging, even with modern supercomputers. To overcome the timescale limitation, the simulation of a long MD trajectory is replaced by multiple short-range simulations that are executed simultaneously in an ensemble of simulations. Analyses are usually co-scheduled with these simulations to efficiently process large volumes of data generated by the simulations at runtime, thanks to in situ techniques. Executing a workflow ensemble of simulations and their in situ analyses requires efficient co- scheduling strategies and sophisticated management of computational resources so that they are not slowing down each other. In this paper, we propose an efficient method to co-schedule simulations and in situ analyses such that the makespan of the workflow ensemble is minimized. We present a novel approach to allocate resources for a workflow ensemble under resource constraints by using a theoretical framework modeling the workflow ensemble’s execution. We evaluate the proposed approach using an accurate simulator based on the WRENCH simulation framework on various workflow ensemble configurations. Results demonstrate the significance of co-scheduling simulations and in situ analyses that couple data together to benefit from data locality, in which inefficient scheduling decisions can lead to slowdown in makespan up to a factor of 30.

Do, Tu Mai Anh↗
DOE OSTI2023

Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput

Undoubtedly, quantum computing offers valuable acceleration for solving intricate problems. One of the primary hurdles lies in executing large-scale quantum applications on backend machines. Qubit noise, among other factors, dramatically influences the execution process. Implementing effective scheduling techniques for quantum circuits is crucial for practical quantum computing and preventing excessive waiting times. The quantum realm is distinct from classical computing in terms of optimization, performance, utilization, and waiting periods. Consequently, the parameters and components of quantum circuit scheduling diverge from those of classical computing. This paper presents Quantum Noise Mitigation: Introducing the Robust Quantum Circuit Scheduler for Enhanced Fidelity and Throughput, a straightforward yet effective scheduling framework and policy that enhances noise resilience, throughput, and the fidelity of quantum circuits. Drawing inspiration from classical methods, our scheduling approach incorporates additional constraints tailored for quantum logic. The outcome demonstrates a substantial improvement in fidelity and resource management, which is vital for real-world quantum applications.

Baheri, Betis↗
DOE OSTI2025

Evaluating HPC Scheduling Strategies for Urgent Workloads

Scientific computing centers increasingly face workloads with diverse urgency requirements, driven by applications that demand rapid or even immediate execution. Appropriately configured scheduling policies can significantly improve both user satisfaction and overall cluster utilization. In this work, we present a systematic analysis of scheduler configurations under scenarios where a fraction of jobs have urgent computing needs. We evaluate multiple job scheduling simulators, develop a lightweight job-submission emulation framework, and create tools to analyze and visualize the resulting scheduling data. Our study identifies key trade-offs between responsiveness, fairness, and efficiency, and offers a set of practical scheduling configurations (particularly for Slurm) that can be tailored to HPC environments supporting mixed-urgency workloads.

Maheshwari, Ketan [ORNL] (ORCID:000000033800662X)↗
DOE OSTI2022

Spread spectrum scheduling requests for wireless communication resource

Apparatuses, systems and methods are disclosed for wireless communication. A base station may communicate with a plurality of user equipments (UEs) without allocating spectral resources to the UEs for communicating scheduling requests. The base station may detect a scheduling request from a requesting UE of the plurality of UEs. The scheduling request may include a spread spectrum signal based on a spreading sequence. The scheduling request may indicate an identity for a requesting UE without indicating information other than the identity. The base station may grant spectral resources to the requesting UE in response to detecting a scheduling request.

Moradi, Hussein↗
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, have recently been explored to accelerate scheduling. However, there do not yet exist benchmark data sets or user-friendly software frameworks for testing and comparing these methods. We present DeepSurveySim -- a high-fidelity and flexible simulation tool for use in telescope scheduling. DeepSurveySim provides methods for tracking and approximating sky conditions for a set of observations from a user-supplied telescope configuration. We envision this tool being used to produce benchmark data sets and for evaluating the efficacy of ground-based telescope scheduling algorithms, particularly for machine learning algorithms that would suffer in efficacy if limited to real data for training.We introduce three example survey configurations and related code implementations as benchmark problems that can be simulated with DeepSurveySim.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2023

Stochastic scheduling for commercial building cooling systems: considering uncertainty in zone temperature prediction

Here, this paper presents the first attempt to address the uncertainty in zone temperature prediction with stochastic optimization. The uncertain zone temperature is a process uncertainty and has not been considered in the existing stochastic optimization for building control. To fill this gap, we proposed a novel formulation of stochastic optimization to handle process uncertainty in building control. Specifically, we first examined the accuracy of a typical linear model for predicting zone temperature. We then formulated the scheduling of the building cooling system as a stochastic optimization problem over a 24-hour look-ahead period to minimize the electricity cost of the studied building cooling system. After that, we applied the proposed stochastic load scheduling (SLS) to a direct expansion (DX) cooling system that serves a medium office building. Through simulation with a detailed building energy simulation software, EnergyPlus, we evaluated the operational cost and the thermal comfort compared with a deterministic load scheduling. The operation cost of scheduling was found to vary with the level of zone temperature prediction uncertainty. The proposed SLS can mitigate the impacts of uncertain zone temperature predictions on both operational cost and thermal comfort. The evaluation results indicate that the proposed SLS works better when the uncertainty level is more significant.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Data-driven optimization of mixed-integer bi-level multi-follower integrated planning and scheduling problems under demand uncertainty

The coordination of interconnected elements across the different layers of the supply chain is essential for all industrial processes and the key to optimal decision-making. Yet, the modeling and optimization of such interdependent systems are still burdensome. Here we address the simultaneous modeling and optimization of medium-term planning and short-term scheduling problems under demand uncertainty using mixed-integer bi-level multi-follower programming and data-driven optimization. Bi-level multi-follower programs model the natural hierarchy between different layers of supply chain management holistically, while scenario analysis and data-driven optimization allow us to retrieve the guaranteed feasible solutions of the integrated formulation under various demand considerations. We address the data-driven optimization of this challenging class of problems using the DOMINO framework, which was initially developed to solve single-leader single-follower bi-level optimization problems to guaranteed feasibility. This framework is extended to solve single-leader multi-follower stochastic formulations and its performance is characterized by well-known single and multi-product process scheduling case studies. Through our data-driven algorithmic approach, we present guaranteed feasible solutions to linear and nonlinear mixed-integer bi-level formulations of simultaneous planning and scheduling problems and further characterize the effects of the scheduling level complexity on the solution performance, which spans over several hundred continuous and binary variables, and thousands of constraints.

42 ENGINEERING↗
DOE OSTI2021

Cluster analysis of occupancy schedules in residential buildings in the United States

The energy performance of residential buildings significantly depends on the building occupants’ behavior, which can be highly variable. When the heating, ventilation and air conditioning (HVAC) system is controlled based on the presence or absence of occupants in a building, occupant behavior is of even further importance to its energy performance. In current practice, building energy simulation tools generally use a single occupancy profile to represent the building’s occupancy schedule, the schedule of which is considered to be the same, regardless of the type of household being modeled. Thus, there is significant potential for improvement to allow for more flexibility and accuracy in calculation of occupancy. The objective of this study is to assess the variations in the typical types of occupancy schedules followed by the U.S. population using cluster analysis. American Time Use Survey data, which statically represents the overall U.S. population’s activities, across 12 years (2006–2017), is used. The ATUS data is segregated into smaller groups based on age and weekday/weekend, then divided into activities that are considered “at home” and “away from home”, which are mapped to the presence or non-presence of occupants in the home. Cluster analysis is then used to identify common types of occupancy schedule patterns for each age group. Three main types of patterns are obtained from cluster analysis for each age group, which together represent approximately 88% of people in the United States. The output of the cluster analysis is further analyzed to evaluate the variation in characteristics, including the number of times leaving home, time of day when leaving the home, and the timespan of absence from the home. The results of this study provide detailed insights on how typical occupants in the United States spend their time in residential spaces which can be used to create occupancy profiles for residential buildings. Finally, these occupancy profiles could be utilized inform an assessment of the energy use impact of occupancy-based controls of energy consuming systems and technologies.

42 ENGINEERING↗
DOE OSTI2023

Development of window scheduler algorithm exploiting natural ventilation and thermal mass for building energy simulation and smart home controls

Building energy simulations often rely on abstract assumptions when it comes to natural ventilation, such as ‘windows always open [or closed]’ or ‘windows open when outdoor temperature is below a certain threshold.’ However, simulations based on these assumptions fail to fully exploit the cooling potential of natural ventilation, as its effectiveness can be enhanced or diminished by various factors, including the presence of thermal mass. This issue also extends to smart home controls, where determining the window schedule becomes challenging without information about the building's response to outdoor conditions. To address these issues, this study has developed an analytical model for window operation schedules that leverages the passive cooling from natural ventilation. The analytical model was validated against a Modelica simulation. A case study utilizing the BESTEST model of ANSI/ASHRAE Standard 140 underwent validation with EnergyPlus simulations, showing strong concordance. The algorithm provides window schedule recommendations adapted to various airflow rates, thermal masses, and climate variations. Notably, the case study demonstrated that proper window scheduling could reduce indoor temperature by up to 8 °C under the given simulation settings, thereby improving resilience and indicating potential energy savings. Furthermore, the paper explores the potential opportunities and challenges this approach presents, especially for building simulation and smart home applications.

42 ENGINEERING↗
DOE OSTI2022

A Non-Cooperative Game-Based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

Here, this paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

42 ENGINEERING↗