Search NASA⌕ Search

SEARCH · Search NASA

Results for “Task 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 289 records · Page 16

Constraint-based scheduling

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Zweben, Monte↗

Maximizing Dust Devil Follow-up Observations on Mars Using Cubesats and On-board Scheduling

Several million dust devil events occur on Mars every day. These events last, on average, about 30 minutes and range in size from meters to hundreds of meters in diameter. Designing low-cost missions that will improve our knowledge of dust devil formation and evolution, and their connection to atmospheric dynamics and the dust cycle, is fundamental to informing future crewed Mars lander missions about surface conditions. In this paper we present a mission for a constellation of low orbiting Mars cubesats, each carrying imagers with agile pointing capabilities. The goal is to maximize the number of dust devil follow-up observations through real-time, on-board scheduling. We study scenarios where cubesats are equipped with a 2.5 degree boresight angle camera that accommodates five slew positions (including nadir). We assume a concept of operations where the cubesats autonomously survey the surface of Mars and can autonomously detect dust devils from their surface imagery. When a dust devil is detected, the constellation is autonomously re-tasked through an on-board distributed scheduler to capture as many follow-on images of the event as possible, so as to study its evolution. The cubesat orbits are propagated assuming two-body dynamics and the ground tracks and camera field of view are computed assuming a spherical Mars. Realistic inter-agent communication link opportunities are computed and included in our optimization, which allow for real-time event detection information to be shared within the constellation. We compare against a powerful ``omniscient'' mission which has a priori knowledge of all dust devil activity to show the gap between predicted performance and the best possible outcome. In particular, we show that the communications are especially important for acquiring follow-up observations, and that a realistic distributed scheduling mechanism is sufficient to capture nearly all dust devil observations that are possible for a given orbit configuration.

Hook, Joshua Vander↗

Quantum/AI Topology-Aware Latency-Adaptive HPC Workflow Scheduling Optimization

The growing demand for more powerful high-performance computing (HPC) systems has led to a steady rise in energy consumption by supercomputing worldwide. This study is focused on comparing our Application-Topology Mapper (ATMapper) to the popular Simple Linux Utility for Resource Management (SLURM) for the purpose of exploring methods that can further optimize job-scheduling within HPC systems. ATMapper is an Artificial-Intelligence based approach to job-scheduling that is currently being enhanced with quantum annealing (QA) to generate optimal schedules faster. We are applying QA to speedup our ATMapper process to achieve higher computing efficiency, thereby reducing HPC energy consumption. Here, we examine how four job-scheduling approaches perform in processor node assignment when using an example network architecture of 4 interconnected nodes. Using a specialized script, we are assessing the schedule of a computation flow with 11 interdependent tasks. The data movements among nodes were tracked to count for the number of interactions (network hops) between nodes needed to complete the tasks. The total number of hops and the job completion time were then used to quantify the efficiency of the different mapping approaches. In addition to SLURM, we also compare our ATMapper to the QA-enabled LBNL TIGER and the D-Wave Distributed Computing processor assignment approaches. The preliminary results showed that our topology-aware, latency-adaptive ATMapper is significantly more efficient when compared to the other scheduling approaches due to its load-imbalance network allocation. The scheduler displayed a computing efficiency of 53% by performing significantly fewer network hops than its alternatives. By reducing the number of hops, ATMapper was able to perform all 11 tasks by using only 3 nodes out of given 4. This research indicates the potential to use QA/AI for HPC job-scheduling. Later, we will test a SLURM simulator program to draw further comparisons on the effectiveness of ATMapper's scheduling approach. The results of this comparison will serve as a baseline for later improving SLURM's performance using a QA-enhanced ATMapper approach.

Caraveo, Braulio [University of Huston - Clear Lak↗

NASA Schedule Management Handbook

The purpose of schedule management is to provide the framework for time-phasing, resource planning, coordination, and communicating the necessary tasks within a work effort. The intent is to improve schedule management by providing recommended concepts, processes, and techniques used within the Agency and private industry. The intended function of this handbook is two-fold: first, to provide guidance for meeting the scheduling requirements contained in NPR 7120.5, NASA Space Flight Program and Project Management Requirements, NPR 7120.7, NASA Information Technology and Institutional Infrastructure Program and Project Requirements, NPR 7120.8, NASA Research and Technology Program and Project Management Requirements, and NPD 1000.5, Policy for NASA Acquisition. The second function is to describe the schedule management approach and the recommended best practices for carrying out this project control function. With regards to the above project management requirements documents, it should be noted that those space flight projects previously established and approved under the guidance of prior versions of NPR 7120.5 will continue to comply with those requirements until project completion has been achieved. This handbook will be updated as needed, to enhance efficient and effective schedule management across the Agency. It is acknowledged that most, if not all, external organizations participating in NASA programs/projects will have their own internal schedule management documents. Issues that arise from conflicting schedule guidance will be resolved on a case by case basis as contracts and partnering relationships are established. It is also acknowledged and understood that all projects are not the same and may require different levels of schedule visibility, scrutiny and control. Project type, value, and complexity are factors that typically dictate which schedule management practices should be employed.

Source record↗

Scheduling Operations for Massive Heterogeneous Clusters

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Humphrey, John↗

Adapting ASPEN for Orbital Express

By studying the Orbital Express mission, modeling the spacecraft and scenarios, and testing the system, a technique has been developed that uses recursive decomposition to represent procedural actions declaratively, schema-level uncertainty reasoning to make uncertainty reasoning tractable, and lightweight, natural language processing to automatically parse procedures to produce declarative models. Schema-level uncertainty reasoning has, at its core, the basic assumption that certain variables are uncertain, but not independent. Once any are known, then the others become known. This is important where a variable is uncertain for an action and many actions of the same type exist in the plan. For example, if the number of retries to purge pump lines was unknown (but bounded), and each attempt required a sub-plan, then, once the correct number of attempts required for a purge was known, it would likely be the same for all subsequent purges. This greatly reduces the space of plans that needs to be searched to ensure that all executions are feasible. To accommodate changing scenario procedures, each is ingested into a tabular format in temporal order, and a simple natural-language parser is used to read each step and to derive the impact of that step on memory, power, and communications. Then an ASPEN (Activity Scheduling and Planning Environment) model is produced based on this analysis. The model is tested and further changed by hand, if necessary, to reflect the actual procedure. This results in a great savings of time used for modeling procedures. Many processes that need to be modeled in ASPEN (a declarative system) are, in fact, procedural. ASPEN includes the ability to model activities in a hierarchical fashion, but this representation breaks down if there is a practically unbounded number of sub-activities and decomposition topologies. However, if recursive decomposition is allowed, HTN-like encodings are enabled to represent most procedural phenomena. For example, if a switch requires a variable (but known at the time of the attempt) number of attempts to switch on, one can recurse on the number of remaining switch attempts and decompose into either the same switching activity with one less required attempt, or not decompose at all (or decompose into a dummy task), resulting in the end of the decomposition. In fact, any bounded procedural behavior can be modeled using recursive decompositions assuming that the variables impinging the disjunctive decomposition decision are computable at the time that the decision is made. This enables one to represent tasks that are controlled outside of the scheduler, but that the scheduler must accommodate, without requiring one to give a declarative model of the procedural behavior.

Chouinard, Caroline↗

Operations mission planner

The findings are documented of the OMP research task, which investigated the applicability of artificial intelligence (AI) technology in support of automated scheduling. The goals of the effort are summarized and the technical accomplishments are highlighted. The OMP task succeeded in identifying how AI technology could be applied and demonstrated an AI-based automated scheduling approach through the OMP prototypes.

Biefeld, Eric↗

General Aviation Task Force report

General aviation is officially defined as all aviation except scheduled airlines and the military. It is the only air transportation to many communities throughout the world. In order to reverse the recent decline in general aviation aircraft produced in the United States, the Task Force recommends that NASA provide the expertise and facilities such as wind tunnels and computer codes for aircraft design. General aviation manufacturers are receptive to NASA's innovations and technological leadership and are expected to be effective users of NASA-generated technologies.

Source record↗

Scheduling time-critical graphics on multiple processors

This paper describes an algorithm for the scheduling of time-critical rendering and computation tasks on single- and multiple-processor architectures, with minimal pipelining. It was developed to manage scientific visualization scenes consisting of hundreds of objects, each of which can be computed and displayed at thousands of possible resolution levels. The algorithm generates the time-critical schedule using progressive-refinement techniques; it always returns a feasible schedule and, when allowed to run to completion, produces a near-optimal schedule which takes advantage of almost the entire multiple-processor system.

Meyer, Tom W.↗

IRIS-GNN: Leveraging Graph Neural Networks for Scheduling on Truly Heterogeneous Runtime Systems

The diversity of accelerators in computer systems poses significant challenges for software developers, such as managing vendor-specific compiler toolchains, code fragmentation requiring different kernel implementations, and performance portability issues. To address these, the Intelligent Runtime System (IRIS) was developed. IRIS works across various systems, from smartphones to supercomputers, enabling automatic performance scaling based on available accelerators. It introduces abstract tasks for seamless execution transitions between accelerators while ensuring memory consistency and task dependencies. Although IRIS simplifies system details, optimal dynamic scheduling still requires user input to understand workload structures. To address this, we introduce a new scheduling policy for IRIS, termed IRIS-GNN, which is the first IRIS hybrid policy that operates in conjunction with the dynamic policies. This policy employs a Graph-Neural Network (GNN) to conduct Graph Classification of any task graphs submitted to IRIS. This GNN analyzes the structure and attributes of the task graph, categorizing it as either locality, concurrency, or mixed. This classification subsequently guides the selection of the dynamic policy used by IRIS. We provide a comparison of the performance of IRIS-GNN against the complete spectrum of IRIS’s dynamic policies, assess the overhead introduced by the GNN within this scheduling framework, and ultimately explore its practical application in real-world scenarios.

Johnston, Beau↗

Crew interface specifications preparation for in-flight maintenance and stowage functions

The findings and data products developed during the Phase 2 crew interface specification study are presented. Five new NASA general specifications were prepared: operations location coding system for crew interfaces; loose equipment and stowage management requirements; loose equipment and stowage data base information requirements; spacecraft loose equipment stowage drawing requirements; and inflight stowage management data requirements. Additional data was developed defining inflight maintenance processes and related data concepts for inflight troubleshooting, remove/repair/replace and scheduled maintenance activities. The process of maintenance task and equipment definition during spacecraft design and development was also defined and related data concepts were identified for futher development into formal NASA specifications during future follow-on study phases of the contract.

Parker, F. W.↗

Problems related to the integration of fault tolerant aircraft electronic systems

Problems related to the design of the hardware for an integrated aircraft electronic system are considered. Taxonomies of concurrent systems are reviewed and a new taxonomy is proposed. An informal methodology intended to identify feasible regions of the taxonomic design space is described. Specific tools are recommended for use in the methodology. Based on the methodology, a preliminary strawman integrated fault tolerant aircraft electronic system is proposed. Next, problems related to the programming and control of inegrated aircraft electronic systems are discussed. Issues of system resource management, including the scheduling and allocation of real time periodic tasks in a multiprocessor environment, are treated in detail. The role of software design in integrated fault tolerant aircraft electronic systems is discussed. Conclusions and recommendations for further work are included.

Bannister, J. A.↗

The role of failure/problems in engineering: A commentary of failures experienced - lessons learned

The written version of a series of seminars given to several aerospace companies and three NASA centers are presented. The results are lessons learned through a study of the problems experienced in 35 years of engineering. The basic conclusion is that the primary cause of problems has not been mission technologies, as important as technology is, but the neglect of basic principles. Undergirding this is the lack of a systems focus from determining requirements through design, verification, and operations phases. Many of the concepts discussed are fundamental to total quality management (TQM) and can be used to augment this product enhanced philosophy. Fourteen principles are addressed with problems experienced and are used as examples. Included is a discussion of the implication of constraints, poorly defined requirements, and schedules. Design guidelines, lessons learned, and future tasks are listed. Two additional sections are included that deal with personal lessons learned and thoughts on future thrusts (TQM).

Ryan, R. S.↗

Remote sensing for urban planning

Utility companies are challenged to provide services to a highly dynamic customer base. With factory closures and shifts in employment becoming a routine occurrence, the utility industry must develop new techniques to maintain records and plan for expected growth. BellSouth Telecommunications, the largest of the Bell telephone companies, currently serves over 13 million residences and 2 million commercial customers. Tracking the movement of customers and scheduling the delivery of service are major tasks for BellSouth that require intensive manpower and sophisticated information management techniques. Through NASA's Commercial Remote Sensing Program Office, BellSouth is investigating the utility of remote sensing and geographic information system techniques to forecast residential development. This paper highlights the initial results of this project, which indicate a high correlation between the U.S. Bureau of Census block group statistics and statistics derived from remote sensing data.

Davis, Bruce A.↗

Revolutionary Concepts for Human Outer Planet Exploration (HOPE)

This paper summarizes the content of a NASA-led study performed to identify revolutionary concepts and supporting technologies for Human Outer Planet Exploration (HOPE). Callisto, the fourth of Jupiter's Galilean moons, was chosen as the destination for the HOPE study. Assumptions for the Callisto mission include a launch year of 2045 or later, a spacecraft capable of transporting humans to and from Callisto in less than five years, and a requirement to support three humans on the surface for a minimum of 30 days. Analyses performed in support of HOPE include identification of precursor science and technology demonstration missions and development of vehicle concepts for transporting crew and supplies. A complete surface architecture was developed to provide the human crew with a power system, a propellant production plant, a surface habitat, and supporting robotic systems. An operational concept was defined that provides a surface layout for these architecture components, a list of surface tasks, a 30-day timeline, a daily schedule, and a plan for communication from the surface.

Power electronics↗

A NASA Strategy for Leveraging Emerging Launch Vehicles for Routine, Small Payload Missions

Orbital flight opportunities for small payloads have always been few and far between, and then on February 1, 2002, the situation got worse. In the wake of the loss of the Columbia during STS- 107, changing NASA missions and priorities led to the termination of the Shuttle Small Payloads Projects, including Get-Away Special, Hitcbker, and Space Experiment Module. In spite of the limited opportunities, long queue, and restrictions associated with flying experiments on a man-rated transportation system; the carriers provided a sustained, high quality experiment services for education, science, and technology payloads, and was one of the few games in town. Attempts to establish routine opportunities aboard existing ELVs have been unsuccessful, as the cost-per-pound on small ELVs and conflicts with primary spacecraft on larger vehicles have proven prohibitive. Ths has led to a backlog of existing NASA-sponsored payloads and no prospects or plans for fbture opportunities within the NASA community. The prospects for breaking out of this paradigm appear promising as a result of NASA s partnership with DARPA in pursuit of low-cost, responsive small ELVs under the Falcon Program. Through this partnership several new small ELVs, providing 1000 lbs. to LEO will be demonstrated in less than two years that promise costs that are reasonable enough that NASA, DoD, and other sponsors can once again invest in small payload opportunities. Within NASA, planning has already begun. NASA will be populating one or more of the Falcon demonstration flights with small payloads that are already under development. To accommodate these experiments, Goddard s Wallops Flight Facility has been tasked to develop a multi-payload ejector (MPE) to accommodate the needs of these payloads. The MPE capabilities and design is described in detail in a separately submitted abstract. Beyond use of the demonstration flights however, Goddard has already begun developing strategies to leverage these new ELVs as elements of a larger system designed to provide routine, low-cost end-to-end services for small science, Exploration, and education payloads. The plan leverages the management approaches of the successful Sounding Rocket Program and Shuttle Small Payloads Projects. The strategy consists of using a systems implementation approach of elements, including 1) Falcon ELVs, 2) advanced launch site technologies and processes, 3) suite of experiment carriers accommodating different mission requirements, 4) streamlined integration and test operations, 5 ) experiment brokering and management, and 6) standardized, distributed payload operations. The envisioned suite of carriers includes the MPE, a standard interface experiment carrier, and potentially a reentry fieeflyer experiment carrier. Key to the success of this strategy is standard experiment interfaces within the carriers to limit mission- unique tasks, establishmg and managing a program of scheduled reoccurring flights rather than discrete missions, and streamlined, centralized implementation of the elements. These individual elements are each under development and Goddard will demonstrate the overall system strategy low-cost small payload missions on the initial Falcon demonstration launches from Wallops. goal is to show that this model should be converted to a sustained NASA program supporting science, technology, and education, with annual flight opportunities. The paper will define in detail the various elements of the overall program, as well as provide status, philosophy, and strategy for the program that will hopefully once-and-for-all provide low-cost, routine access to space for the small payloads community.

Underwood, Bruce E.↗

Applied Meteorology Unit (AMU)

This report summarizes the Applied Meteorology Unit (AMU) activities for the first quarter of Fiscal Year 2010 (October - December 2009). A detailed project schedule is included in the Appendix. Included tasks are: (1) Peak Wind Tool for User Launch Commit Criteria (LCC), (2) Objective Lightning Probability Tool, Phase III, (3) Peak Wind Tool for General Forecasting, Phase II, (4) Upgrade Summer Severe Weather Tool in Meteorological Interactive Data Display System (MIDDS), (5) Advanced Regional Prediction System (ARPS) Data Analysis System (ADAS) Update and Maintainability, (5) Verify 12-km resolution North American Model (MesoNAM) Performance, and (5) Hybrid Single-Particle Lagrangian Integrated Trajectory (HYSPLIT) Graphical User Interface.

Bauman, William↗