Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generation 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 37 records · Page 2

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisions are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.

97 MATHEMATICS AND COMPUTING↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

Optimizing human activity patterns using global sensitivity analysis

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. Here we use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Finally, though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

97 MATHEMATICS AND COMPUTING↗

Battery Degradation Modeling in Hybrid Power Plants: An Island System Unit Commitment Study: Preprint

As hybrid power plants (HPPs), such as photovoltaic (PV) and battery combinations, become increasingly important in power systems with high renewable energy penetration to address PV variability and ensure grid stability. This paper focuses on the urgent need to model the coordination between PV and battery systems in HPPs while accounting for battery degradation. We present a generation scheduling model that explicitly incorporates PV-battery hybridization in the unit commitment problem. Moreover, the cost function of the HPP scheduling problem endogenously considers battery degradation with adjustable weights to strike a balance between minimizing production costs and prolonging battery life, particularly when providing energy arbitrage and ancillary services. Using a realistic island system simulation, we demonstrate that accounting for battery degradation in the scheduling problem can significantly extend battery life with only minor additional production costs.

battery degradation↗

A space station onboard scheduling assistant

One of the goals for the Space Station is to achieve greater autonomy, and have less reliance on ground commanding than previous space missions. This means that the crew will have to take an active role in scheduling and rescheduling their activities onboard, perhaps working from preliminary schedules generated on the ground. Scheduling is a time intensive task, whether performed manually or automatically, so the best approach to solving onboard scheduling problems may involve crew members working with an interactive software scheduling package. A project is described which investigates a system that uses knowledge based techniques for the rescheduling of experiments within the Materials Technology Laboratory of the Space Station. Particular attention is paid to: (1) methods for rapid response rescheduling to accommodate unplanned changes in resource availability, (2) the nature of the interface to the crew, (3) the representation of the many types of data within the knowledge base, and (4) the possibility of applying rule-based and constraint-based reasoning methods to onboard activity scheduling.

Brindle, A. F.↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.

Rash, James L.↗

A Java Library for the Generation and Scheduling of PTX Assembly

This paper discusses an ongoing progress regarding the development of a Java-based library for rapid kernel prototyping in NVIDIA PTX and PTX instruction scheduling. It is aimed at developers seeking total control of emitted PTX, highly parametric emission of, and tunable instruction reordering. It is primarily used for code development at ICHEC but is also hoped that NVIDIA GPU community will also find it beneficial.

Kartsaklis, Christos↗

Data-Driven Unit Commitment Refinement - a Scalable Approach for Complex Modern Power Grids

Integration of renewable generation, which is often intermittent and decentralized, substantially increases the stochasticity and complexity of power grid operations. Future power systems planning will require significant computational capability to evaluate balance between demand and supply under varying conditions, both temporally and spatially. The standard approach for generation unit commitment is to use mixed-integer linear programming to find the optimal generation schedule considering ramping and generator constraints. In the future grid this poses computational scalability challenges because generation and demand are not known with certainty due to stochasticity in weather and complexity of the grid. To address this challenge, we present a data-driven unit commitment approach that can efficiently include stochastic weather impacts and contingency considerations to improve unit commitment. Our approach uses graph-based data analytics techniques on solutions to the security constrained (and possibly stochastic) economic dispatch problem to identify potential improvements to a given unit commitment. Recent breakthroughs in fully-parallel stochastic economic dispatch software allow this approach to be scalably deployed. Simulations on synthetic South Carolina and Texas grids show this method can improve grid reliability with security constraints over a set of contingencies, while also meaningfully lowering total generation cost.

Holt, Timothy↗

Request Generation 2 mission planning and scheduling

Request Generation II (ReGe II) is a PC-based prototype knowledge based system intented to assist USAF personnel in planning and scheduling satellite operations for their Mission Control Complexes (MCC). It aids MCC personnel in producing weekly Program Action Plans (PAPs) for each of the satellite vehicles an MCC is responsible for monitoring and maintaining. The PAPs are input to the Resource Control Complex (RCC) which schedules all satellite support requests for usage of the network.

Greenhut, Darlene D.↗

Control and Size Energy Storage for Managing Energy balance of Variable Generation Resources

This paper presents control algorithms and sizing strategies for using energy storage to manage energy balance for variable generation resources. The control objective is to minimize the hourly generation imbalance between the actual and the scheduled generation of the wind farm. Three control algorithms are compared: tracking power imbalance, post-compensation, and pre-compensation. Measurement data from a wind farm located in South-central Washington State are used in the study. The results show that tracking power imbalance yields the best performance by keeping the hourly energy imbalances zero. However, the energy storage system (ESS) will be significantly oversized. Post-compensation reduces power rating of the ESS but the hourly imbalance may not be kept as zero when large and long-lasting energy imbalances occur. A linear regression forecasting algorithm is developed for the pre-compensation algorithm to pre-charge or pre-discharge the ESS based on predicted energy imbalances. The performance comparison shows that the pre-compensation method significantly reduces the size of the ESS while maintaining satisfactory performance.

ENERGY MANAGEMENT↗

A practical approach to astronomy mission replanning

The schedule editing concept called EDTRON is presented and its features and functions in the overall mission planning scheme and the experience obtained from its first use during the Astro-1 mission are presented. This EDTRON program was designed specifically to edit the astronomy schedules generated by the ASTAR project, but any schedule with the same on/off format can be successfully changed. Though designed for the real-time environment concept, it can also be employed premission for schedule modification in situations where elements of the baseline schedule need to be preserved or when new requirements emerge that cannot be defined in existing scheduling algorithms.

Guffin, O. T.↗

ComStock Measure Documentation: Thermostat and Lighting Control for Load Shedding + Photovoltaics With 40% Rooftop Coverage

This report describes the modeling methodology for an upgrade package of two end-use savings shape measures - Thermostat Control for Load Shedding and Lighting Control for Load Shedding - and briefly introduces key results. The package combines thermostat control for load shedding, lighting control for load shedding, and PV with 40% rooftop coverage measures to reduce the net building load during the building's electricity peak window every weekday. The measure takes daily peak load schedule inputs generated by the method "Dispatch Schedule Generation" described in the "Supplemental Documentation: Dispatch Schedule Generation for Demand Flexibility Measures" to determine the start and end times of the predicted peak window, and then relaxes the thermostat setpoints and dims the lighting level from the original schedules during the peak window to reduce the peak demand, while applying the fixed rooftop PV application for onsite electricity generation. The measure is applicable to (large, medium and small) offices, warehouses, and primary and secondary schools, which correspond to approximately 68% of the stock floor area of commercial buildings in ComStock analysis. The measure demonstrates 5%-15% daily peak demand reduction performance for applicable buildings, and around 1% total site energy savings (0 trillion British thermal units [TBtu]) for the U.S. commercial building stock modeled in ComStock.

14 SOLAR ENERGY↗

End-Use Savings Shapes Measure Documentation: Thermostat Control for Load Shedding in Large Offices

This documentation focuses on a single End-Use Savings Shape measure - thermostat control for load shedding. The thermostat control for load shedding measure applies heating and cooling temperature setpoint offsets for reducing the heating and cooling load during peak window. The measure takes daily peak load schedule inputs generated by the method "Dispatch Schedule Generation" described in the "Supplemental Documentation: Dispatch Schedule Generation for Demand Flexibility Measures" to determine the start and end times of the peak window, and then adjusts the thermostat cooling and/or heating setpoints by an offset value from original schedules during the peak window to reduce the HVAC or whole building daily peak load. The measure is flexible and allows users to adjust the heating and cooling offset values respectively, but for this study, the adjustment for heating and cooling setpoints are set to -2 degrees Celsius and +2 degrees Celsius by default. The measure provides options of adding rebound control period (default 2 hours) after peak windows for the setpoints to be ramped back to default values, to prevent the system from generating higher peak demand with step changes of setpoints in post-peak periods . This measure is applicable t o large offices equipped with electric HVAC system (either electric cooling only or both electric heating and cooling), which account for approximately 8.72% of the ComStock floor area. The thermostat control for load shedding measure demonstrates 2-5% daily peak demand reduction and 0.068% total site energy savings (3 trillion British thermal units [TBtu]) for the U.S. commercial building stock modeled in ComStock.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

End-Use Savings Shapes Measure Documentation: Thermostat Control for Load Shifting in Large Offices

This documentation focuses on a single end-use savings shape measure - thermostat control for load shifting. The thermostat control for load shifting measure applies heating and cooling temperature setpoint adjustment for pre-conditioning before the peak window. The measure takes daily peak load schedule inputs generated by the method "Dispatch Schedule Generation" described in the "Supplemental Documentation: Dispatch Schedule Generation for Demand Flexibility Measures" to determine the start time of the peak window, and then adjusts the thermostat cooling or heating setpoints by a specified offset value from original schedules to precool or preheat the space , for a specified length of time before the start of peak window, and thus shifts load in the peak window to the pre-conditioning period. The measure is flexible and allows users to adjust the heating and cooling offset values and length of pre-conditioning period, but for this study, the load shifting strategy is applied as pre-cooling only (adjusting only cooling setpoints). The default adjustment for cooling setpoints is set to -1 degrees Celsius , and the default duration of pre-cooling is 1 hour. This measure is applicable to large offices equipped with electric HVAC system, which account for approximately 8.72% of the ComStock floor area. The thermostat control for load shifting measure demonstrates -1% daily peak demand reduction and 0% total site energy savings (0 trillion British thermal units [TBtu]) for the U.S. commercial building stock modeled in ComStock.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

ComStock Measure Documentation: Lighting Control for Load Shedding

This report describes the modeling methodology for a single end-use savings shape measure - lighting control for load shedding - and briefly introduces key results. The lighting control for load shedding measure applies lighting dimming control to reduce the lighting load during the building's electricity peak window every weekday. The measure takes daily peak load schedule inputs generated by the method "Dispatch Schedule Generation" described in the "Supplemental Documentation: Dispatch Schedule Generation for Demand Flexibility Measures" to determine the start and end times of the predicted peak window, and then adjusts the lighting dimming level by a percentage reduction from the original schedules during the peak window to reduce the peak demand. The measure is applicable to (large, medium and small) offices, warehouses, and primary and secondary schools, which correspond to approximately 68% of the stock floor area of commercial buildings in ComStock analysis. The measure demonstrates 2%-7% daily peak demand reduction performance for applicable buildings, and 0.43% total site energy savings (0 trillion British thermal units [TBtu]) for the U.S. commercial building stock modeled in ComStock.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

ComStock Measure Documentation: Thermostat and Lighting Control for Load Shedding

This report describes the modeling methodology for an upgrade package of two end-use savings shape measures - Thermostat Control for Load Shedding and Lighting Control for Load Shedding - and briefly introduces key results. The package combines thermostat control for load shedding and lighting control for load shedding measures to reduce the HVAC and lighting load during the building's electricity peak window every weekday. The measure takes daily peak load schedule inputs generated by the method "Dispatch Schedule Generation" described in the "Supplemental Documentation: Dispatch Schedule Generation for Demand Flexibility Measures" to determine the start and end times of the predicted peak window, and then relaxes the thermostat setpoints and dims the lighting level from the original schedules during the peak window to reduce the peak demand. The measure is applicable to (large, medium and small) offices, warehouses, and primary and secondary schools, which correspond to approximately 68% of the stock floor area of commercial buildings in ComStock analysis. The measure demonstrates 3%-10% daily peak demand reduction performance for applicable buildings, and 0.97% total site energy savings (0 trillion British thermal units [TBtu]) for the U.S. commercial building stock modeled in ComStock.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Integrated resource scheduling in a distributed scheduling environment

The Space Station era presents a highly-complex multi-mission planning and scheduling environment exercised over a highly distributed system. In order to automate the scheduling process, customers require a mechanism for communicating their scheduling requirements to NASA. A request language that a remotely-located customer can use to specify his scheduling requirements to a NASA scheduler, thus automating the customer-scheduler interface, is described. This notation, Flexible Envelope-Request Notation (FERN), allows the user to completely specify his scheduling requirements such as resource usage, temporal constraints, and scheduling preferences and options. The FERN also contains mechanisms for representing schedule and resource availability information, which are used in the inter-scheduler inconsistency resolution process. Additionally, a scheduler is described that can accept these requests, process them, generate schedules, and return schedule and resource availability information to the requester. The Request-Oriented Scheduling Engine (ROSE) was designed to function either as an independent scheduler or as a scheduling element in a network of schedulers. When used in a network of schedulers, each ROSE communicates schedule and resource usage information to other schedulers via the FERN notation, enabling inconsistencies to be resolved between schedulers. Individual ROSE schedules are created by viewing the problem as a constraint satisfaction problem with a heuristically guided search strategy.

Zoch, David↗