Search NASA⌕ Search

SEARCH · Search NASA

Results for “Dynamic scheduling”

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 127 records · Page 7

DP-Based Optimization of BESS to Substitute RICE Reserves for Improved Economic Benefits

In regions with a significant proportion of renewable energy sources, reciprocating internal combustion engines (RICE or IC) are frequently employed as grid reserve solutions. This study suggests a scheduling technique for battery energy storage systems (BESS) that utilizes dynamic programming (DP) to replace IC units, adding versatility to the total reserve capacity and resulting in higher BESS earnings compared to traditional scheduling approaches. The capacity sweeping approach to optimize BESS’s revenue sometimes leads to operation which is counter intuitive to conventional battery sizing approaches.

25 ENERGY STORAGE↗

XPRESS: eXascale PRogramming Environment and System Software

The XPRESS project is the research and development of a complete software architecture for Exascale computing. The four major R&D thrusts include: 1) an Exascale lightweight kernel operating system (LXK), based on the Kitten operating system (OS), to manage billion way hardware parallelism, management of faults and power, management of global virtual name space, and other features of future system architectures; 2) a runtime system (HPX-5), co-designed with LXK, based on the ParalleX execution model that supports dynamic resource management and task scheduling; 3) system interfaces for interoperability between the runtime system and both the OS and the runtime system (RIOS); 4) compilation strategies and systems to translate MPI and OpenMP legacy codes to a form that can be run with performance at least as good as a native code implementation. The software architecture development has been driven by performance evaluation of mini-applications developed at Department of Energy Co-Design Centers as well as ancillary in-house developed applications and benchmarks. Research on the ParalleX execution model has been driven by the development of formal semantics and model checkers for the execution model. The major components of the software architecture are: ParalleX execution model – guiding principles for co-design of components of the system stack with advances in locality management and task prioritization through introspection; HPX runtime system – support of application dynamic adaptive resource management, task scheduling, and introspective control policies; LXK operating system – lightweight kernel operating system for order-constant scalability and low/no noise to manage resources; RIOS – a realm of Exascale system operation unique in the XPRESS project that includes the relationship between the new generation of lightweight kernel operating systems and runtime system software; XPI advanced programming model – intermediate form and low-level (readable) programming interface reflecting the ParalleX model, providing a target for source-to- source high level parallel language translation, and supporting early direct programming experimentation and measurement; Performance models & metrics – providing parameters and their mutual sensitivities to guide co-design and quantify operational behavior; Legacy migration – ensuring seamless transition of legacy codes and programming methods to the future generation of ParalleX-based Exascale systems; . Experiments and evaluation – critical to determining degree of effectiveness and likelihood of ultimate success as well as guiding corrective design changes to achieve DOE objectives; and Applications – collaborations with Co-Design Centers and other mission critical codes. The exemplar implementation of the ParalleX execution model, HPX-5, has been released along with five fully ported applications (LULESH, HPCG, SSSP, WAMR, and DASHMM) and multiple microbenchmarks. Using these applications, the system architecture demonstrated dynamic load balancing through active migration, legacy code migration, and data-driven approaches to for graph-like applications. Crucially for Exascale and billion way parallelism, the needs and patterns of irregular applications in HPX-5 were addressed using local flow control rather than relying on globally synchronized data structures.

97 MATHEMATICS AND COMPUTING↗

E-PVT: enhanced position-velocity-time scheduler for computer-controlled optical finishing with comprehensive considerations of dynamics constraints, continuity and efficiency

Deterministic computer-controlled optical finishing is an essential approach for achieving high-quality optical surfaces. Its determinism and convergence rely heavily on precise and smooth motion control to guide the machine tool over an optical surface to correct residual errors. One widely supported and smooth motion control model is position-velocity-time (PVT), which employs piecewise cubic polynomials to describe positions. Our prior research introduced a PVT-based velocity scheduling method, demonstrating sub-nanometer level convergence in ion beam figuring (IBF) processes. However, three challenges remained. Firstly, this method relies on quadratic programming, resulting in computational intensiveness for dense tool paths. Secondly, the dynamics constraints and velocity and acceleration continuities are not comprehensively considered, limiting the full potential of PVT-based control. Thirdly, no compensation mechanism existed when dynamics constraints are exceeded. In this study, in response to these challenges, we proposed the Enhanced PVT (E-PVT) method, reducing the time complexity from O ( n 3 ) to O ( n ) while fully addressing dynamics constraints and continuities. A novel compensation method utilizing particle swarm optimization was proposed to address situations where dynamics constraints might be exceeded while maintaining the overall processing efficiency. Validation through simulation and experimentation confirmed the improved performance of E-PVT.

36 MATERIALS SCIENCE↗

Net Present Value Optimization of a Natural Gas Combined Cycle Plant with CO 2 Capture using a Water-Lean Solvent Considering Transient Electricity Price for Multiple Regions

Global CO 2 emissions are increasing at about a 1.5% rate per year. Fossil fuel-based plants are one of the main contributors to this rise. In the power generation industry, fossil fuel plants are dominant, and many plants are under development. In this study, a natural gas combined cycle (NGCC) power plant with postcombustion capture using a leading water-lean solvent is considered. For optimal design and operating schedule, large-scale dynamic optimization is undertaken for net present value (NPV) optimization. The first principle dynamic model of NGCC is developed, including a model of the highly efficient H-class gas turbines. For computational tractability of the dynamic optimization problem, a reduced-order model is developed by using the Hankel singular value decomposition. A waterlean solvent, N-(2-ethoxyethyl)-3-morpholinopropan-1-amine, is used for carbon capture. A model of the capture system is developed in Aspen Plus, which is used to develop a reduced-order model by using ALAMO, a machine learning software. In addition, a reduced model of the CO 2 compression system with a dehydration unit is also considered. The integrated system is used for NPV optimization by using the Python-based PYOMO platform. The PCC process is analyzed for three configurations-conventional packed bed, rotating packed bed (RPB), and a combination of RPB and direct contact cooler. The NPV optimization is performed for 14 regional markets by considering year-long clustered and continuous locational marginal price data with a 1 h interval. Optimization results show that the PCC can achieve 90% CO 2 capture with a positive NPV for six regions. Sensitivity studies conducted by using the PCC configurations indicate that the process is economically feasible for 9 regions out of 14 regional electricity markets with NPV values in the range of 33−540 $MM.

cabon capture↗

Deep Reinforcement Learning for Residential HVAC Control with Consideration of Human Occupancy

The Artificial Intelligence (AI) development described herein uses model-free Deep Reinforcement Learning (DRL) to minimize energy cost during residential heating, ventilation, and air conditioning (HVAC) operation. Building cooling loads and HVAC operation are difficult to accurately model due to complexity, lack of measurements and data, and model specific performance, so online machine learning is used to allow for real-time readjustment in performance. Energy costs for the multi-zone cooling unit shown in this work are minimized by scheduling on/off commands around dynamic prices. By taking advantage of precooling events that take place when the price is low, the agent is able to reduce operational cost without violating user comfort. The DRL controller was tested in simulation where the learner achieved a 43.89% cost reduction when compared to traditional, fixed-setpoint operation. The system is now ready for the next phase of testing in a live, real-time home environment.

Mckee, Evan↗

Coding the Computing Continuum: Fluid Function Execution in Heterogeneous Computing Environments

Advances in network technologies have greatly decreased barriers to accessing physically distributed computers. This newfound accessibility coincides with increasing hardware specialization, creating exciting new opportunities to dispatch workloads to the best resource for a specific purpose, rather than those that are closest or most easily accessible. We present Delta, a service designed to intelligently schedule function-based workloads across a distributed set of heterogeneous computing resources. Delta implements an extensible architecture in which different predictors and scheduling algorithms can be integrated to provide dynamically evolving estimates of function execution times on different resources-estimates that can be used to determine the most appropriate location for execution. We describe predictors for function runtime, data transfer time, and cold-start resource provisioning and configuration delay; dynamic learning methods that update predictor models over time; and scheduling strategies that take into account both function and endpoint information. We show that these methods can halve workload makespan when compared with a strategy that selects the fastest resource, and decrease makespan by a factor of five when compared to a round robin strategy, when deployed on a heterogeneous testbed with resources ranging from a Raspberry Pi to a GPU node in an academic cloud.

Computing continuum↗

Final Report for ARPA-E LOCOMOTIVES Advanced Locomotive Technology and Rail Infrastructure Optimization System (ALTRIOS) Project

The Advanced Locomotive Technology and Rail Infrastructure Optimization System (ALTRIOS) is a unique, fully integrated, open-source software tool used to evaluate strategies for cost-effectively deploying advanced locomotive technologies and associated infrastructure. ALTRIOS simulates freight-demand-driven train scheduling, mainline meet-pass planning, locomotive dynamics, train dynamics, energy conversion efficiencies, and energy storage dynamics of line-haul train operations. Because new locomotives represent a significant long-term capital investment and new technologies must be thoroughly demonstrated before deployment, this tool provides guidance on the risk/reward trade-offs and operation integration of different technology rollout strategies. An open, integrated simulation tool is valuable for identifying future research needs and making decisions on technology development, routes, and train selection. This final report details the ALTRIOS software architecture, major modules and components, and data validation process. It demonstrates the software's utility through a 30-year rollout case study targeting high penetration of advanced powertrain technologies by 2050 for two BNSF Railway routes: loaded taconite ore trains from Hibbing, Minnesota, to Superior, Wisconsin, and mixed-freight trains from Superior to Minneapolis, Minnesota.

33 ADVANCED PROPULSION SYSTEMS↗

Locality-Aware Scheduling for Scalable Heterogeneous Environments

Heterogeneous computing promise boost performance of scientific applications by allowing massively parallel execution of computational tasks. However, manually managing extremely heterogeneous, multi-device systems is complicated and may result in sub-optimal performance. Specifically, data management is an extremely challenging problem on multi-device systems. In this work, we introduce two locality-aware schedulers for the Minos Computing Library (MCL), an asynchronous, task-based programming model and runtime for extremely heterogeneous systems. The first scheduler implements a pure locality-aware algorithm to maximize data reuse, though it might incur in ”hot-spots” that limit system utilization. The second scheduler mitigates this drawback by dynamically targeting between locality-awareness and system utilization based on the current workload and available computing devices. Our results show that locality-awareness greatly benefit applications that exhibit data reuse, providing up to 6.9x and 7.9x over the original MCL scheduler and equivalent OpenCL implementations, respectively. Moreover, our schedulers introduce negligible overhead compared with the original MCL scheduler and achieve similar performance for applications that don’t benefit from data locality.

Architecture, co-design, Task-based programming mo↗

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↗

Simulation-based assessment on stochastic load scheduling for building cooling systems

Here, to fill knowledge gaps related to stochastic load scheduling, we performed a comprehensive evaluation of the stochastic load scheduling for building cooling systems. Specifically, we studied the common uncertain variables in the load scheduling process for building cooling systems and categorized those variables based on their dynamic patterns. We then developed a generic stochastic load scheduling framework and applied it to building cooling systems that served a simulated community. This community consists of 100 heterogeneous houses and serves as a virtual testbed for evaluating the performance of stochastic load scheduling. In this evaluation, we considered representatives of uncertain variables with different dynamic patterns and included 100 realizations of the considered uncertainty in the evaluation to better catch the probability distribution of the control performance. The evaluation results suggest that deterministic load scheduling can reduce the operating energy cost by 18% but its performance can be affected by uncertainty. Stochastic load scheduling can further decrease the operating energy cost under uncertainty compared to deterministic load scheduling. We also found that the effectiveness of stochastic load scheduling in handling uncertainty is not directly associated with the number of uncertainty scenarios that are considered in its formulation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The relative influences of hydrologic information and dams’ hydropower scheduling decisions on electricity price forecasts

Price dynamics in wholesale electricity markets are driven by supply and demand. In markets with hydroelectric dams, the timing and amount of hydropower offered can influence prices in similar ways to wind and solar power. Unlike variable renewable energy, however, the supply of hydropower in wholesale markets is a function of both water availability and operational decisions at dams. Dam operators maximize revenues in wholesale markets by aligning generation with the periods of highest expected prices, and these scheduling decisions may in turn influence prices. Here, we examine the relative importance of two types of information in predicting forward electricity prices: a) water availability at dams, in the form of short-to-medium-range hydrological forecasts; and b) hourly scheduling decisions at dams. Using softly coupled hydrologic, hydropower scheduling, and power systems models spanning the U.S. Western Interconnection, we quantify the importance of hydrologic forecast accuracy in correctly predicting wholesale electricity prices and compare this with the influence of dam operators’ own hourly scheduling decisions on realized market prices. We find that aligning hydropower generation schedules with the periods of high forecasted prices causes larger, inadvertent price forecast errors than imperfect hydrologic forecasts. This suggests that knowledge of how water is managed by dam operators within the week is more important than weekly inflow forecast errors when predicting forward electricity prices. Our findings have implications for optimal hydropower scheduling by region. Specifically, accounting for price effects is critical in markets dominated by hydropower capacity.

Electricity markets↗

DRAS: Deep Reinforcement Learning for Cluster Scheduling in High Performance Computing

Cluster schedulers are crucial in high-performance computing (HPC). They determine when and which user jobs should be allocated to available system resources. Existing cluster scheduling heuristics are developed by human experts based on their experience with specific HPC systems and workloads. However, the increasing complexity of computing systems and the highly dynamic nature of application workloads have placed tremendous burden on manually designed and tuned scheduling heuristics. More aggressive optimization and automation are needed for cluster scheduling in HPC. In this work, we present an automated HPC scheduling agent named DRAS (Deep Reinforcement Agent for Scheduling) by leveraging deep reinforcement learning. DRAS is built on a hierarchical neural network incorporating special HPC scheduling features such as resource reservation and backfilling. An efficient training strategy is presented to enable DRAS to rapidly learn the target environment. Once being provided a specific scheduling objective given by the system manager, DRAS automatically learns to improve its policy through interaction with the scheduling environment and dynamically adjusts its policy as workload changes. We implement DRAS into a HPC scheduling platform called CQGym. CQGym provides a common platform allowing users to flexibly evaluate DRAS and other scheduling methods such as heuristic and optimization methods. Furthermore, the experiments using CQGym with different production workloads demonstrate that DRAS outperforms the existing heuristic and optimization approaches by up to 50%.

97 MATHEMATICS AND COMPUTING↗

Inertia estimation for power grids: A review of methods, challenges, and future prospects

The electric power grid is undergoing a significant transformation, shifting from traditional synchronous generators to inverter-based resources (IBRs) such as solar photovoltaics, wind turbines, and energy storage systems. This evolution leads to a reduction in system inertia, a critical attribute for maintaining frequency stability in response to disturbances. Consequently, the ability to monitor and estimate system inertia has become increasingly essential. This paper provides a comprehensive review of existing inertia estimation methodologies, analyzing them from multiple perspectives, including the types of data utilized, underlying estimation principles, operational modes, and system-wide applicability. A comparative summary table is included to distill commonalities and key characteristics across various studies. In addition, the paper examines practical implementations of inertia estimation across several major power systems worldwide, including the U.S. interconnections, the Nordic power system, and the U.K. grid. Key challenges are identified, particularly in estimating contributions from virtual inertia sources and load-induced inertia in increasingly converter-dominated networks. To address these emerging challenges, the paper proposes an integrated framework for real-time inertia estimation and monitoring. This framework encompasses critical components such as data acquisition, inertia estimation from both synchronous and non-synchronous sources, load-induced effects, optimization techniques, forecasting, and virtual inertia scheduling. Collectively, these elements enable dynamic, system-wide monitoring and adaptive control of grid inertia.

Inertia estimation↗

Radiation modeling using the Uintah heterogeneous CPU/GPU runtime system. In: XSEDE '12 Proceedings of the 1st Conference of the Extreme Science and Engineering Discovery Environment: Bridging from the eXtreme to the campus and beyond, Article No. 4

The Uintah Computational Framework was developed to provide an environment for solving fluid-structure interaction problems on structured adaptive grids on large-scale, long-running, data-intensive problems. Uintah uses a combination of fluid-flow solvers and particle-based methods for solids, together with a novel asynchronou task-based approach with fully automated load balancing. Uintah demonstrates excellent weak and strong scalability at full machine capacity on XSEDE resources such as Ranger and Kraken, and through the use of a hybrid memory approach based on a combination of MPI and Pthreads, Uintah now runs on up to 262k cores on the DOE Jaguar system. In order to extend Uintah to heterogeneous systems, with ever-increasing CPU core counts and additional on-node GPUs, a new dynamic CPU-GPU task scheduler is designed and evaluated in this study. This new scheduler enables Uintah to fully exploit these architectures with support for asynchronous, out-of-order scheduling of both CPU and GPU computational tasks. A new runtime system has also been implemented with an added multi-stage queuing architecture for efficient scheduling of CPU and GPU tasks. This new runtime system automatically handles the details of asynchronous memory copies to and from the GPU and introduces a novel method of pre-fetching and preparing GPU memory prior to GPU task execution. In this study this new design is examined in the context of a developing, hierarchical GPU-based ray tracing radiation transport model that provides Uintah with additional capabilities for heat transfer and electromagnetic wave propagation. The capabilities of this new scheduler design are tested by running at large scale on the modern heterogeneous systems, Keeneland and TitanDev, with up to 360 and 960 GPUs respectively. On these systems, we demonstrate significant speedups per GPU against a standard CPU core for our radiation problem.

Humphrey, Alan↗

Data-Driven Security Assessment of Power Grids Based on Machine Learning Approach: Preprint

Data-driven security assessment provides key indicators on power system stability using simulations on scheduling models, as opposed to dynamic simulations that are more time-consuming. This paper investigates data-driven security assessment of power grids based on machine learning. Multivariate random forest regression is used as the machine learning algorithm due to its high robustness to the input data. Three stability issues are analyzed using the proposed machine learning tool, including transient stability, frequency stability and small signal stability. The estimation values from machine learning tool are compared with those from dynamic simulations. Results show that the proposed machine learning tool can effectively predict the stability margins for the three stability metrics.

14 SOLAR ENERGY↗

CMS multicore scheduling strategy

In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

Perez-Calero Yzquierdo, Antonio↗

A direct transcription-based multiple shooting formulation for dynamic optimization

The growing need for fast and efficient solution techniques for solving dynamic optimization problems is driven by a broad spectrum of applications in scheduling and control. We suggest a novel framework for dynamic optimization that utilizes a multiple shooting “backbone” with discrete rather than continuous subproblems, thereby eliminating need for repeated time-integration. A Lagrangian relaxation (LR)-based decomposition scheme is proposed, which dualizes the state continuity requirements between subproblems and enables parallel solution of the problem. We demonstrate the applicability of our method on two case studies: the Van der Pol oscillator and a batch reactor.

42 ENGINEERING↗

Optimal scheduling for profit maximization of energy storage merchants considering market impact based on dynamic programming

This paper analyzes how electricity merchants' market impact affects merchants' profit. Energy storage has long been studied for its role in maximizing profit, and merchant decisions are assumed to have no impact on market prices. However, the trading decisions of large-scale energy storage merchants (e.g., pumped storage hydro) will affect the market prices. This paper employs dynamic programming theory to investigate merchants' optimal economic dispatch considering the market impact and physical characteristics of storage systems. Our findings show that the State-of-Charge (SOC) based analytical solution significantly facilitates energy storage merchants' decision-making. The SOC range is segmented into three regions by two optimal SOC reference points, which depend on the available energy in storage, given prices, and market impact. By comparing the current storage SOC with the reference points, the merchant can get the corresponding optimal actions. We analytically show that if the merchant neglects the market impact on the power market, she will exaggerate her expected profit when the price-taker and price-maker merchants have the same generating and pumping upper limits offered to Independent System Operators (ISOs). Furthermore, the profit-maximizing merchant must, therefore, assay to balance the trade-off correctly between the intensity of market impact and the dispatched power. Our findings are verified by numerical simulation, and results demonstrate the ramifications for electricity merchants in energy arbitrage decisions.

25 ENERGY STORAGE↗