Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduler”

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

Three practical workflow schedulers for easy maximum parallelism

Runtime scheduling and workflow systems are an increasingly popular algorithmic component in HPC because they allow full system utilization with relaxed synchronization requirements. There are so many special-purpose tools for task scheduling, one might wonder why more are needed. Use cases seen on the Summit supercomputer needed better integration with MPI and greater flexibility in job launch configurations. Preparation, execution, and analysis of computational chemistry simulations at the scale of tens of thousands of processors revealed three distinct workflow patterns. A separate job scheduler was implemented for each one using extremely simple and robust designs: file-based, task-list based, and bulk-synchronous. Comparing to existing methods shows unique benefits of this work, including simplicity of design, suitability for HPC centers, short startup time, and well-understood per-task overhead. All three new tools have been shown to scale to full utilization of Summit, and have been made publicly available with tests and documentation. This work presents a complete characterization of the minimum effective task granularity for efficient scheduler usage scenarios. Here, these schedulers have the same bottlenecks, and hence similar task granularities as those reported for existing tools following comparable paradigms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An exploration of online-simulation-driven portfolio scheduling in Workflow Management Systems

Workflow Management Systems used to automate the execution of scientific workflow applications on parallel and distributed computing platforms must make scheduling decisions at runtime. A large number of workflow scheduling algorithms have been proposed in the literature, but often these algorithms are evaluated based on simplifying assumptions that may not hold in practice. Furthermore, published algorithm evaluation and/or comparison results are necessarily only for a subset of all possible scenarios, and thus may not include scenarios relevant to particular use-cases. Consequently, it is difficult for Workflow Management Systems (WMSs) developers to decide which scheduling algorithm should be implemented. To obviate this difficulty, one possible approach is to implement a portfolio of scheduling algorithms and select the most effective algorithm at runtime. One method for performing this selection is to run an online simulation for each algorithm in the portfolio. The algorithm that leads to the best performance, in simulation, is selected for future use. The above simulation-driven portfolio scheduling (SDPS) approach has been proposed in a few parallel and distributed computing contexts. The main objective of this work is to evaluate the feasibility and potential merit of SDPS if implemented in WMSs. Here we perform this evaluation using simulated WMS executions, where the simulations are instantiated from real-world platform and workflow configurations. Our main finding is that SDPS is on par with or outperforms an approach in which a single algorithm is used, where this algorithm is the one that performs best on average across all our experimental scenarios. Furthermore, we find that SDPS remains an attractive proposition even in the presence of high levels of simulation error and for simulators with relatively low levels of sophistication. In many of our experimental scenarios we find that mitigating simulation error at runtime can further improve performance. Finally, we show that simulation overhead can be made sufficiently low for SDPS to be feasible in practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Integrated charging infrastructure planning and charging scheduling for battery electric bus systems

We report studies on the electric bus system planning problem have typically focused exclusively on either the deployment of charging infrastructure or the scheduling of charging events; few have examined the impact of charging facility deployment on charging activities. Considering the interdependence of system design and operational strategies, this study proposes a two-phase optimization framework for charging infrastructure planning and charging scheduling for battery electric bus systems. An integrated optimization model is first developed to simultaneously optimize charger deployment, on-board battery capacity, and charging schedules. A charging scheduling model is further proposed and a rolling horizon approach is utilized in the second phase to optimize the real-time charging scheduling of electric buses. Compared to existing electric bus system planning methods, the proposed integrated model can reduce the total system cost by 19.5%. In addition, compared to uncontrolled charging, the proposed rolling horizon-based charging strategy can reduce the total charging cost by 68.3%.

25 ENERGY STORAGE↗
DOE OSTI2023

Hydropower Scheduling Toolchains: Comparing Experiences in Brazil, Norway, and USA and Implications for Synergistic Research

While hydropower scheduling is a well-defined problem, there are institutional differences that need to be identified to promote constructive and synergistic research. We study how established toolchains of computer models are organized to assist operational hydropower scheduling in Brazil, Norway, and the United States’ Colorado River System (CRS). These three systems have vast hydropower resources, with numerous, geographically widespread, and complex reservoir systems. Although the underlying objective of hydropower scheduling is essentially the same, the systems are operated in different market contexts and with different alternative uses of water, where the stakeholders’ objectives clearly differ. This in turn leads to different approaches when it comes to the scope, organization, and use of models for operational hydropower scheduling and the information flow between the models. Here, we describe these hydropower scheduling toolchains, identify the similarities and differences, and shed light on the original ideas that motivated their creation. We then discuss the need to improve and extend the current toolchains and the opportunities to synergistic research that embrace those contextual differences.

13 HYDRO ENERGY↗
DOE OSTI2025

Link Scheduling in Satellite Networks via Machine Learning Over Riemannian Manifolds

Low Earth Orbit (LEO) satellites play a crucial role in enhancing global connectivity, serving a complementary solution to existing terrestrial systems. In wireless networks, scheduling is a vital process that allocates time-frequency resources to users for interference management. However, LEO satellite networks face significant challenges in scheduling their links towards ground users due to the satellites’ mobility and overlapping coverage. This paper addresses the dynamic link scheduling problem in LEO satellite networks by considering spatio-temporal correlations introduced by the satellites’ movements. The first step in the proposed solution involves modeling the network over Riemannian manifolds, thanks to their representation as symmetric positive definite matrices. We introduce two machine learning (ML)-based link scheduling techniques that model the dynamic evolution of satellite positions and link conditions over time and space. To accurately predict satellite link states, we present a recurrent neural network (RNN) over Riemannian manifolds, which captures spatio-temporal characteristics over time. Furthermore, we introduce a separate model, the convolutional neural network (CNN) over Riemannian manifolds, which captures geometric relationships between satellites and users by extracting spatial features from the network topology across all links. Simulation results demonstrate that both RNN and CNN over Riemannian manifolds deliver comparable performance to the fractional programming-based link scheduling (FPLinQ) benchmark. Remarkably, unlike other ML-based models that require extensive training data, both models only need 30 training samples to achieve over 99% of the sum rate while maintaining similar computational complexity relative to the benchmark.

42 ENGINEERING↗
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 OSTI2020

Multi-Timescale Integrated Dynamic and Scheduling Model (MIDAS-Solar)

Solar photovoltaic (PV) installations have experienced unprecedented growth in the United States. PV will become not only an energy producer but also a necessary provider of ancillary services at multiple timescales. Conventional methods to simulate power system operations - such as long-term production simulation (which typically considers schedules from hours to minutes by using an optimization framework) and short-term transient studies (which simulate dynamics from seconds to sub-seconds using state variables and differential equations) are not sufficient for studying the multiple-timescale variation of solar generation and its impact on system reliability. Long-term system economics and short-term system dynamics are highly coupled, particularly when the penetration level of renewable generation is extremely high, because the uncertainty and variability of solar generation will impact both power systems steady-state and dynamic performance. This project helps meet and exceed the Solar Energy Technologies Office goal of systems integration by directly addressing this stability and reliability challenge for electric grid planning and operation. This will be accomplished by developing temporally comprehensive, closed-loop simulation models that seamlessly simulate power systems operations from economic scheduling (day-ahead to hours) to dynamic response analysis (seconds to sub-seconds). Both a multi-timescale grid model and an integrated PV model will be developed in this project to accurately study the impacts of PV variability and uncertainty on system reliability at multiple timescales. Using quasi-dynamic simulation methods and data-driven security assessment (DSA) criteria will allow the dynamic characteristics of PV to be fed forward into longer-timescale scheduling models for a complete understanding of the effect of short-term PV dynamics on bulk systems operations (e.g., reserve scheduling and deployment). Upon completion of the proposed model, this project will help operators accurately assess system reliability by deploying energy and reserve scheduling under critical contingency conditions and studying interactions among all types of essential reliability services provided by modern PV power plants.

14 SOLAR ENERGY↗
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 OSTI2020

MARBLE: A Multi-GPU Aware Job Scheduler for Deep Learning on HPC Systems

Deep learning (DL) has become a key tool for solving complex scientific problems. However, managing the multi-dimensional large-scale data associated with DL, especially atop extant multiple graphics processing units (GPUs) in modern supercomputers poses significant challenges. Moreover, the latest high-performance computing (HPC) architectures bring different performance trends in training throughput compared to the existing studies. Existing DL optimizations such as larger batch size and GPU locality-aware scheduling have little effect on improving DL training throughput performance due to fast CPU-to-GPU connections. Additionally, DL training on multiple GPUs scales sublinearly. Thus, simply adding more GPUs to a system is ineffective. To this end, we design MARBLE, a first-of-its-kind job scheduler, which considers the non-linear scalability of GPUs at the intra-node level to schedule an appropriate number of GPUs per node for a job. By sharing the GPU resources on a node with multiple DL jobs, MARBLE avoids low GPU utilization in current multi-GPU DL training on HPC systems. Our comprehensive evaluation in the Summit supercomputer shows that MARBLE is able to improve DL training performance by up to 48.3% compared to the popular Platform Load Sharing Facility (LSF) scheduler. Compared to the state-of-the-art of DL scheduler, Optimus, MARBLE reduces the job completion time by up to 47%.

Han, Jingoo↗
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)↗