Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “schedules”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 397 records · Page 22

Tightest Mixed-Integer Programming Formulations for Quadratic SCUC Optimization

In this project, we developed new, tighter Mixed-Integer Programming (MIP) formulations for the combined Alternating Current (AC) Security-Constrained Unit Commitment (SCUC) and Security-Constrained Optimal Power Flow (SCOPF). The work addresses a critical challenge in power system operations: efficiently determining which generation units to commit and how to optimally dispatch them while maintaining network reliability constraints for both normal and contingency scenarios. Our efforts: 1. Advance the Understanding of SCUC/SCOPF Modeling: By introducing tighter MIP formulations and leveraging cutting-edge optimization tools (Julia/JuMP, PowerModels.jl), this project has pushed forward the state of the art in efficient power systems scheduling. 2. Enhance Technical and Economic Feasibility: The methods developed provide more accurate and potentially faster solutions to large-scale, realistic scheduling and dispatch problems in electric power systems, which can translate into improved reliability and potentially lower costs for grid operations. 3. Benefit to the Public: Greater efficiency in power system operations leads to cost savings for utilities and end-users. Improved reliability and integration of advanced modeling approaches can facilitate the adoption of clean energy resources and better accommodate uncertainties in renewable generation. Because this technology could impact bulk power markets and reliability, these innovations have far-reaching public benefits in terms of cost savings, reliability, and sustainability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Intelligent Control of Thermal Energy Storage in the Manufacturing Sector for Plant-Level Grid Response

Industrial facilities are seeking new strategies that help in providing savings mechanisms for demand charges. Demand charges are the charges incurred by industrial facilities as a result of power usage. Thermal energy storage has advanced significantly with lots of new applications, garnering the interest of many industrial facilities. These applications could be used to shave the industrial facilities’ peak electric demand and reduce their demand charges. This paper aims to demonstrate the efficacy of thermal energy storage in reducing demand charges and highlight new developments in the integration of smart control systems with thermal energy storage. The study compares energy consumption and peak demand for a facility equipped with and without thermal energy storage tanks using a fixed schedule for charging and discharging. Additionally, the paper examines the impact of incorporating a smart controller to determine when to charge and discharge the tank based on the facility’s real-time power usage and a given setpoint. The results indicate cost savings from the use of thermal energy storage tanks under two proposed scenarios, reflected in the reduced cost of power consumption for the studied facility. The incorporation of a smart controller with the thermal energy storage tank in the facility studied could provide estimated savings of 3.3% per year of power consumption charges, without considering the contribution of any incentives. The estimated savings provided by the fixed schedule scenario are 2.7% per year.

25 ENERGY STORAGE↗

Economic Dispatch Optimization of Multi-Unit SMR Site

With the increase of integration of variable renewable into the grid, grid resilience can be compromised without flexible electricity suppliers. Flexible operation of NPP can expand the scope of integration of new nuclear power plants in regions with high share of renewables. It also provides opportunity to increase profits through participation in ancillary services. In this research, NuScale modules are used as the case study. NuScale is an integrated pressurized water reactor with thermal power of 250 MWth. Having multiple units can provide higher flexibility in changing power levels and supplying the grid with electricity all year long. Additionally, load-following might perturbate the ordered sequence of refueling (every 24 months for NuScale). To maintain the 2 year refueling cycles, the loading patterns will need to be adjusted in a year-to-year basis, resulting in additional unnecessary costs. Another solution is to find the optimal outage schedule. This will also shift the focus of the planned outage to a more optimized predictive outages and maintenance. Results from short-term optimization (i.e., daily participation in energy and ancillary services markets) shows that average commitment to regulation down ancillary service markets during late night and early morning hours can increase revenues. Participating in upward reserves during pre-work commuting hours and early evening hours can also generate additional revenues due to high ramp up of electricity demand. Having multiple units at a single site can also help operate flexibly. Results from long-term optimization show that daily fluctuation in electric power is usually handled by few units while other units operate on base-load profile. It is possible to combine base-load operation with flexible operation to extend component remaining useful life in some units and find optimal outage schedule for the units.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Scaling Optimal Allocation of Cloud Resources Using Lagrange Relaxation

The rapid growth of Cloud Computing (CC) has increased the variety of computing resources, storage, and communication services that pose significant new challenges for the efficient use of cloud resources. The cost-efficient allocation of cloud resources has become a decisive premise for the adoption of CC services. The cost-efficient selection and scheduling of these resources to meet the demands of a scientific workflow is a challenging problem that is exacerbated by the inclusion of multiple CC providers. In this paper, we present a novel strategy for the cost-efficient selection of CC resources using Lagrange relaxation. Our approach is based on preselection of resources and demand decomposition to create a series of smaller sub-problems, which allow the estimation of the best cost-structures and selection of CC service providers for a subset of the time period of the planning horizon. Decomposition of the demand is achieved through the boundary analysis of a continuous relaxation of the problem. Using the metrics defined in terms of the cost and time of completion, we demonstrate excellent performance in relation to optimal solutions. Our method reduced the computational time from hours to seconds for a representative 36-month problem and provided high-quality solutions (< 0.05% relative error). Given the importance of selecting resources and scheduling complex scientific workflows, we believe that this novel strategy will be beneficial for many researchers and users of cloud computing resources.

De La Torre, Luis↗

IRIS Reimagined: Advancements in Intelligent Runtime System for Task-Based Programming

Task-based programming models are gaining traction in scientific computing. IRIS is a portable runtime system that exploits multiple heterogeneous programming systems and can discover available resources and manage multiple diverse programming systems (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, and OpenMP) simultaneously. It accounts for the constraints of task dependencies and provides customizable scheduling policies to map those tasks to heterogeneous devices. In this paper, we present new capabilities added to IRIS to improve its portability for heterogeneous programming, build-friendliness, and performance efficiency. The new additions include vendor-specific kernel support, a runtime system with a foreign function interface to eliminate writing wrapper or boilerplate code for heterogeneous kernels, an easy-to-use and configurable CMake-based build environment, automatic and efficient data transfers and orchestration, and the Hunter and DAGGER toolchains to evaluate IRIS’s task scheduling algorithms.

Miniskar, Narasinga Rao↗

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

Valuing Maintenance Strategies for Fusion Plants as Part of a Future Electricity Grid

Scheduled maintenance is likely to be lengthy and therefore consequential for the economics of fusion power plants. The maintenance strategy that maximizes the economic value of a plant depends on internal factors such as the cost and durability of the replaceable components, the frequency and duration of the maintenance blocks, and the external factors of the electricity system in which the plant operates. Here, this paper examines the value of fusion power plants with various maintenance properties in a decarbonized United States Eastern Interconnection circa 2050. Seasonal variations in electricity supply and demand mean that certain times of year, particularly spring to early summer, are best for scheduled maintenance. Seasonality has two important consequences. First, the value of a plant can be 15% higher than what one would naively expect if value were directly proportional to its availability. Second, in some cases, replacing fractions of a component in shorter maintenance blocks spread over multiple years is better than replacing it all at once during a longer outage, even through the overall availability of the plant is lower in the former scenario.

power plant, maintenance, seasonality, electricity↗

Queue wait time prediction in high performance computing (HPC) systems

High Performance Computing (HPC) systems are critical enablers for groundbreaking scientific research across various domains. Efficient resource allocation, facilitated by job scheduling, is paramount for maximizing the utilization of HPC systems. However, the variability in wait times for queued jobs poses challenges for users, necessitating accurate job wait time estimation. This paper explores the influence of job characteristics, including job size (the number of nodes requested and walltime), the queue to which the job is submitted and other resource requirements, on job wait times in leadership-class HPC systems. Focusing on the Theta Cray XC40 and Polaris machines at Argonne National Laboratory, the study evaluates the performance of different supervised learning algorithms in predicting job wait times. It also evaluates the impact of data preprocessing, including outlier detection, Principal Component Analysis (PCA), and feature selection, on the performance of wait time prediction models. The findings reveal insights into the relationship between job characteristics and wait times, offering a foundation for optimizing resource allocation and enhancing user experience. The methodologies and tools developed in this study are adaptable to other leadership-class HPC systems, providing a valuable contribution to the broader HPC community aiming to improve job scheduling efficiency and user satisfaction.

Okafor, Nwamaka↗

Ad Hoc File Systems for High-Performance Computing

Storage backends of parallel compute clusters are still based mostly on magnetic disks, while newer and faster storage technologies such as flash-based SSDs or non-volatile random access memory (NVRAM) are deployed within compute nodes. Including these new storage technologies into scientific workflows is unfortunately today a mostly manual task, and most scientists therefore do not take advantage of the faster storage media. One approach to systematically include nodelocal SSDs or NVRAMs into scientific workflows is to deploy ad hoc file systems over a set of compute nodes, which serve as temporary storage systems for single applications or longer-running campaigns. This paper presents results from the Dagstuhl Seminar 17202 “Challenges and Opportunities of User-Level File Systems for HPC” and discusses application scenarios as well as design strategies for ad hoc file systems using node-local storage media. The discussion includes open research questions, such as how to couple ad hoc file systems with the batch scheduling environment and how to schedule stage-in and stage-out processes of data between the storage backend and the ad hoc file systems. Also presented are strategies to build ad hoc file systems by using reusable components for networking and how to improve storage device compatibility. Various interfaces and semantics are presented, for example those used by the three ad hoc file systems BeeOND, GekkoFS, and BurstFS. Their presentation covers a range from file systems running in production to cutting-edge research focusing on reaching the performance limits of the underlying devices.

97 MATHEMATICS AND COMPUTING↗

Combining model-based and model-free methods for stochastic control of distributed energy resources

Modern distribution systems are experiencing a fast transformation with the growing penetration of distributed energy resources (DERs). Along with the economic and environmental benefits of DERs, challenges arise to address the uncertainties caused by their inherent volatility. If properly coordinated, however, DERs have the potential to provide the controllability that grid operators need. Here, we propose a hierarchical control framework that combines the model-based and model-free methods for stochastic DER control in distribution systems. The upper-level scheduler considers a chance-constrained optimal power flow problem (model-based) that schedules DER setpoints to minimize the operational cost and maintain the operating reserve. The lower-level distributed DER controllers absorb real-time disturbances and uncertainties using the extremum seeking control (model-free) to achieve grid objectives. The combination of model-based and model-free methods allows us to take the advantages of both methods to effectively manage the uncertainty in distribution systems. The proposed work is demonstrated on the IEEE 13-node feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Implementation and validation of optimal start control strategy for air conditioners and heat pumps

Commercial buildings are responsible for approximately 20 % of the total energy consumption and greenhouse gas emissions in the United States. Over 85 % of these buildings lack building automation systems, and many are small (<50,000 square feet), underserved, and use rooftop units (RTUs) for heating, ventilation, and air-conditioning needs. Because these buildings lack proper energy management systems, several operational deficiencies lead to excess energy consumption. Studies have shown that managing the RTUs’ heating and cooling set points, schedules, setbacks, and optimal start can result in a 20 % to 25 % reduction in electricity consumption in small commercial buildings. These buildings typically use fixed schedules to start the RTUs 60 to 120 min before occupancy begins, which results in excess energy consumption. This paper presents research that demonstrates and evaluates the performance of four optimal start methods, which utilize data-based modeling as a key element in facilitating adaptive control in response to time-varying inputs while requiring minimal sensor inputs. The evaluation found energy savings in two commercial buildings equipped with RTUs by periodically alternating four different optimal start models during the cooling and heating season. The resulting energy savings are positive for all models and range from 2 to 5 kWh/day/unit. The units on the east side of the building showed higher savings, while interior units showed greater variability in savings due to the differences in capacities and room sizes. Savings were considerably greater during the heating season compared to the cooling season. The performance of all four models on Mondays was poor; models suggested a shorter optimal start time, which resulted in relatively larger errors. Finally, the future work will look at using a different model for the days after weekends and holidays.

42 ENGINEERING↗

Shared automated vehicle fleet operations for first-mile last-mile transit connections with dynamic pooling

Shared automated vehicles (SAVs) have the potential to promote transit ridership by providing efficient first-mile last-mile (FMLM) connections through reduced operational costs to fleet providers and lower out-of-pocket costs to riders. To help plan for a future of integrated mobility, this paper investigates the impacts of SAVs serving FMLM connections, as a mode that provides flexibility in access/egress decisions and is well coordinated with train station schedules. To achieve this objective, a novel dynamic pooling algorithm was introduced to match SAVs with riders while coordinating the riders' arrival times at the light-rail station to a known train schedule. Microsimulations of SAVs and travelers throughout two central Austin neighborhoods show how larger service areas, higher levels of SAV demand, and longer arrival times between successive trains require larger SAV fleet sizes and higher SAV utilization rates to deliver close traveler wait times. Four-person SAVs appear to perform similar to 6-seat SAVs but will cost less to provide. Using a dynamic pooling algorithm tightly coordinated with train arrivals (every 15 min) delivers 87% of travelers to their stations in time to catch the next train, whereas uncoordinated assignments deliver just 58% of travelers in time.

33 ADVANCED PROPULSION SYSTEMS↗

Improving operational flexibility of integrated energy system with uncertain renewable generations considering thermal inertia of buildings

Insufficient flexibility in system operation caused by traditional "heat-set" operating modes of combined heat and power (CHP) units in winter heating periods is a key issue that limits renewable energy consumption. In order to reduce the curtailment of renewable energy resources through improving the operational flexibility, a novel optimal scheduling model based on chance-constrained programming (CCP), aiming at minimizing the lowest generation cost, is proposed for a small-scale integrated energy system (IES) with CHP units, thermal power units, renewable generations and representative auxiliary equipments. In this model, due to the uncertainties of renewable generations including wind turbines and photovoltaic units, the probabilistic spinning reserves are supplied in the form of chance-constrained; from the perspective of user experience, a heating load model is built with consideration of heat comfort and inertia in buildings. To solve the model, a solution approach based on sequence operation theory (SOT) is developed, where the original CCP-based scheduling model is tackled into a solvable mixed-integer linear programming (MILP) formulation by converting a chance constraint into its deterministic equivalence class, and thereby is solved via the CPLEX solver. We report the simulation results on the modified IEEE 30-bus system demonstrate that the presented method manages to improve operational flexibility of the IES with uncertain renewable generations by comprehensively leveraging thermal inertia of buildings and different kinds of auxiliary equipments, which provides a fundamental way for promoting renewable energy consumption.

30 DIRECT ENERGY CONVERSION↗

Large-scale scenarios of electric vehicle charging with a data-driven model of control

Transportation electrification is forecast to bring millions of new electric vehicles to roads worldwide this decade. Planning to support those vehicles depends on detailed scenarios of their electricity demand in both uncontrolled and controlled or smart charging scenarios. In this work, we present a novel modeling approach to enable rapid generation of demand estimates that represent the impact of controlled charging for large-scale scenarios with millions of individual drivers. To model the effect of load modulation control on aggregate charging profiles, we propose a novel machine learning approach that replaces traditional optimization approaches. We demonstrate its performance modeling workplace charging control under a range of electricity rate schedules, achieving small errors (2.5%–4.5%) while accelerating computations by more than 4000 times. To generate the uncontrolled charging demand for scenarios with residential, workplace, and public charging we use statistical representations of a large data set of real charging sessions. We demonstrate the methodology by generating diverse sets of scenarios for California's charging demand in 2030 which consider multiple charging segments and controls, each run locally in under 50 s. We further demonstrate support for rate design by modeling the large-scale impact of a new, custom rate schedule for workplace charging.

33 ADVANCED PROPULSION SYSTEMS↗

A novel method for co-optimizing battery sizing and charging strategy of battery electric bus fleets: An application to the city of Paris

Battery-electric buses (BEBs) are a promising technology for replacing diesel buses and reducing their environmental burden. However, their charging process can take several hours, depending on the charging technique and strategy, making them susceptible to schedule disruptions. Furthermore, the selection of the charging strategy and battery size can increase the total capital investment and operational expenses of a BEB fleet, which is a major obstacle to its adoption. Therefore, to minimize the total cost of ownership (TCO) and prevent schedule disruptions, it is essential to establish a well-defined approach to determine an appropriate battery size and charging strategy for BEB fleets. This paper presents a method for reducing the TCO of BEB by determining the optimal battery size and charging strategy for each bus while satisfying operating constraints. The method involves a two-step optimization algorithm that uses Dynamic Programming and Genetic Algorithm. Further, the study applies this approach to the bus fleet serving line 21 in Paris and generates the optimal battery sizing, charging strategy, and required charging infrastructure. The results indicate that 100 kWh batteries offer the best trade-off between capital and operational expenditure for the fleet deployment if used with 65–85 kW chargers at bus terminals.

33 ADVANCED PROPULSION SYSTEMS↗

On the operational characteristics and economic value of pumped thermal energy storage

Pumped thermal energy storage (PTES) systems use an electrically-driven heat pump to store electricity in the form of thermal energy, and subsequently dispatch the stored thermal energy to generate electricity using a thermodynamic heat engine. Optimal day-ahead operational scheduling and annual value of a PTES system based on Joule-Brayton thermodynamic cycles and two-tank molten salt hot thermal storage is evaluated in this work. Production cost models, which simultaneously optimize commitment and dispatch schedules for an entire set of generators to minimize the cost of satisfying electricity demand, are employed to determine system-optimal operation and day-ahead energy value of the PTES system within each of six hypothetical near-future grid scenarios intended to approximately represent the U.S. Western Interconnection or the Texas Interconnection. Sensitivity to grid scenario (including the contribution of variable renewable energy sources), thermal storage capacity, relative heat pump and heat engine capacities, and startup/shutdown cycling costs are evaluated. PTES energy value and heat engine annual capacity factor increase strongly as the contribution of variable renewable resources increases, heat pump capacity increases relative to heat engine capacity, or PTES cycling costs decrease. Grid scenarios in which the contribution of variable renewable energy is dominated by solar photovoltaics (PV) vs. wind produce inherently different PTES operational patterns. Annual PTES energy value within PV-dominated scenarios increased with storage capacity only up to approximately seven hours of full-load discharge capacity, whereas that within wind-dominated scenarios exhibited a continual increase with storage duration up to at least 16 hours.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Bridging paradigms: Designing for HPC-Quantum convergence

Here, this paper presents a comprehensive software stack architecture for integrating quantum computing (QC) capabilities with High-Performance Computing (HPC) environments. While quantum computers show promise as specialized accelerators for scientific computing, their effective integration with classical HPC systems presents significant technical challenges. We propose a hardware-agnostic software framework that supports both current noisy intermediate-scale quantum devices and future fault-tolerant quantum computers, while maintaining compatibility with existing HPC workflows. The architecture includes a quantum gateway interface, standardized APIs for resource management, and robust scheduling mechanisms to handle both simultaneous and interleaved quantum–classical workloads. Key innovations include: (1) a unified resource management system that efficiently coordinates quantum and classical resources, (2) a flexible quantum programming interface that abstracts hardware-specific details, (3) A Quantum Platform Manager API that simplifies the integration of various quantum hardware systems, and (4) a comprehensive tool chain for quantum circuit optimization and execution. We demonstrate our architecture through implementation of quantum–classical algorithms, including the variational quantum linear solver, showcasing the framework’s ability to handle complex hybrid workflows while maximizing resource utilization. This work provides a foundational blueprint for integrating QC capabilities into existing HPC infrastructures, addressing critical challenges in resource management, job scheduling, and efficient data movement between classical and quantum resources.

97 MATHEMATICS AND COMPUTING↗