Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedule”

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 541 records · Page 30
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

PLAStiCC: Predictive Look-Ahead Scheduling for Continuous dataflows on Clouds

Scalable stream processing and continuous dataflow systems are gaining traction with the rise of big data due to the need for processing high velocity data in near real time. Unlike batch processing systems such as MapReduce and workflows, static scheduling strategies fall short for continuous dataflows due to the variations in the input data rates and the need for sustained throughput. The elastic resource provisioning of cloud infrastructure is valuable to meet the changing resource needs of such continuous applications. However, multi-tenant cloud resources introduce yet another dimension of performance variability that impacts the application’s throughput. In this paper we propose PLAStiCC, an adaptive scheduling algorithm that balances resource cost and application throughput using a prediction-based look-ahead approach. It not only addresses variations in the input data rates but also the underlying cloud infrastructure. In addition, we also propose several simpler static scheduling heuristics that operate in the absence of accurate performance prediction model. These static and adaptive heuristics are evaluated through extensive simulations using performance traces obtained from public and private IaaS clouds. Our results show an improvement of up to 20% in the overall profit as compared to the reactive adaptation algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Runtime Concurrency Control and Operation Scheduling for High Performance Neural Network Training

In this paper, we extend an existing runtime system (the TensorFlow runtime) to enable automatic concurrency control and scheduling of operations. We explore performance modeling to predict the performance of operations with various thread- level parallelism. Our performance model is highly accurate and lightweight. Leveraging the performance model, our runtime system employs a set of scheduling strategies that co-run opera- tions to improve hardware utilization and system throughput. Our runtime system demonstrates a significant performance benefit. Comparing with using the recommended configurations for concurrency control and operation scheduling in TensorFlow, our approach achieves 36% performance (execution time) im- provement on average (up to 49%) for four neural network models, and achieves high performance close to the optimal one manually obtained by the user.

Liu, Jiawen↗
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 OSTI2014

SU-F-19A-08: Optimal Time Release Schedule of In-Situ Drug Release During Permanent Prostate Brachytherapy

Purpose: Permanent prostate brachytherapy spacers can be used to deliver sustained doses of radiosentitizing drug directly to the target, in order to enhance the radiation effect. Implantable nanoplatforms for chemo-radiation therapy (INCeRTs) have a maximum drug capacity and can be engineered to control the drug release schedule. The optimal schedule for sensitization during continuous low dose rate irradiation is unknown. This work studies the optimal release schedule of drug for both traditional sensitizers, and those that work by suppressing DNA repair processes. Methods: Six brachytherapy treatment plans were used to model the anatomy, implant geometry and calculate the spatial distribution of radiation dose and drug concentrations for a range of drug diffusion parameters. Three state partial differential equations (cells healthy, damaged or dead) modeled the effect of continuous radiation (radiosensitivities α,β) and cellular repair (time tr) on a cell population. Radiosensitization was modeled as concentration dependent change in α,β or tr which with variable duration under the constraint of fixed total drug release. Average cell kill was used to measure effectiveness. Sensitization by means of both enhanced damage and reduced repair were studied. Results: Optimal release duration is dependent on the concentration of radiosensitizer compared to the saturation concentration (csat) above which additional sensitization does not occur. Long duration drug release when enhancing α or β maximizes cell death when drug concentrations are generally over csat. Short term release is optimal for concentrations below saturation. Sensitization by suppressing repair has a similar though less distinct trend that is more affected by the radiation dose distribution. Conclusion: Models of sustained local radiosensitization show potential to increase the effectiveness of radiation in permanent prostate brachytherapy. INCeRTs with high drug capacity produce the greatest benefit with drug release over weeks. If in-vivo drug concentrations are not able to approach saturation concentration, durations of days is optimal. DOD 1R21CA16977501; A. David Mazzone Awards Program 2012PD164.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

An Elegant Sufficiency: Load-Aware Differentiated Scheduling of Data Transfers

We investigate the file transfer scheduling problem, where transfers among different endpoints must be scheduled to maximize pertinent metrics. We propose two new algorithms that exploit the fact that the aggregate bandwidth obtained over a network or at a storage system tends to increase with the number of concurrent transfers—but only up to a certain limit. The first algorithm, SEAL, uses runtime information and data-driven models to approximate system load and adapt transfer schedules and concurrency so as to maximize performance while avoiding saturation. We implement this algorithm using GridFTP as the transfer protocol and evaluate it using real transfer logs in a production WAN environment. Results show that SEAL can improve average slowdowns and turnaround times by up to 25% and worst-case slowdown and turnaround times by up to 50%, compared with the best-performing baseline scheme. Our second algorithm, STEAL, further leverages user-supplied categorization of transfers as either “interactive” (requiring immediate processing) or “batch” (less time-critical). Results show that STEAL reduces the average slowdown of interactive transfers by 63% compared to the best-performing baseline and by 21% compared to SEAL. For batch transfers, compared to the best-performing baseline, STEAL improves by 18% the utilization of the bandwidth unused by interactive transfers. By elegantly ensuring a sufficient, but not excessive, allocation of concurrency to the right transfers, we significantly improve overall performance despite constraints.

Kettimuthu, Rajkumar↗
DOE OSTI2020

Study on Intelligent Compaction-Equipment Logistics Scheduling and Propagation Characteristics of Vibration Wave in Nonlinear Systems with Multistability Based on Field Test

The equipment scheduling and propagation characteristics of vibration wave from vibratory roller ⟶ filling material nonlinear systems with multistability are the core problems of subgrade intelligent construction technology, and the logistics scheduling of the equipment is directly related to the construction efficiency. Aiming at the shortages, one typical subgrade located at the Gu’an station of Beijing-Xiong’an city railway is selected to research and finish the field tests; some findings are shown as follows: first, some valuable suggestions about the logistics scheduling of intelligent equipment are proposed, which can break the barriers between the organizations and improve construction efficiency; second, when the vibration wave propagates from the vibratory roller ⟶ surface of filling material ⟶ different buried depths of filling material, the peak acceleration of vibration wave gradually decreases and is hyperbolic distribution approximately. At the same time, the sensitive of attenuation is shown as follows: Z R 2 >0.9), and the concrete functional relationship among different amplitudes of harmonics can be summarized as y = Ae −BX ; fourth, the vibration energy is mainly concentrated near 10–30 Hz in the vibratory roller, but when the vibration wave propagates from vibratory roller⟶filling material, the vibration energy gradually decreases with the increase in depth, and the marginal spectrum gradually changes from one peak to two peaks, that is, 30–50 Hz and 50–100 Hz; fifth, the vibration energy in the vibrational wheel is distributed averagely in the compaction process, and the effective compaction time is two seconds, which will be helpful for revealing the propagation characteristics of vibration wave, optimizing the compaction quality control models and providing some support for the development of intelligent compaction theory of railway subgrade.

Han, Yixuan↗
DOE OSTI2019

FESTIV (Flexible Energy Scheduling Tool for Integrating Variable generation) [SWR-14-11]

Flexible Energy Scheduling Tool for Integrating Variable generation (FESTIV) is a tool that simulates the realistic representation of steady-state power system operations and scheduling performed by an independent system operator, regional transmission organization, or a vertically integrated regulated utility. The tool integrates security-constrained unit commitment (SCUC), security-constrained economic dispatch (SCED), and automatic generation control (AGC) into one model. These are the three modes of power system scheduling that are used to meet the changing net demand. Each of these submodels have different time characteristics and are used to meet the changing demand at different time resolutions and horizons. This allows multiple timescales to be studied where FESTIV accounts for intertemporal coupling between each submodel and the submodels themselves. It does this while having different objectives between the submodels; commitment of resources, dispatch and reserve commitment, and finally control.

Ela, Erik↗
DOE OSTI2015

HEMS: Home Energy Management System [SWR-15-12] - Stochastic Optimal Scheduling of Residential Appliances with Renewable Energy Sources

The HEMS algorithm schedules residential appliance operation to minimize the weighted sum of occupant discomfort, total energy cost, peak electricity consumption and carbon footprint, weighted according to occupant preferences. A centralized mixed integer linear programming (MILP) based optimization approach is taken, with the HEMS managing all appliances directly, following a Model Predictive Control (MPC) methodology which determines the optimal schedule over the user-specified scheduling horizon and repeats the optimization at configurable time intervals. The HEMS is developed on the General Algebraic Modeling System (GAMS) using the MILP solver. This system is able to effectively deal with the stochasticity in the distributed system by utilizing Monte Carlo simulation where uncertainties in future electricity price, outdoor temperature, water usage, solar and wind generation can be accounted for. The HEMS controls the operation of the heating, ventilation and air conditioning (HVAC) system, water heater, refrigerator, residential batteries, electric vehicles, standalone micro combined heat and power (CHP) generator, dishwasher, washer/dryer, pool pumps, and lighting.

Pratt, Annabelle↗
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 OSTI2014

Dynamic Optimized Advanced Scheduling of Bandwidth Demands for Large-Scale Science Applications (Final Report)

In this project, developed scheduling frameworks for dynamic bandwidth demands for large-scale science applications. In particular, we developed scheduling algorithms for dynamic bandwidth demands in this project. Apart from theoretical approaches such as Integer Linear Programming, Tabu Search and Genetic Algorithm heuristics, we have utilized practical data from ESnet OSCARS project (from our DOE lab partners) to conduct realistic simulations of our approaches. We have disseminated our work through conference paper presentations and journal papers and a book chapter. In this project we addressed the problem of scheduling of lightpaths over optical wavelength division multiplexed (WDM) networks. We published several conference papers and journal papers on this topic. We also addressed the problems of joint allocation of computing, storage and networking resources in Grid/Cloud networks and proposed energy-efficient mechanisms for operation optical WDM networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Operational Excellence through Schedule Optimization and Production Simulation of Application Specific Integrated Circuits.

Upcoming weapon programs require an aggressive increase in Application Specific Integrated Circuit (ASIC) production at Sandia National Laboratories (SNL). SNL has developed unique modeling and optimization tools that have been instrumental in improving ASIC production productivity and efficiency, identifying optimal operational and tactical execution plans under resource constraints, and providing confidence in successful mission execution. With ten products and unprecedented levels of demand, a single set of shared resources, highly variable processes, and the need for external supplier task synchronization, scheduling is an integral part of successful manufacturing. The scheduler uses an iterative multi-objective genetic algorithm and a multi-dimensional performance evaluator. Schedule feasibility is assessed using a discrete event simulation (DES) that incorporates operational uncertainty, variability, and resource availability. The tools provide rapid scenario assessments and responses to variances in the operational environment, and have been used to inform major equipment investments and workforce planning decisions in multiple SNL facilities.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2016

Systematic Evaluation of Stochastic Methods in Power System Scheduling and Dispatch with Renewable Energy

As more wind power and other renewable resources are being integrated into the electric power grid, the forecast uncertainty brings operational challenges for the power system operators. In this report, different operational strategies for uncertainty management are presented and evaluated. A comprehensive and consistent simulation framework is developed to analyze the performance of different reserve policies and scheduling techniques under uncertainty in wind power. Numerical simulations are conducted on a modified version of the IEEE 118-bus system with a 20% wind penetration level, comparing deterministic, interval, and stochastic unit commitment strategies. The results show that stochastic unit commitment provides a reliable schedule without large increases in operational costs. Moreover, decomposition techniques, such as load shift factor and Benders decomposition, can help in overcoming the computational obstacles to stochastic unit commitment and enable the use of a larger scenario set to represent forecast uncertainty. In contrast, deterministic and interval unit commitment tend to give higher system costs as more reserves are being scheduled to address forecast uncertainty. However, these approaches require a much lower computational effort Choosing a proper lower bound for the forecast uncertainty is important for balancing reliability and system operational cost in deterministic and interval unit commitment. Finally, we find that the introduction of zonal reserve requirements improves reliability, but at the expense of higher operational costs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2018

Desktop Instructions for LLNL W80-4 WDCR Schedule and Cost Risk Analysis

As part of Weapon Design Cost Report (WDCR), LLNL will be performing site Schedule Risk and Cost Risk Analysis. This analysis uses statistical techniques to predict a level of confidence in meeting the program’s completion date. This document includes the process and steps to conduct the Schedule Risk and Cost Risk Analysis to determine the likelihood that the program completion date are met, how much management reserve is needed to provide the acceptable certainty of completion by a specific date, risks most likely to delay the project, and the paths or activities that are most likely to delay the program. The analysis focuses on uncertainty and key risks and how they affect the schedule’s activity durations and established a management reserve.

99 GENERAL AND MISCELLANEOUS↗
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↗