Search NASA⌕ Search

SEARCH · Search NASA

Results for “Resource 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 541 records · Page 30

Enhanced Power Grid Maintenance Planning and Quantum-Inspired Combinatorial Prospects

Efficient and reliable scheduling of maintenance for power generation and transmission infrastructure is essential for minimizing operational costs and ensuring grid stability. This paper introduces an integrated optimization framework for coordinated maintenance scheduling of generators and transmission lines under resource and reliability constraints. The model minimizes a composite cost function including maintenance and generation costs, as well as penalties for delayed maintenance, while satisfying N−1 security constraints, operational limits, and crew availability. Case studies on the IEEE 300-bus test system demonstrate the effectiveness of the proposed approach in producing feasible and cost-effective maintenance schedules. To address scalability and combinatorial complexity, the model is mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling exploration of solution approaches based on Quantum Imaginary Time Evolution (QITE). While the QUBO reformulation provides a foundation for future quantum-inspired optimization, this study focuses primarily on the development and demonstration of the classical optimization framework and illustrates the potential applicability of QITE in large-scale maintenance scheduling.

Chen, Yang [ORNL] (ORCID:0000000271693874)↗

A sustainable genetic algorithm for satellite resource allocation

A hybrid genetic algorithm is used to schedule tasks for 8 satellites, which can be modelled as a robot whose task is to retrieve objects from a two dimensional field. The objective is to find a schedule that maximizes the value of objects retrieved. Typical of the real-world tasks to which this corresponds is the scheduling of ground contacts for a communications satellite. An important feature of our application is that the amount of time available for running the scheduler is not necessarily known in advance. This requires that the scheduler produce reasonably good results after a short period but that it also continue to improve its results if allowed to run for a longer period. We satisfy this requirement by developing what we call a sustainable genetic algorithm.

Abbott, R. J.↗

Evolution of CMS Workload Management Towards Multicore Job Support

The successful exploitation of multicore processor architectures is a key element of the LHC distributed computing system in the coming era of the LHC Run 2. High-pileup complex-collision events represent a challenge for the traditional sequential programming in terms of memory and processing time budget. The CMS data production and processing framework is introducing the parallel execution of the reconstruction and simulation algorithms to overcome these limitations. CMS plans to execute multicore jobs while still supporting singlecore processing for other tasks difficult to parallelize, such as user analysis. The CMS strategy for job management thus aims at integrating single and multicore job scheduling across the Grid. This is accomplished by employing multicore pilots with internal dynamic partitioning of the allocated resources, capable of running payloads of various core counts simultaneously. An extensive test programme has been conducted to enable multicore scheduling with the various local batch systems available at CMS sites, with the focus on the Tier-0 and Tier-1s, responsible during 2015 of the prompt data reconstruction. Scale tests have been run to analyse the performance of this scheduling strategy and ensure an efficient use of the distributed resources. This paper presents the evolution of the CMS job management and resource provisioning systems in order to support this hybrid scheduling model, as well as its deployment and performance tests, which will enable CMS to transition to a multicore production model for the second LHC run.

Perez-Calero Yzquierdo, A.↗

Optimal Energy Storage Schedules for Load Leveling and Ramp Rate Control in Distribution Systems

Continued integration of distributed energy resources (DERs) into the grid, such as solar PVs, at a large-scale, contributes into the famous Duck Curve. New DER management algorithms are therefore deemed necessary to alleviate rapid variations within net load profiles of distribution systems. Herein this paper proposes a process to determine the optimal energy storage schedules for leveling the distribution circuit feederhead net load. A series of sensitivity analyses shows how the proposed method can be used to determine the optimal energy storage schedules with different capacities, state of charge requirements, and net load ramp rate limitations.

25 ENERGY STORAGE↗

A method for interference mitigation in space communications scheduling

Increases in the number of user spacecraft and data rates supported by NASA's Tracking and Data Relay Satellite System (TDRSS) in the S and Ku bands could result in communications conflicts due to mutual interference. More attention must be paid to this problem in terms of communications scheduling. A method based on consideration of all relevant communications parameters has been developed to mitigate interference while minimizing unnecessary scheduling restrictions on both the TDRSS network and user resources. This method calculates required separation angles at TDRS and produces potential interference intervals, which can be used in the production of schedules free of unacceptable interference. The method also can be used as the basis for analysis, evaluation, and optimization of user schedules with respect to communications performance. This paper describes the method and its proposed application to scheduling in space communications. Test cases relative to missions operating at Ku-band, including Space Shuttle, are discussed.

Wong, Yen F.↗

Data Analytics Methods to Measure Plant Outage Resilience

Every 18 or 24 months nuclear power plants (depending on plant configuration, pressurized or boiling water reactor respectively) undergo a period of outage where the plant is taken offline and a large number of maintenance and surveillance activities (that cannot be performed while plant is running) are performed in typically 2–3 weeks. Planning of a plant outage is very challenging since all the activities are required to be performed in the shortest amount of time given available resources (typically contractor crews hired for the duration of the outage). Consequently, plant outages can be costly due the actual loss of power generation and crew costs and, because of it, there is a need to maximize resource usage in the outage planning phase and reduce the risk of outage delays. This paper is addressing these needs by providing a set of analytical methods designed to analyze plant outage schedule and identify critical elements based on available resources (time and crews). These methods are based on natural language processing and optimization algorithms. In this respect, two classes of methods have been developed: one that focuses on the time resource and how variability in the time to complete outage tasks may impact outage delays, and one that minimizes the risk of outage delays by integrating available resources to assess when daily activities should be performed.

97 - MATHEMATICS AND COMPUTING↗

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

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

97 MATHEMATICS AND COMPUTING↗

Idaho National Laboratory Cultural Resource Monitoring Report for 2013

This report describes the cultural resource monitoring activities of the Idaho National Laboratory’s (INL) Cultural Resource Management (CRM) Office during 2013. Throughout the year, thirty-eight cultural resource localities were revisited including: two locations with Native American human remains, one of which is also a cave; fourteen additional caves; seven prehistoric archaeological sites ; four historic archaeological sites; one historic trail; one nuclear resource (Experimental Breeder Reactor-I, a designated National Historic Landmark); and nine historic structures located at the Central Facilities Area. Of the monitored resources, thirty-three were routinely monitored, and five were monitored to assess project compliance with cultural resource recommendations along with the effects of ongoing project activities. On six occasions, ground disturbing activities within the boundaries of the Power Burst Facility/Critical Infrastructure Test Range Complex (PBF/CITRC) were observed by INL CRM staff prepared to respond to any additional finds of Native American human remains. In addition, two resources were visited more than once as part of the routine monitoring schedule or to monitor for additional damage. Throughout the year, most of the cultural resources monitored had no visual adverse changes resulting in Type 1determinations. However, Type 2 impacts were noted at eight sites, indicating that although impacts were noted or that a project was operating outside of culturally cleared limitations, cultural resources retained integrity and noted impacts did not threaten National Register eligibility. No new Type 3 or any Type 4 impacts that adversely impacted cultural resources and threatened National Register eligibility were observed at cultural resources monitored in 2013.

99 GENERAL AND MISCELLANEOUS↗

User modeling techniques for enhanced usability of OPSMODEL operations simulation software

The PC based OPSMODEL operations software for modeling and simulation of space station crew activities supports engineering and cost analyses and operations planning. Using top-down modeling, the level of detail required in the data base can be limited to being commensurate with the results required of any particular analysis. To perform a simulation, a resource environment consisting of locations, crew definition, equipment, and consumables is first defined. Activities to be simulated are then defined as operations and scheduled as desired. These operations are defined within a 1000 level priority structure. The simulation on OPSMODEL, then, consists of the following: user defined, user scheduled operations executing within an environment of user defined resource and priority constraints. Techniques for prioritizing operations to realistically model a representative daily scenario of on-orbit space station crew activities are discussed. The large number of priority levels allows priorities to be assigned commensurate with the detail necessary for a given simulation. Several techniques for realistic modeling of day-to-day work carryover are also addressed.

Davis, William T.↗

AUTOPLAN - A PC-based automated mission planning tool

A PC-based automated mission and resource planning tool, AUTOPLAN, is described, with application to small-scale planning and scheduling systems in the Space Station program. The input is a proposed mission profile, including mission duration, number of allowable slip periods, and requirement profiles for one or more resources as a function of time. A corresponding availability profile is also entered for each resource over the whole time interval under study. AUTOPLAN determines all integrated schedules which do not require more than the available resources.

Paterra, Frank C.↗

AUTOPLAN: A PC-based automated mission planning tool

A PC-based automated mission and resource planning tool, AUTOPLAN, is described, with application to small-scale planning and scheduling systems in the Space Station program. The input is a proposed mission profile, including mission duration, number of allowable slip periods, and requirement profiles for one or more resources as a function of time. A corresponding availability profile is also entered for each resource over the whole time interval under study. AUTOPLAN determines all integrated schedules which do not require more than the available resources.

Paterra, Frank C.↗

A method for interference mitigation in space communications scheduling

Increases in the number of user spacecraft and data rates supported by NASA's Tracking and Data Relay Satellite System (TDRSS) in the S and Ku bands could result in communications conflicts due to mutual interference. A method to mitigate interference while minimizing unnecessary scheduling restrictions on both TDRSS network and user resources, based on consideration of all relevant communications parameters, was developed. The steps of this method calculate required separation angles at TDRS and produce interference intervals, which can be used in the production of schedules free of unacceptable interference. The method can also be used as a basis for analysis, evaluation, and optimization of user schedules with respect to communications performance. Described here are the proposed method and its potential application to scheduling in space communications. Test cases relative to planned missions, including the Earth Observing System, the Space Station Manned Base, and the Space Shuttle are discussed.

Wong, Yen F.↗

A method for interference mitigation in space communications scheduling

Increases in the number of user spacecraft and data rates supported by NASA's Tracking and Data Relay Satellite System (TDRSS) in the S and Ku bands could result in communications conflicts due to mutual interference. A method to mitigate interference while minimizing unnecessary scheduling restrictions on both TDRSS network and user resources, based on consideration of all relevant communications parameters, was developed. The steps of this method calculate required separation angles at TDRSS and produce interference intervals, which can be used in the production of schedules free of unacceptable interference. The method also can be used as the basis for analysis, evaluation, and optimization of user schedules with respect to communications performance. Described here are the proposed method and its potential application to scheduling in space communications. Test cases relative to planned missions, including the Earth Observing System, the Space Station Manned Base, and the Space Shuttle are discussed.

Wong, Yen F.↗

Constraint monitoring in TOSCA

The Job-Shop Scheduling Problem (JSSP) deals with the allocation of resources over time to factory operations. Allocations are subject to various constraints (e.g., production precedence relationships, factory capacity constraints, and limits on the allowable number of machine setups) which must be satisfied for a schedule to be valid. The identification of constraint violations and the monitoring of constraint threats plays a vital role in schedule generation in terms of the following: (1) directing the scheduling process; and (2) informing scheduling decisions. This paper describes a general mechanism for identifying constraint violations and monitoring threats to the satisfaction of constraints throughout schedule generation.

Beck, Howard↗

System control of an autonomous planetary mobile spacecraft

The goal is to suggest the scheduling and control functions necessary for accomplishing mission objectives of a fairly autonomous interplanetary mobile spacecraft, while maximizing reliability. Goals are to provide an extensible, reliable system conservative in its use of on-board resources, while getting full value from subsystem autonomy, and avoiding the lure of ground micromanagement. A functional layout consisting of four basic elements is proposed: GROUND and SYSTEM EXECUTIVE system functions and RESOURCE CONTROL and ACTIVITY MANAGER subsystem functions. The system executive includes six subfunctions: SYSTEM MANAGER, SYSTEM FAULT PROTECTION, PLANNER, SCHEDULE ADAPTER, EVENT MONITOR and RESOURCE MONITOR. The full configuration is needed for autonomous operation on Moon or Mars, whereas a reduced version without the planning, schedule adaption and event monitoring functions could be appropriate for lower-autonomy use on the Moon. An implementation concept is suggested which is conservative in use of system resources and consists of modules combined with a network communications fabric. A language concept termed a scheduling calculus for rapidly performing essential on-board schedule adaption functions is introduced.

Dias, William C.↗

User Preference Optimization for Oversubscribed Scheduling of NASA’s Deep Space Network

NASA’s Deep Space Network (DSN) is the primary resource for communications and navigation for interplanetary space missions, for both NASA and partner agencies. Growth in mission demand, both in number of spacecraft and in data return, has led to increased loading levels on the network, and actual demand frequently exceeds network capacity. The DSN scheduling process involves peer-to-peer collaborative negotiation, which consumes significant time and resources in order to reach a baseline version of the schedule, and then to manage and agree to changes. Process delays are exacerbated by the high level of oversubscription experienced by the DSN: it is not unusual for the scheduling process to start with 20-40% more requested time can be accommodated on the available antennas. The other NASA networks make use of a static mission priority list to address a similar problem: missions are ranked in priority order, then the schedule is populated by priority from highest to lowest. Such a mechanism would not work for DSN due to the heterogeneity of the mission set, and to the time-varying mission requirements with mission phase. This paper describes an alternative approach for the DSN that addresses key problems inherent in the current process — oversubsubscription and how to “fairly” reduce it to a manageable level. The main characteristics of the new approach are the use of loading-based limits based on balancing requested time, along with priorities and user preferences as the basis for optimization criteria that can be used by new algorithms.

Johnston, Mark D↗

Bridging Equipment Reliability Data and Risk Informed Decisions in a Plant Operation Context

Industry equipment reliability and asset management programs are essential elements that help ensure the safe and economical operation of nuclear power plants. The effectiveness of these programs is addressed in several industry-developed and regulatory programs. The Risk-Informed Asset Management (RIAM) project is tasked to develop tools in support of the equipment reliability and asset management programs at nuclear power plants. These tools are designed to create a direct bridge between component health/lifecycle data and decision making (e.g., maintenance scheduling and project prioritization). The goal of this article is to provide a guide for specific use cases that the RIAM project is targeting. We have grouped uses cases into three main areas. The first area focuses on the analysis of equipment reliability data with a particular emphasis on condition-based data, such as test/surveillance reports and component monitoring data. The second area focuses on the integration of equipment reliability into system/plant reliability models to determine system/plant health and identify the components that are critical to maintain an operational system. Lastly, the third area manages plant resources, such as maintenance activities and replacement scheduling using optimization methods. Here the primary focus is on supporting typical system engineer decisions regarding maintenance activity scheduling and component aging management. This is performed in a risk-informed context where the term “risk” is broadly constructed to include both plant reliability and economics. This framework combines data analytics tools to analyze equipment reliability data with risk-informed methods designed to support system engineer decisions (e.g., maintenance and replacement schedules, optimal maintenance posture) in a customizable workflow.

97 - MATHEMATICS AND COMPUTING↗

QoS-aware edge AI placement and scheduling with multiple implementations in FaaS-based edge computing

Resource constraints on the computing continuum require that we make smart decisions for serving AI-based services at the network edge. AI-based services typically have multiple implementations (e.g., image classification implementations include SqueezeNet, DenseNet, and others) with varying trade-offs (e.g., latency and accuracy). The question then is how should AI-based services be placed across Function-as-a-Service (FaaS) based edge computing systems in order to maximize total Quality-of-Service (QoS). To address this question, we propose a problem that jointly aims to solve (i) edge AI service placement and (ii) request scheduling. These are done across two time-scales (one for placement and one for scheduling). Here we first cast the problem as an integer linear program. We then decompose the problem into separate placement and scheduling subproblems and prove that both are NP-hard. We then propose a novel placement algorithm that places services while considering device-to-device communication across edge clouds to offload requests to one another. Our results show that the proposed placement algorithm is able to outperform a state-of-the-art placement algorithm for AI-based services, and other baseline heuristics, with regard to maximizing total QoS. Additionally, we present a federated learning-based framework, FLIES, to predict the future incoming service requests and their QoS requirements. Our results also show that our FLIES algorithm is able to outperform a standard decentralized learning baseline for predicting incoming requests and show comparable predictive performance when compared to centralized training.

97 MATHEMATICS AND COMPUTING↗