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 37 records · Page 2

Analysis of Strategic Conflict Management Approaches as Applied to Simulated UAM Operations

This report presents the results of a comparison analysis of candidate Strategic Conflict Management (SCM) strategies as applied to Urban Air Mobility (UAM) operations. The SCM strategies investigated included: no SCM, resource scheduling (RS), resource flow rates (FR), area-based flow rates (AR), and conflict detection and resolution (CR). The study evaluated each strategy against the same 3 levels of flight demand in a representative airspace construct for the Dallas/Fort Worth region. The study also accounted for different levels of uncertainty in operational planning and equivalent levels of trajectory following error. In the analysis, we compared the SCM strategies’ effectiveness in reducing the need for the tactical conflict management layer to act and looked at the metrics of unmitigated losses-of-separation (LOS), flight delays imposed by strategic planning, and throughput of the overall airspace. The study results indicated that the CR strategy was the most effective at reducing LOS and percentage of flights with LOS, even in the presence of trajectory error when uncertainty is accounted for in planning. Thus, if the objective is to reduce the number of actions that the tactical conflict management layer will have to take, in terms of conflicts that may need to be resolved, CR is the strategy to use. The FR strategy was found to be the worst at reducing LOS and percentage of flights with LOS. Thus, it is not very effective at reducing the actions required by a tactical conflict management layer. In the airspace tested, the demand was high enough to produce unacceptable levels of flight delay and reductions of throughput when the SCM strategies were implemented. This was especially evident at the higher levels of trajectory uncertainty and error. The need to account for expected levels of uncertainty becomes more and more important as the demand level increases and as the level of trajectory error increases. This is because the likelihood of flights with LOS increases as the density of operations increases and as the level of trajectory error increases. Accounting for uncertainty in the SCM strategies improves the strategy effectiveness with respect to LOS but increases delays and reduces throughput. Thus, there is a tradeoff between scalability and allowable levels of uncertainty. That is, we can implement an air traffic management construct that allows high levels of uncertainty, but we can expect that same system to have limits on scalability that may be evident even at small demand levels, such as those used in this study. Therefore, the results in this study indicate that an air traffic system should attempt to implement mechanisms appropriate for reducing uncertainty where possible in order to increase the chances for scalability. And this increased level of predictability of operations needs to be balanced with mechanisms for ensuring flexibility when operational conditions and plans need to change, even though those types of changes should be the exception rather than the rule under normal conditions. The study also introduced a trade space that could serve as a mechanism for selecting the appropriate SCM strategy in a trade-off between uncertainty and error, mean flight delay, and the LOS metrics (which this study equates to the potential for tactical conflict management actions). The optimal solution for a given airspace, demand level, and other factors, could likely be a combination of SCM strategies, although this study only compared the use of a single SCM strategy at a time. The CR strategy appeared to have the best opportunity for scalability by limiting the number of potential tactical actions to nearly zero.

Strategic Conflict Management↗

Generation and exploration of aggregation abstractions for scheduling and resource allocation

This paper presents research on the abstraction of computational theories for scheduling and resource allocation. The paper describes both theory and methods for the automated generation of aggregation abstractions and approximations in which detailed resource allocation constraints are replaced by constraints between aggregate demand and capacity. The interaction of aggregation abstraction generation with the more thoroughly investigated abstractions of weakening operator preconditions is briefly discussed. The purpose of generating abstract theories for aggregated demand and resources includes: answering queries about aggregate properties, such as gross feasibility; reducing computational costs by using the solution of aggregate problems to guide the solution of detailed problems; facilitating reformulating theories to approximate problems for which there are efficient problem-solving methods; and reducing computational costs of scheduling by providing more opportunities for variable and value-ordering heuristics to be effective. Experiments are being developed to characterize the properties of aggregations that make them cost effective. Both abstract and concrete theories are represented in a variant of first-order predicate calculus, which is a parameterized multi-sorted logic that facilitates specification of large problems. A particular problem is conceptually represented as a set of ground sentences that is consistent with a quantified theory.

Lowry, Michael R.↗

Integrated scheduling and resource management

This paper examines the problem of integrated scheduling during the Space Station era. Scheduling for Space Station entails coordinating the support of many distributed users who are sharing common resources and pursuing individual and sometimes conflicting objectives. This paper compares the scheduling integration problems of current missions with those anticipated for the Space Station era. It examines the facilities and the proposed operations environment for Space Station. It concludes that the pattern of interdependecies among the users and facilities, which are the source of the integration problem is well structured, allowing a dividing of the larger problem into smaller problems. It proposes an architecture to support integrated scheduling by scheduling efficiently at local facilities as a function of dependencies with other facilities of the program. A prototype is described that is being developed to demonstrate this integration concept.

Ward, M. T.↗

Distributed scheduling with COMPASS

COMPASS (COMPuter Aided Scheduling System) is a sophisticated, interactive scheduling tool used within NASA. Like most existing tools, however, COMPASS is a single-user application. There is a large class of scheduling problems which may be better solved by allowing several people at various locations to build separate schedules with shared resources. DISCORS (DIStributed COmputer Resource Scheduling) is a set of services which support a distributed version of COMPASS. This architecture naturally accommodates the integration of user-defined resource models without modifying COMPASS. DISCORS services include the ability to establish and manage communications, to code messages in efficient formats, to provide fault detection and recovery, and to configure schedulers across a network. In its present form, DISCORS effectively supports distributed COMPASS, but fails to run fast and to guarantee efficient schedules. Further enhancements may allow several users to simultaneously and interactively work together to create complex schedules while COMPASS detects and coordinates the resolution of conflicting requests.

Rufat-Latre, Jorge↗

Fermilab HEPCloud Facility Decision Engine Design

The Decision Engine is a critical component of the HEP Cloud Facility. It provides the functionality of resource scheduling for disparate resource providers, including those which may have a cost or a restricted allocation of cycles. Along with the architecture, design, and requirements for the Decision Engine, this document will provide the rationale and explanations for various design decisions. In some cases, requirements and interfaces for a limited subset of external services will be included in this document. This document is intended to be a high level design. The design represented in this document is not complete and does not break everything down in detail. The class structures and pseudo-code exist for example purposes to illustrate desired behaviors, and as such, should not be taken literally. The protocols and behaviors are the important items to take from this document. This project is still in prototyping mode so flaws and inconsistencies may exist and should be noted and treated as failures.

97 MATHEMATICS AND COMPUTING↗

Collectives for Multiple Resource Job Scheduling Across Heterogeneous Servers

Efficient management of large-scale, distributed data storage and processing systems is a major challenge for many computational applications. Many of these systems are characterized by multi-resource tasks processed across a heterogeneous network. Conventional approaches, such as load balancing, work well for centralized, single resource problems, but breakdown in the more general case. In addition, most approaches are often based on heuristics which do not directly attempt to optimize the world utility. In this paper, we propose an agent based control system using the theory of collectives. We configure the servers of our network with agents who make local job scheduling decisions. These decisions are based on local goals which are constructed to be aligned with the objective of optimizing the overall efficiency of the system. We demonstrate that multi-agent systems in which all the agents attempt to optimize the same global utility function (team game) only marginally outperform conventional load balancing. On the other hand, agents configured using collectives outperform both team games and load balancing (by up to four times for the latter), despite their distributed nature and their limited access to information.

Tumer, K.↗

Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications scheduling.

Short, Nick, Jr.↗

Automated power management and control

A comprehensive automation design is being developed for Space Station Freedom's electric power system. A joint effort between NASA's Office of Aeronautics and Exploration Technology and NASA's Office of Space Station Freedom, it strives to increase station productivity by applying expert systems and conventional algorithms to automate power system operation. The initial station operation will use ground-based dispatches to perform the necessary command and control tasks. These tasks constitute planning and decision-making activities that strive to eliminate unplanned outages. We perceive an opportunity to help these dispatchers make fast and consistent on-line decisions by automating three key tasks: failure detection and diagnosis, resource scheduling, and security analysis. Expert systems will be used for the diagnostics and for the security analysis; conventional algorithms will be used for the resource scheduling.

Dolce, James L.↗

Experiences with Testing the Largest Ground System NASA Has Ever Built

In the 1980s, the National Aeronautics and Space Administration (NASA) embarked upon a major Earth-focused program called Mission to Planet Earth. The Goddard Space Flight Center (GSFC) was selected to manage and develop a key component - the Earth Observing System (EOS). The EOS consisted of four major missions designed to monitor the Earth. The missions included 4 spacecraft. Terra (launched December 1999), Aqua (launched May 2002), ICESat (Ice, Cloud, and Land Elevation Satellite, launched January 2003), and Aura (scheduled for launch January 2004). The purpose of these missions was to provide support for NASA s long-term research effort for determining how human-induced and natural changes affect our global environment. The EOS Data and Information System (EOSDIS), a globally distributed, large-scale scientific system, was built to support EOS. Its primary function is to capture, collect, process, and distribute the most voluminous set of remotely sensed scientific data to date estimated to be 350 Gbytes per day. The EOSDIS is composed of a diverse set of elements with functional capabilities that require the implementation of a complex set of computers, high-speed networks, mission-unique equipment, and associated Information Technology (IT) software along with mission-specific software. All missions are constrained by schedule, budget, and staffing resources, and rigorous testing has been shown to be critical to the success of each mission. This paper addresses the challenges associated with the planning, test definition. resource scheduling, execution, and discrepancy reporting involved in the mission readiness testing of a ground system on the scale of EOSDIS. The size and complexity of the mission systems supporting the Aqua flight operations, for example, combined with the limited resources available, prompted the project to challenge the prevailing testing culture. The resulting success of the Aqua Mission Readiness Testing (MRT) program was due in no small measure to re-structuring the traditional programmatic and technical approach to a more efficient and robust program. Programmatically, it meant gaining the endorsement, commitment, and cooperation of the numerous subsystem element managers and other stakeholder organizations. Technically, it required an MRT program that was agile, could rapidly adapt to requirements changes, and was flexible in its overall approach. Furthermore, this paper addresses the following questions: 1. What are the key ingredients (e.g., test tools, organization) needed to conduct a successful MRT program? 2. What distinguishes EOS MRT from the traditional system testing approach? 3. Where should the focus of testing be since it is infeasible to test every element or subsystem? 4. How can MRT be applied effectively to other systems or missions? To provide answers to these questions, this paper relies heavily on real-life, hands-on experiences ("lessons learned") gained during mission readiness testing of the Terra ground system and, most recently, the Aqua and ICESat missions. Moreover, this paper explores how lessons learned were turned into lessons applied for the upcoming Aura mission. Although derived from the EOS missions, MRT techniques and strategies can be applied to enhance the testing of other missions.

Lehtonen, Ken↗

Introduction to Air Traffic Management

The presentation introduces students and faculty to air traffic management with focus on air traffic data for data-science. Starting with the common attributes of transportation systems — highway transportation, air transportation and data transportation, the initial set of slides discuss the purpose of data-science in air traffic management, reasons why air traffic management is challenging, and the multidisciplinary nature of air traffic management research. The history of flight from 1903 — Wright Flyer — to 1987 — formation of the National Air Traffic Controllers Association — is briefly discussed. The national airspace system is described in terms of airports in the U. S., air traffic control facilities (flight service stations, terminal, enroute and system command center), airspace geometry (sectors, airways and navaids), governing regulations and directives, airspace classification (Class A through G), special use airspace, visual flight rules and instrument flight rules. The contents of a flight-plan are described. Weather briefing is discussed. The surveillance equipment used for surface, terminal area and enroute are described, and the aircraft states obtained using the surveillance data are listed. Airline operations control functions — schedule development, flight planning, resource scheduling and flight following — are noted. Next, the roles and responsibilities of air traffic controllers and traffic flow managers are discussed. Separation standards and conflict resolution techniques are outlined. Finally, traffic flow management techniques are reviewed with an illustrative example.

Air Traffic Management↗

Introduction to Air Traffic Management

The presentation introduces students and faculty to air traffic management with focus on air traffic data for data-science. Starting with the common attributes of transportation systems — highway transportation, air transportation and data transportation, the initial set of slides discuss the purpose of data-science in air traffic management, reasons why air traffic management is challenging, and the multidisciplinary nature of air traffic management research. The history of flight from 1903 — Wright Flyer — to 1987 — formation of the National Air Traffic Controllers Association — is briefly discussed. The national airspace system is described in terms of airports in the U. S., air traffic control facilities (flight service stations, terminal, enroute and system command center), airspace geometry (sectors, airways and navaids), governing regulations and directives, airspace classification (Class A through G), special use airspace, visual flight rules and instrument flight rules. The contents of a flight-plan are described. Weather briefing is discussed. The surveillance equipment used for surface, terminal area and enroute are described, and the aircraft states obtained using the surveillance data are listed. Airline operations control functions — schedule development, flight planning, resource scheduling and flight following — are noted. Next, the roles and responsibilities of air traffic controllers and traffic flow managers are discussed. Separation standards and conflict resolution techniques are outlined. Finally, traffic flow management techniques are reviewed with an illustrative example.

Air Traffic Management↗

The problem analysis of data processing performance in nuclear power plant computerized information and control system - 288

This paper is based on the data processing performance problems of operating command delay and system display not updating real-time for nuclear power plant computerized information and control system. The plant computerized information and control system is responsible for monitoring and controlling the plant operation, and it is a key part in the plant DCS system. Its data processing performance will affect the operation stability of nuclear power plant. The architecture, hardware configuration and data communication for plant computerized information and control system among the different levels in DCS are described. The main reasons affecting data processing performance in different signal channels are analyzed according to the plant load test results. The CPU load curves for real time server and central processing server are displayed, although the detailed cause for operating command delay and system display not updating realtime are not found, central processing server load is heavier than real time server which remind us to analyze the data processing of software resource scheduling deeply. So the resource distribution problem of software execution task is also analyzed according to CPU load test results. This paper provides the optimization analysis for data processing performance, and it is available and effective according to the latest test results. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗