SEARCH · Search NASA

Results for “Distributed 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.

Richards, Stephen F.↗

NASA NTRS1988

Integrated resource scheduling in a distributed scheduling environment

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

Zoch, David↗

NASA NTRS1991

A distributed scheduling algorithm for heterogeneous real-time systems

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

Zeineldine, Osman↗

NASA NTRS2004

Distributed network scheduling

Distributed Network Scheduling is the scheduling of future communications of a network by nodes in the network. This report details software for doing this onboard spacecraft in a remote network. While prior work on distributed scheduling has been applied to remote spacecraft networks, the software reported here focuses on modeling communication activities in greater detail and including quality of service constraints. Our main results are based on a Mars network of spacecraft and include identifying a maximum opportunity of improving traverse exploration rate a factor of three; a simulation showing reduction in one-way delivery times from a rover to Earth from as much as 5 to 1.5 hours; simulated response to unexpected events averaging under an hour onboard; and ground schedule generation ranging from seconds to 50 minutes for 15 to 100 communication goals.

planning↗

NASA NTRS1991

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↗

NASA NTRS1993

Protocols for distributive scheduling

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning.

Richards, Stephen F.↗

NASA NTRS2003

Distributed Scheduling Architecture for Multi-Center Time-Based Metering

The Traffic Management Advisor (TMA) is an air traffic control automation system currently in use in seven Air Route Traffic Control Centers (ARTCCs) to enable time based metering to busy airports within their airspace. However, this system is limited to operation within a single ARTCC, within about a 200 nautical mile radius of the airport, and on relatively simple streams of traffic. The need for coordinated metering within a greater (300+ nautical mile) radius of an airport, on streams of traffic with significant branching, and across ARTCC boundaries, has been identified. Early tests revealed that TMA could not simply be scaled up to handle such a problem. Instead, a loosely coupled hierarchy of schedules, in which constraints from downstream schedules are passed upstream, is required. Such an architecture reduces the reliance on distant projections of arrival times, making schedules robust to changes in sequence and to additions of aircraft (such as aircraft departing inside the system s scheduling horizon). This architecture is also scaleable, easily reconfigurable, and can be networked together. As such, it can be adapted for use in any size or configuration of airspace and with any number of airports delivering restrictions. An implementation of this distributed scheduling architecture is currently undergoing testing in the TMA-Multi Center system. This paper describes the architecture and its motivation.

Landry, Steven↗

NASA NTRS1990

Concepts in Distributed Scheduling and Control

To support instrument and experiment operations effectively in the Space Station era, planning, scheduling and control must allow for: interactive, realtime, remote operations; responsive scheduling and rescheduling; support of the full range of distributed science, application and commercial users; interaction and cooperation among distributed users; and efficient use of on-board, communications, and ground-based resources. We suggest conceptual and managerial approaches that address these needs. Specifically, we describe an approach to distributed planning, scheduling and control functions that is based on resources and on a distributed knowledge hierarchy. We describe these functions as components of an integrated management system. We discuss automated scheduling assistants and integration of planning and scheduling functions with realtime operations control. The suggested approach, taken from a users' point-of-view, has resulted in the Science User Resource Planning and Scheduling System (SURPASS). In this paper, we describe the major components of SURPASS and discuss the features of this innovative prototype. Further ideas concerning instrument planning, scheduling, and control may be found in the Space Station Instrument Control System Study.

Hansen, Elaine R.↗

NASA NTRS1992

Distributed project scheduling at NASA: Requirements for manual protocols and computer-based support

Richards, Stephen F.↗

NASA NTRS1990

Concepts in distributed planning, scheduling, and control

To support instrument and experiment operations effectively in the Space Station era, planning, scheduling, and control must allow for: (1) interactive real-time remote operations; (2) responsive scheduling and rescheduling; (3) support of the full range of distributed science, application and commercial users; (4) interaction and cooperation among distributed users; and (5) efficient use of often onboard, communications, and ground-based resources. We suggest conceptual and managerial approaches that address these needs. Specifically, we describe approaches to distributed planning, scheduling and control functions that are based on resources and on a distributed knowledge hierarchy. We describe the scheduling functions as the component of the integrated space-ground Operations Management System. We include the integration of the planning and scheduling functions with the real-time operations control system, and we discuss automated scheduling assistants. These suggested approaches, taken from the users' point-of-view, have resulted in two prototype systems: Operations and Science Instrument Support package and Science User Resource Planning and Scheduling System.

Hansen, Elaine↗

NASA NTRS1990

Dynamic load-sharing using predicted process resource requirements

Heuristics which use predicted process resource requirements to make scheduling decisions are proposed. Four heuristics are presented. The first two, MINQ and SMPL, employ centralized scheduling and the remaining two, DMINQ and FDMINQ, use distributed scheduling. These heuristics are first compared against random scheduling and then against two conventional heuristics, CENTEX and DISTED, which schedule processes solely based on system state information. Results based on trace-driven simulations show that the proposed centralized heuristics offer significantly improved mean response time and they require fewer status update messages. In experiments using the same status update rates, SMPL response times were, on the average, 22 percent lower than those for CENTEX; MINQ response times were, on the average, 18 percent lower. The simulations also showed that MINQ and SMPL can perform as well as, or better than, CENTEX while using up to 70 percent fewer status update messages. The use of fewer status update messages imposes less overhead on the system. The use of prediction for distributed scheduling produced similar results. When prediction was used to filter small processes and execute them locally a 50 percent improvement in response times was obtained.

Goswami, Kumar K.↗

NASA NTRS1990

Electric power scheduling: A distributed problem-solving approach

Space Station Freedom's power system, along with the spacecraft's other subsystems, needs to carefully conserve its resources and yet strive to maximize overall Station productivity. Due to Freedom's distributed design, each subsystem must work cooperatively within the Station community. There is a need for a scheduling tool which will preserve this distributed structure, allow each subsystem the latitude to satisfy its own constraints, and preserve individual value systems while maintaining Station-wide integrity. The value-driven free-market economic model is such a tool.

Mellor, Pamela A.↗

NASA NTRS1990

Electric power scheduling - A distributed problem-solving approach

Mellor, Pamela A.↗

NASA NTRS2021

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↗

NASA NTRS2005

Distributed network scheduling

We investigate missions where communications resources are limited, requiring autonomous planning and execution. Unlike typical networks, spacecraft networks are also suited to automated planning and scheduling because many communications can be planned in advance.

scheduling↗

NASA NTRS1990

Distributed planning and scheduling for instrument and platform operations

Distributed planning and scheduling for instruments and platform operations in resource constrained environments are discussed. NASA has repeatedly faced the situation of multiple users having differing goals, objectives, and requirements interacting with a planning and scheduling system. Current examples include the Hubble Space Telescope and Space Station Freedom. The paper provides a brief description of the instrument and platform operations domain, discusses both traditional and distributed planning and scheduling in the context of this domain, and looks at examples of NASA environments in which planning and scheduling is or will be performed in a distributed system.

Hull, Larry G.↗

NASA NTRS1993

EOS distributed planning and scheduling prototype

Some of the more significant lessons learned during the development of the Earth Observing System (EOS) Distributed Planning and Scheduling Prototype are presented. The need for a central scheduler is not demonstrated. A mapping of scheduling and conflict-resolution responsibility across the nodes of the EOS distributed scheduling system is developed and shown to be both feasible and appropriate. Complex instrument scheduling is mostly accomplished at the ICC/IST (instrument control center/instrumental support terminal) with 'slidable' flexibility for slews and some kinds of calibrations resolved at the EOS Operations Center (EOC). All nodes have full visibility interinstrument contention for resource and environmental rights, e.g., vibration, thermal, and electromagnetic. The EOC assigns, by activity, initial action responsibility for conflict resolution to a node which is party to the conflict. Most interinstrument conflicts are resolved by the ICCs and ISTs during an intermediate scheduling phase while the EOC is negotiating a TDRS schedule with the NCC.

Hull, Larry G.↗

NASA NTRS1990

An innovative approach for distributed and integrated resources planning for the Space Station Freedom

This paper presents a planning approach to the Space Station Freedom program which takes into account the widely distributed nature of that program. The program management structure is organized into three major levels: a strategic level, a tactical level, and an execution level. For each level, resource availabilities are determined, the resources are distributed, schedules are built independently within the resource limits, the schedules are integrated into a single schedule, and conflicts are resolved by negotiating requirements and/or relaxing contraints. This approach distributes resources to multiple planning entities in such a way that when the multiple plans are collected, they fit together with minimal modification. The up-front distribution is planned in such a way and to a sufficient degree that a fit is virtually assured.

Hornstein, Rhoda S.↗