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 271 records · Page 15

Maximally Expressive Modeling of Operations Tasks

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed, the information sought is at the cutting edge of scientific endeavor, and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a "maximally expressive" modeling schema.

Jaap, John↗

Maximally Expressive Modeling

Planning and scheduling systems organize tasks into a timeline or schedule. Tasks are logically grouped into containers called models. Models are a collection of related tasks, along with their dependencies and requirements, that when met will produce the desired result. One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed; the information sought is at the cutting edge of scientific endeavor; and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a maximally expressive modeling schema.

Jaap, John↗

Enhanced deep neural networks with transfer learning for distribution LMP considering load and PV uncertainties

As the flexibility of generation and demand increases in distribution systems, the residential loads are emerging as a promising means to participate in demand response and the transactive energy market. Market pricing is an instrumental mechanism for the distribution system operator to exploit the full potential of the flexible resources. The distribution locational marginal price (DLMP) can be used to guide the residential load consumption. This type of market signal helps the distribution system operator to optimize the scheduling of all resources while satisfying related network constraints through a day-ahead market. However, solving the optimization problem for large-scale systems can be computationally expensive. To address the scalability and practicability limitations of the DLMP framework, a learning-based approach is proposed in this paper to complement the day-ahead distribution market framework. Here, the proposed approach combines long short-term memory and transfer learning to develop deep neural network that can capture the spatial–temporal correlation of the input data. The model can determine the optimal DLMP for each node in a distribution system without the system parameters required to formulate the optimization problem. Testing results on IEEE 33-bus and 123-bus systems show that the proposed approach can generate a comparable DLMP against the optimization solutions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A study of the relativistic rise in ionization as measured by ion chambers of different design

Techniques for scheduling with resource-constraints are investigated. In particular, the use of zero-one programming and dispatching methods are discussed. An algorithm which combines characteristics of both existing methods to generate a valid schedule to experiments is introduced. Examples and test results are presented to illustrate the feasibility of the use of this algorithm on data typical to Spacelab missions.

Shand, J. B., Jr.↗

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

negotiation↗

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

Sadovsky, A.↗

Scheduling Spitzer: The SIRPASS Story

NASA's Spitzer Space Telescope was launched on August 25, 2003 from Florida's Cape Canaveral Air Force Base. Drifting in a unique Earth-trailing orbit around the Sun, Spitzer sees an optically invisible universe dominated by dust and stars. Since 1997, the Spitzer Integrated Resource Planning and Scheduling System (SIRPASS) has helped produce spacecraft activity plans for the Spitzer Space Telescope. SIRPASS is used by members of the Observatory Planning and Scheduling Team to plan, schedule and sequence the Telescope from data made available to them from the science and engineering community. Because of the volume of data that needs to be scheduled, SIRPASS offers a variety of automated assistants to aid in this task. This paper will describe the functional elements of the SIRPASS software system -- emphasizing the role that automation plays in the system -- and will highlight lessons learned for the software developer from a decade of Spitzer Space Telescope operations experience.

flight systems↗

Power, data latency, and radio frequnecy interference issues in Mars Realy Network scheduling

At different time periods in the future, missions to Mars will overlap. Previous studies indicate that during such periods, existing deep space communication infrastructure cannot handle all Mars communication needs. A plausible solution is to take into account the end-to-end communication performances of network along with operational constraints, and optimize the resource usage by scheduling communication at highest possible data throughputs. As a result, shorter communication time is required and more missions can be accommodated. This principle is demonstrated in this paper for a Mars relay communication network; a network consisting of multiple surface units and orbiters on Mars and the Deep Space Stations.

power latency RFI Mars Relay Network scheduling↗

Maximally Expressive Task Modeling

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiment activities for the Space Station. The equipment used in these experiments is some of the most complex hardware ever developed by mankind, the information sought by these experiments is at the cutting edge of scientific endeavor, and the procedures for executing the experiments are intricate and exacting. Scheduling is made more difficult by a scarcity of space station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling space station experiment operations calls for a "maximally expressive" modeling schema. Modeling even the simplest of activities cannot be automated; no sensor can be attached to a piece of equipment that can discern how to use that piece of equipment; no camera can quantify how to operate a piece of equipment. Modeling is a human enterprise-both an art and a science. The modeling schema should allow the models to flow from the keyboard of the user as easily as works of literature flowed from the pen of Shakespeare. The Ground Systems Department at the Marshall Space Flight Center has embarked on an effort to develop a new scheduling engine that is highlighted by a maximally expressive modeling schema. This schema, presented in this paper, is a synergy of technological advances and domain-specific innovations.

Japp, John↗

FASTER -- A Tool for DSN Forecasting and Scheduling

FASTER (Forecasting And Scheduling Tool for Earth-based Resources) is a suite of tools designed for forecasting and scheduling of JPL's DSN. The DSN is a set of antennas and other associated resources that must be scheduled for satellite communications, astronomy, maintenance, and testing. FASTER is a MS-Windows based program that replaces two existing programs (RALPH and PC4CAST). FASTER was designed to be more flexible, maintainable, and user friendly. FASTER makes heavy use of commercial software to allow for customization by users. FASTER implements scheduling as a two pass process: the first pass calculates a predictive profile of resource utilization; the second pass uses this information to calculate a cost function used in a dynamic programming optimization step. This information allows the scheduler to "look ahead" at activities that are not as yet scheduled. FASTER has succeeded in allowing wider access to data and tools, reducing the amount of effort expended and increasing the quality of analysis.

forecasting↗

SCUC-DER Integration Report: Integrating Distributed Energy Resources (DER) Using Advanced Unit Commitment Models and DER Aggregation Methodologies

Distributed energy resources (DERs) are continuing to grow due to regulatory, policy, and market shifts, and it needs to be ensured that small DERs are given a level playing field with traditional resources. Legacy market processes such as unit-commitment problems were designed for a power grid consisting largely of centralized power plants. In contrast, DERs consist of many small devices with distinct operating characteristics that may or may not be connected at the transmission interconnection points, limiting their visibility to the independent system operators (ISOs) who operate wholesale electricity markets. This report details the development and initial results from a simulation platform that integrates state-of-the-art security-constrained unit commitment software, detailed feeder models, and a DER aggregator model to quantify potential DER integration issues. Quantitative results to date illustrate potential infeasible scheduling solutions from SCUC when the DERA includes aggregations of energy-limited energy storage resources. Likewise, if aggregations are not penalized for dispatch deviations, they may have incentives to deviate from the SCUC-determined resource schedules. Assumptions about the amount of aggregated demand response resources (DRRs) and the ability of DERAs to follow profit incentives have an important impact – DRRs have significant flexibility and can typically feasibly meet their SCUC schedule, but on the other hand, their profit incentives can cause unscheduled increases in load before and after DRR dispatch. Computation time results on the SCUC solver and simulation platform only show a modest increase in SCUC solution time as the number of DERAs is increased, but results to date only reflect the RTS-GMLC test system; results may show more significant solver slowdown in larger transmission systems. The largest contribution to simulation time is attributed to the DERA offer generation method, which is suggested for future improvements.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Cram

Large-scale systems like Sequoia allow running small numbers of very large (1M+ process) jobs, but their resource managers and schedulers do not allow large numbers of small (4, 8, 16, etc.) process jobs to run efficiently. Cram is a tool that allows users to launch many small MPI jobs within one large partition, and to overcome the limitations of current resource management software for large ensembles of jobs.

Gamblin, T.↗

Cram

Large-scale systems like Sequoia allow running small numbers of very large (1M+ process) jobs, but their resource managers and schedulers do not allow large numbers of small (4, 8, 16, etc.) process jobs to run efficiently. Cram is a tool that allows users to launch many small MPI jobs within one large partition, and to overcome the limitations of current resource management software for large ensembles of jobs.

Gamblin, T.↗

FASTER - A tool for DSN forecasting and scheduling

FASTER (Forecasting And Scheduling Tool for Earth-based Resources) is a suite of tools designed for forecasting and scheduling JPL's Deep Space Network (DSN). The DSN is a set of antennas and other associated resources that must be scheduled for satellite communications, astronomy, maintenance, and testing. FASTER consists of MS-Windows based programs that replace two existing programs (RALPH and PC4CAST). FASTER was designed to be more flexible, maintainable, and user friendly. FASTER makes heavy use of commercial software to allow for customization by users. FASTER implements scheduling as a two pass process: the first pass calculates a predictive profile of resource utilization; the second pass uses this information to calculate a cost function used in a dynamic programming optimization step. This information allows the scheduler to 'look ahead' at activities that are not as yet scheduled. FASTER has succeeded in allowing wider access to data and tools, reducing the amount of effort expended and increasing the quality of analysis.

Werntz, David↗

Endogenous Interface Pricing for Consistent Transmission–Distribution Co-Optimization With Discrete Distribution Controls

This paper proposes an endogenous interface pricing model for day-ahead transmission–distribution co-optimization that co-determines the interface locational marginal price (LMP) and the transmission–distribution exchange, ensuring price–dispatch consistency while optimally scheduling discrete distribution controls. The formulation couples a DC optimal power flow (OPF) with a branch-flow AC OPF that schedules distributed energy resources (DERs), tap-changer settings, capacitor banks (CBs), and multi-period energy storage systems (ESSs) under feeder voltage and current limits, and is solved as a mixed-integer second-order cone program (MISOCP). In a T14–D33 system, coordinated device scheduling recovers about 90% of the distribution-to-transmission export achievable in a reference case that ignores distribution network (DN) limits, while satisfying a 1.05 p.u. voltage upper bound. In a T39–D34/D37/D123 system, a sequential decoupled benchmark produces interface LMP distortions up to 12.5% and a 7.28% mismatch in net export energy, whereas the proposed model removes these distortions and the associated settlement mismatches. Second-order cone (SOC) relaxation gaps remain below $10^{-3}$ in all cases.

Noh, Seung-Gil↗

Tactical Surface Metering Procedures for Charlotte Douglas International Airport

NASA has been collaborating with the Federal Aviation Administration (FAA) and aviation industry partners to develop and demonstrate new concepts and technologies for the Integrated Arrival, Departure, and Surface (IADS) traffic management capabilities under the Airspace Technology Demonstration 2 (ATD-2) project. The primary goal of the ATD-2 project is to improve the predictability and the operational efficiency of the air traffic system in metroplex environments while maintaining or improving throughput by enhancing and integrating arrival, departure and surface prediction, scheduling, and management systems. In the Phase 1 Baseline IADS Demonstration, the tactical surface scheduling capability and the user interfaces for ramp controllers and ramp traffic managers were implemented for ramp operations. The purpose of the tactical surface scheduling capability is to provide the airline ramp controller with aircraft pushback advisories that prevent surface congestion and to respond to surface and airspace constraints that become known over relatively short time horizons. For this purpose, the tactical surface metering tool first estimates the capacity of current and near-future runway resources from flight schedule and surveillance data. With demand forecasts and predicted taxi trajectories, this tool computes an efficient runway schedule of aircraft in the planning horizon based on their readiness, Earliest Off-Block Times (EOBTs), and a ration by schedule (RBS) rule. Details on the implementation of the Tactical Surface Metering tool will be provided in the full paper. Both pushback and recommended hold times advisories provided by this surface metering tool are shown on the user interfaces for the ramp controller and the ramp traffic manager, called Ramp Traffic Console (RTC) and Ramp Manager Traffic Console (RMTC), respectively. There is excess queue time in the system due to demand capacity imbalance, this time can be taken as a hold on the runway queue or at the gate and was referred to as the Metering Value. This metering value can be adjusted by the Ramp Manager in collaboration with Air Traffic Controller-Tower Traffic Management Coordinator (TMC). They selected a set of metering values as default values for the tool during human-in-the-loop simulation. As the metering value increases, there is a decrease in the gate hold and increase in the queue time at the runway. Procedures and Information needs related to managing the surface metering procedures were researched in the simulated environment. These procedures will be compared to the procedures adopted at Charlotte Douglas International Airport when the tools were deployed and adopted in November 2017 for one departure push bank per day. Feedback regarding initial issues, information needs such as the need to see EOBTs on the flight data tags and how they compare to scheduled times will also be discussed in the full paper. Initial results will be provided regarding the choice of the metering value and how it was adjusted on a daily basis and what procedures evolved will also be presented in the paper.

surface metering↗

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↗

Advanced Performance Modeling with Combined Passive and Active Monitoring

To improve the efficiency of resource utilization and scheduling of scientific data transfers on high-speed networks, the "Advanced Performance Modeling with combined passive and active monitoring" (APM) project investigates and models a general-purpose, reusable and expandable network performance estimation framework. The predictive estimation model and the framework will be helpful in optimizing the performance and utilization of networks as well as sharing resources with predictable performance for scientific collaborations, especially in data intensive applications. Our prediction model utilizes historical network performance information from various network activity logs as well as live streaming measurements from network peering devices. Historical network performance information is used without putting extra load on the resources by active measurement collection. Performance measurements collected by active probing is used judiciously for improving the accuracy of predictions.

97 MATHEMATICS AND COMPUTING↗