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

Deep Reinforcement Scheduling of Energy Storage Systems for Real-time Voltage Regulation in Unbalanced LV Networks with High PV Penetration

The ever-growing higher penetration of distributed energy resources (DERs) in low-voltage (LV) distribution systems brings both opportunities and challenges to voltage support and regulation. This paper proposes a deep reinforcement learning (DRL)-based scheduling scheme of energy storage systems (ESSs) to mitigate system voltage deviations in unbalanced LV distribution networks. The ESS-based voltage regulation problem is formulated as a multi-stage quadratic stochastic program, with the objective of minimizing the expected total daily voltage regulation cost while satisfying operational constraints. While existing voltage regulation methods are mostly focused on onetime- step control, this paper explores a day-horizon systemwide voltage regulation problem. In other words, the size of action and state spaces are extremely high-dimensional and need to be delicately handled. Furthermore, in order to overcome the difficulty of modeling uncertainties and develop a realtime solution, a learn-to-schedule feedback control framework is proposed by adapting the problem to a model-free DRL setting. The proposed algorithm is tested on a customized 6-bus system and a modified IEEE 34-bus system. Simulation results validate the effectiveness and near-optimality of voltage regulation by ESS in comparison with a deterministic quadratic program solution.

Wang, Shengyi↗
DOE OSTI2014

TU-F-BRF-08: Intensity Modulation Expanded to Spatio-Temporal Space; IMRT Combined with Optimal Fractionation Schedule

Purpose: Past efforts to improve the therapeutic ratio have focused on a spatial approach where highly conformal radiation dose is given to tumors while minimizing dose to normal tissues, e.g., IMRT, VMAT, and IGRT. However, the fractionation schedule, i.e., a temporal approach to radiotherapy, has been largely overlooked so far in maximizing the therapeutic ratio. We establish a rigorous mathematical spatio-temporal approach to systematically investigate the feasibility and potential benefits of simultaneously optimizing radiation dose distribution in space and time. Methods: Stochastic control formalism is constructed to maximize the average tumor BED by choosing an optimal radiation dose distribution for an optimal number of fractions subject to normal tissue BED constraints. Three separate simulations are run on two groups of phantom cases; 5 cases with prostate cancer and 5 cases with head-and-neck cancer. (1) Conventional IMRT with 70Gy/35fx for head-and-neck, and 81Gy/45fx for prostate, (2) IMRT is done independently from the fractionation schedule optimization (S-model), (3) integrated spatio-temporal approach (I-model) where radiation intensities are simultaneously optimized for the first time ever in space and time. Final tumor BEDs from the three trials are compared in prostate and head-and-neck cases. Results: Numerical simulations show that final tumor BED from I-model is 20–90% larger than conventional IMRT, and 20-50% larger than S-model for head-and-neck cancer with α/β=10 and Tdouble=2–50 days. Final tumor BED from I-model is also 90–140% larger than conventional IMRT, and 20–30% larger than S-model for prostate cancer with α/β=2 and Tdouble=5–80 days. Conclusion: Our spatio-temporal optimization of radiotherapy allows an expansion of search space for the optimal treatment plans to include the temporal distribution of radiation dose in addition to the spatial distribution. Such spatio-temporal approach shows great potential to improve the therapeutic ratio, particularly with fast growing, aggressive tumors with short doubling time and/or low α/β.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2014

WE-D-BRE-04: Modeling Optimal Concurrent Chemotherapy Schedules

Purpose: Concurrent chemo-radiation therapy (CCRT) has become a more common cancer treatment option with a better tumor control rate for several tumor sites, including head and neck and lung cancer. In this work, possible optimal chemotherapy schedules were investigated by implementing chemotherapy cell-kill into a tumor response model of RT. Methods: The chemotherapy effect has been added into a published model (Jeong et al., PMB (2013) 58:4897), in which the tumor response to RT can be simulated with the effects of hypoxia and proliferation. Based on the two-compartment pharmacokinetic model, the temporal concentration of chemotherapy agent was estimated. Log cell-kill was assumed and the cell-kill constant was estimated from the observed increase in local control due to concurrent chemotherapy. For a simplified two cycle CCRT regime, several different starting times and intervals were simulated with conventional RT regime (2Gy/fx, 5fx/wk). The effectiveness of CCRT was evaluated in terms of reduction in radiation dose required for 50% of control to find the optimal chemotherapy schedule. Results: Assuming the typical slope of dose response curve (γ50=2), the observed 10% increase in local control rate was evaluated to be equivalent to an extra RT dose of about 4 Gy, from which the cell-kill rate of chemotherapy was derived to be about 0.35. Best response was obtained when chemotherapy was started at about 3 weeks after RT began. As the interval between two cycles decreases, the efficacy of chemotherapy increases with broader range of optimal starting times. Conclusion: The effect of chemotherapy has been implemented into the resource-conservation tumor response model to investigate CCRT. The results suggest that the concurrent chemotherapy might be more effective when delayed for about 3 weeks, due to lower tumor burden and a larger fraction of proliferating cells after reoxygenation.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2026

iDDS: intelligent distributed dispatch and scheduling for workflow orchestration

The intelligent distributed dispatch and scheduling (iDDS) service is a versatile workflow orchestration system designed for large-scale, distributed scientific computing. iDDS extends traditional workload and data management by integrating data-aware execution, conditional logic, and programmable workflows, enabling automation of complex and dynamic processing pipelines. Originally developed for the ATLAS experiment at the large hadron collider, iDDS has evolved into an experiment-agnostic platform that supports both template-driven workflows and a Function-as-a-Task model for Python-based orchestration. This paper presents the architecture and core components of iDDS, highlighting its scalability, modular message-driven design, and integration with systems such as PanDA and Rucio. We demonstrate its versatility through real-world use cases: fine-grained tape resource optimization for ATLAS, orchestration of large Directed Acyclic Graph (DAG) workflows for the Rubin Observatory, distributed hyperparameter optimization for machine learning applications, active learning for physics analyses, and AI-assisted detector design at the electron–ion collider. By unifying workload scheduling, data movement, and adaptive decision-making, iDDS reduces operational overhead and enables reproducible, high-throughput workflows across heterogeneous infrastructures. We conclude with current challenges and future directions, including interactive, cloud-native, and serverless workflow support.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers

Work stealing is a popular approach to scheduling task-parallel programs. The flexibility inherent in work stealing when dealing with load imbalance results in seemingly irregular computation structures, complicating the study of its runtime behavior. In this paper, we present an approach to efficiently trace async-finish parallel programs scheduled using work stealing. We identify key properties that allow us to trace the execution of tasks with low time and space overheads. We also study the usefulness of the proposed schemes in supporting algorithms for data-race detection and retentive steal- ing presented in the literature. We demonstrate that the perturbation due to tracing is within the variation in the execution time with 99% confidence and the traces are concise, amounting to a few tens of kilobytes per thread in most cases. We also demonstrate that the traces enable significant reductions in the cost of detecting data races and result in low, stable space overheads in supporting retentive stealing for async-finish programs.

async-finish parallelism↗
DOE OSTI2016

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Divergence Reduction in Monte Carlo Neutron Transport with On-GPU Asynchronous Scheduling

While Monte Carlo Neutron Transport (MCNT) is near-embarrasingly parallel, the effectively unpredictable lifetime of neutrons can lead to divergence when MCNT is evaluated on GPUs. Divergence is the phenomenon of adjacent threads in a warp executing different control flow paths; on GPUS, it reduces performance because each work group may only execute one path at a time. The process of Thread Data Remapping (TDR) resolves these discrepancies by moving data across hardware such that data in the same warp will be processed through similar paths. A common issue among prior implementations of TDR is the synchronous nature of its remapping and processing cycles, which exhaustively sort data produced by prior processing passes and exhaustively evaluate the sorted data. In another work, we defined a method of remapping data through an asynchronous scheduler which allows for work to be stored in shared memory and deferred arbitrarily until that work is a viable option for low-divergence evaluation. This article surveys a wider set of cases, with the goal of characterizing performance trends across a more comprehensive set of parameters. These parameters include cross sections of scattering/capturing/fission, use of implicit capture, source neutron counts, simulation time spans, and tuned memory allocations. Across these cases, we have recorded minimum and average execution times, as well as a heuristically tuned near-optimal memory allocation size for both synchronous and asynchronous scheduling. Across the collected data, it is shown that the asynchronous method is faster and more memory efficient in the majority of cases, and that it requires less tuning to achieve competitive performance.

Computer Science↗
DOE OSTI2022

AI4IO: A suite of AI-based tools for IO-aware scheduling

Traditional workload managers do not have the capacity to consider how IO contention can increase job runtime and even cause entire resource allocations to be wasted. Whether from bursts of IO demand or parallel file systems (PFS) performance degradation, IO contention must be identified and addressed to ensure maximum performance. In this paper, we present AI4IO (AI for IO), a suite of tools using AI methods to prevent and mitigate performance losses due to IO contention. AI4IO enables existing workload managers to become IO-aware. Currently, AI4IO consists of two tools: PRIONN and CanarIO. PRIONN predicts IO contention and empowers schedulers to prevent it. CanarIO mitigates the impact of IO contention when it does occur. We measure the effectiveness of AI4IO when integrated into Flux, a next-generation scheduler, for both small- and large-scale IO-intensive job workloads. Our results show that integrating AI4IO into Flux improves the workload makespan up to 6.4%, which can account for more than 18,000 node-h of saved resources per week on a production cluster in our large-scale workload.

Wyatt, II, Michael R.↗
DOE OSTI2022

An Exact Algorithm for the Linear Tape Scheduling Problem

Magnetic tapes are often considered as an outdated storage technology, yet they are still used to store huge amounts of data. Their main interests are a large capacity and a low price per gigabyte, which come at the cost of a much larger file access time than on disks. With tapes, finding the right ordering of multiple file accesses is thus key to performance. Moving the reading head back and forth along a kilometer long tape has a non-negligible cost and unnecessary movements thus have to be avoided. However, the optimization of tape request ordering has rarely been studied in the scheduling literature, much less than I/O scheduling on disks. For instance, minimizing the average service time for several read requests on a linear tape remains an open question. Therefore, in this paper, we aim at improving the quality of service experienced by users of tape storage systems, and not only the peak performance of such systems. To this end, we propose a reasonable polynomial-time exact algorithm while this problem and simpler variants have been conjectured NP-hard. We also refine the proposed model by considering U-turn penalty costs accounting for inherent mechanical accelerations. Then, we propose a low-cost variant of our optimal algorithm by restricting the solution space, yet still yielding an accurate suboptimal solution. Finally, we compare our algorithms to existing solutions from the literature on logs of the mass storage management system of a major datacenter. This allows us to assess the quality of previous solutions and the improvement achieved by our low-cost algorithm. Aiming for reproducibility, we make available the complete implementation of the algorithms used in our evaluation, alongside the dataset of tape requests that is, to the best of our knowledge, the first of its kind to be publicly released.

Honoré, Valentin↗
DOE OSTI2020

Joint optimal scheduling for electric vehicle battery swapping-charging system based on wind farms

Insufficiencies in charging facilities limit the broad application of electric vehicles (EVs). In addition, EV can hardly represent a green option if its electricity primarily depends on fossil energy. Considering these two problems, this paper studies a battery swapping-charging system based on wind farms (hereinafter referred to as W-BSCS). In a W-BSCS, the wind farms not only supply electricity to the power grid but also cooperate with a centralized charge station (CCS), which can centrally charge EV batteries and then distribute them to multiple battery swapping stations (BSSs). The operational framework of the W-BSCS is analyzed, and some preprocessing technologies are developed to reduce complexity in modeling. Then, a joint optimal scheduling model involving a wind power generation plan, battery swapping demand, battery charging and discharging, and a vehicle routing problem (VRP) is established. Then a heuristic method based on the exhaustive search and the Genetic Algorithm is employed to solve the formulated NP-hard problem. Numerical results verify the effectiveness of the joint optimal scheduling model, and they also show that the W-BSCS has great potential to promote EVs and wind power.

17 WIND ENERGY↗
DOE OSTI2014

LDRD Report: Scheduling Irregular Algorithms

This LDRD project was a campus exec fellowship to fund (in part) Donald Nguyen’s PhD research at UT-Austin. His work has focused on parallel programming models, and scheduling irregular algorithms on shared-memory systems using the Galois framework. Galois provides a simple but powerful way for users and applications to automatically obtain good parallel performance using certain supported data containers. The naïve user can write serial code, while advanced users can optimize performance by advanced features, such as specifying the scheduling policy. Galois was used to parallelize two sparse matrix reordering schemes: RCM and Sloan. Such reordering is important in high-performance computing to obtain better data locality and thus reduce run times.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Advanced Technology System Scheduling Governance Model

In the fall of 2005, the Advanced Simulation and Computing (ASC) Program appointed a team to formulate a governance model for allocating resources and scheduling the stockpile stewardship workload on ASC capability systems. This update to the original document takes into account the new technical challenges and roles for advanced technology (AT) systems and the new ASC Program workload categories that must be supported. The goal of this updated model is to effectively allocate and schedule AT computing resources among all three National Nuclear Security Administration (NNSA) laboratories for weapons deliverables that merit priority on this class of resource. The process outlined below describes how proposed work can be evaluated and approved for resource allocations while preserving high effective utilization of the systems. This approach will provide the broadest possible benefit to the Stockpile Stewardship Program (SSP).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Residual Stress Developed During the Cure of Thermosetting Polymers: Optimizing Cure Schedule to Minimize Stress

When thermosetting polymers are used to bond or encapsulate electrical, mechanical or optical assemblies, residual stress, which often affects the performance and/or reliability of these devices, develops within the structure. The Thin-Disk-on-Cylinder structural response test is demonstrated as a powerful tool to design epoxy encapsulant cure schedules to reduce residual stress, even when all the details of the material evolution during cure are not explicitly known. The test's ability to (1) distinguish between cohesive and adhesive failure modes and (2) demonstrate methodologies to eliminate failure and reduce residual stress, make choices of cure schedules that optimize stress in the encapsulant unambiguous. For the 828/DEA/GMB material in the Thin-Disk-on-Cylinder geometry, the stress associated with cure is significant and outweighs that associated with cool down from the final cure temperature to room temperature (for measured lid strain, Iε cure I > Iε thermal I). The difference between the final cure temperature and the temperature at which the material gels, T f - T gel , was demonstrated to be a primary factor in determining the residual stress associated with cure. Increasing T f - T gel leads to a reduction in cure stress that is described as being associated with balancing some of the 828/DEA/GMB cure shrinkage with thermal expansion. The ability to tune residual stress associated with cure by controlling T f - T gel would be anticipated to translate to other thermosetting encapsulation materials, but the times and temperatures appropriate for a given material may vary widely.

36 MATERIALS SCIENCE↗
DOE OSTI2019

SST-GPU: An Execution -Driven CUDA Kernel Scheduler and Streaming-Multiprocessor Compute Model

Programmable accelerators have become commonplace in modern computing systems. Advances in programming models and the availability of massive amounts of data have created a space for massively parallel acceleration where the context for thousands of concurrent threads are resident on-chip. These threads are grouped and interleaved on a cycle-by-cycle basis among several massively parallel computing cores. The design of future supercomputers relies on an ability to model the performance of these massively parallel cores at scale. To address the need for a scalable, decentralized GPU model that can model large GPUs, chiplet-based GPUs and multi-node GPUs, this report details the first steps in integrating the open-source, execution driven GPGPU-Sim into the SST framework. The first stage of this project, creates two elements: a kernel scheduler SST element accepts work from SST CPU models and schedules it to an SM-collection element that performs cycle-by-cycle timing using SSTs Mem Hierarchy to model a flexible memory system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

BigData Express: Toward Predictable, Schedulable, and High-Performance Data Transfer [PowerPoint]

Topics include: • BigData Express: a schedulable, predictable, and high-performance data transfer service – A peer-to-peer, scalable, and extensible data transfer model – A visually appealing, easy-to-use web portal – A high-performance data transfer engine – A time-constraint-based scheduler – On-demand provisioning of end-to-end network paths with guaranteed QoS – Robust and flexible error handling – CILogon-based security

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Improving Experimental Baseline Schedule Resiliency at the National Ignition Facility

The goal of this system is to provide a universal method of capturing and integrating campaign level target requirements for experiments at the National Ignition Facility (NIF) prior to establishing a baseline schedule. The expected outcome is a more resilient schedule able to accurately incorporate long lead target requirements.

42 ENGINEERING↗
DOE OSTI2020

Application and Interpretation of Acumen Risk ® Schedule and Cost Risk Analysis

Schedule risk and cost risk analyses use statistical techniques to predict a level of confidence in meeting a program’s completion date and cost. This paper describes how to interpret key Schedule Risk Analysis (SRA) and Cost Risk Analysis (CRA) results to determine the likelihood that the program completion dates are met, how much management reserve (MR) is needed to provide the acceptable certainty of completion by a specific date, and the risks and activities that are most likely to delay or add cost to a project. The combined process is often called a Schedule/Cost Uncertainty and Risk Analysis or “SCURA.”

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

Nuclear Waste Attributes of SMRs Scheduled for Near-Term Deployment

The purpose of this study is to evaluate the nuclear waste attributes of Small Modular Reactors (SMRs) scheduled for deployment within this decade using available data and established nuclear waste metrics, with the results compared to a reference large Pressurized Water Reactor (PWR). The current fleet of commercial nuclear reactors in the U.S. is composed of 92 large Light Water Reactors (LWR) with an average electricity generating capacity of over 1,000 MWe each. These large LWRs built on-site in massive construction projects have been the mainstay of the industry for the last 50 years. However, new construction soon is expected to include several designs of smaller reactors primarily fabricated in factories and installed in the field in modules. Some of these SMRs will also be LWRs, while some will use other coolants such as liquid metals, molten salts or gases, and different types of fuels. The technologies and economics of SMRs have been the focus of many studies, but there has been only minimal information published on the amount of nuclear waste different types of SMRs are expected to generate and no reports focused on near-term-deployable designs. In this study, the nuclear waste attributes of three small reactors scheduled for near-term-deployment, VOYGR TM (from NuScale Power), Natrium TM ab (from TerraPower), and Xe-100 (from X-energy), were assessed by comparing nuclear waste metrics with those of a reference large Pressurized Water Reactor (PWR).

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗