SEARCH · Engineering Papers

Results for “dynamic 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 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1993

Population-based learning of load balancing policies for a distributed computer system

Effective load-balancing policies use dynamic resource information to schedule tasks in a distributed computer system. We present a novel method for automatically learning such policies. At each site in our system, we use a comparator neural network to predict the relative speedup of an incoming task using only the resource-utilization patterns obtained prior to the task's arrival. Outputs of these comparator networks are broadcast periodically over the distributed system, and the resource schedulers at each site use these values to determine the best site for executing an incoming task. The delays incurred in propagating workload information and tasks from one site to another, as well as the dynamic and unpredictable nature of workloads in multiprogrammed multiprocessors, may cause the workload pattern at the time of execution to differ from patterns prevailing at the times of load-index computation and decision making. Our load-balancing policy accommodates this uncertainty by using certain tunable parameters. We present a population-based machine-learning algorithm that adjusts these parameters in order to achieve high average speedups with respect to local execution. Our results show that our load-balancing policy, when combined with the comparator neural network for workload characterization, is effective in exploiting idle resources in a distributed computer system.

Mehra, Pankaj↗

NASA NTRS1992

Autonomous power system: Integrated scheduling

The Autonomous Power System (APS) project at NASA Lewis Research Center is designed to demonstrate the abilities of integrated intelligent diagnosis, control and scheduling techniques to space power distribution hardware. The project consists of three elements: the Autonomous Power Expert System (APEX) for fault diagnosis, isolation, and recovery (FDIR), the Autonomous Intelligent Power Scheduler (AIPS) to determine system configuration, and power hardware (Brassboard) to simulate a space-based power system. Faults can be introduced into the Brassboard and in turn, be diagnosed and corrected by APEX and AIPS. The Autonomous Intelligent Power Scheduler controls the execution of loads attached to the Brassboard. Each load must be executed in a manner that efficiently utilizes available power and satisfies all load, resource, and temporal constraints. In the case of a fault situation on the Brassboard, AIPS dynamically modifies the existing schedule in order to resume efficient operation conditions. A database is kept of the power demand, temporal modifiers, priority of each load, and the power level of each source. AIPS uses a set of heuristic rules to assign start times and resources to each load based on load and resource constraints. A simple improvement engine based upon these heuristics is also available to improve the schedule efficiency. This paper describes the operation of the Autonomous Intelligent Power Scheduler as a single entity, as well as its integration with APEX and the Brassboard. Future plans are discussed for the growth of the Autonomous Intelligent Power Scheduler.

Ringer, Mark J.↗

NASA NTRS1993

Performance analysis of a large-grain dataflow scheduling paradigm

A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.

Young, Steven D.↗

NASA NTRS1992

Learning to improve iterative repair scheduling

This paper presents a general learning method for dynamically selecting between repair heuristics in an iterative repair scheduling system. The system employs a version of explanation-based learning called Plausible Explanation-Based Learning (PEBL) that uses multiple examples to confirm conjectured explanations. The basic approach is to conjecture contradictions between a heuristic and statistics that measure the quality of the heuristic. When these contradictions are confirmed, a different heuristic is selected. To motivate the utility of this approach we present an empirical evaluation of the performance of a scheduling system with respect to two different repair strategies. We show that the scheduler that learns to choose between the heuristics outperforms the same scheduler with any one of two heuristics alone.

Zweben, Monte↗

NASA NTRSDate not supplied

Contracting Quality Early in the Lifecycle Using AS9145 Data Deliverables

Development schedules and a highly dynamic supply chain are a challenge to developers of complex systems produced at low volume. Flaws in designs, parts and materials availability problems, poor manufacturability, and a lack of knowledge about critical items and key process attributes can be realized well before traditional second-party quality assurance activities begin. Supplier audits and product inspections may have little mitigating effect once these foundational problems have been realized. Their impacts can be significant lifecycle disruption, cost overruns, inability to deliver to plan, and even project cancellation. AS9145, Requirements for Advanced Product Quality Planning and Production Part Approval Process, can be used to drive quality engineering practices into early development lifecycles to significantly reduce this late-cycle risk and to reduce the cost of quality overall. Since its initial publication in 2016, it has had very limited adoption by the DoD, no adoption by NASA, and sparse adoption in the aerospace and defense supply chain. A task group within the Aerospace Industries Association's (AIA) Joint Strategic Quality Council (JSQC) identified that both acquirers and suppliers see as AS9145 as a cost-adder and are hesitant to use it as an alternative to late-stage-heavy quality assurance approaches. A lack of prior use creates large capability gaps in request-for-proposal (RFP) teams, proposal teams, suppliers’ quality management systems (QMS), and in experienced personnel executing the early lifecycle approach. To create a more realizable on-ramp for using AS9145 in the space and defense sectors, the AIA JSQC task team created five deliverable requirements descriptions (DRDs) that can be used in a contract to begin to engage both parties in early lifecycle quality engineering and quality assurance activities, that reduce exposure to late-stage cost and schedule collapse due to unidentified risks in design, supply chain, and manufacturability. These DRDs drive the parties to engage in planning and analysis discussions early on to understand what production risks can be known and how they will focus resources based on safety criticality and the key elements of design and construction. The suppliers and acquirers who will produce the data and information required by the DRD will be able to incrementally evolve their QMS and the acquirer will incrementally be able to track and understand the benefits of cost shifting from late to early development phases. A white paper describing this approach and the five recommended DRDs will be published by the AIA in late 2024 or early 2025.

Jeannette Plante↗

NASA NTRS1977

Digital control of high performance aircraft using adaptive estimation techniques

In this paper, an adaptive signal processing algorithm is joined with gain-scheduling for controlling the dynamics of high performance aircraft. A technique is presented for a reduced-order model (the longitudinal dynamics) of a high performance STOL aircraft. The actual controller views the nonlinear behavior of the aircraft as equivalent to a randomly switching sequence of linear models taken from a preliminary piecewise-linear fit of the system nonlinearities. The adaptive nature of the estimator is necessary to select the proper sequence of linear models along the flight trajectory. Nonlinear behavior is approximated by effective switching of the linear models at random times, with durations reflecting aircraft motion in response to pilot commands.

Van Landingham, H. F.↗

NASA NTRS1988

A parallel row-based algorithm with error control for standard-cell replacement on a hypercube multiprocessor

A new row-based parallel algorithm for standard-cell placement targeted for execution on a hypercube multiprocessor is presented. Key features of this implementation include a dynamic simulated-annealing schedule, row-partitioning of the VLSI chip image, and two novel new approaches to controlling error in parallel cell-placement algorithms; Heuristic Cell-Coloring and Adaptive (Parallel Move) Sequence Control. Heuristic Cell-Coloring identifies sets of noninteracting cells that can be moved repeatedly, and in parallel, with no buildup of error in the placement cost. Adaptive Sequence Control allows multiple parallel cell moves to take place between global cell-position updates. This feedback mechanism is based on an error bound derived analytically from the traditional annealing move-acceptance profile. Placement results are presented for real industry circuits and the performance is summarized of an implementation on the Intel iPSC/2 Hypercube. The runtime of this algorithm is 5 to 16 times faster than a previous program developed for the Hypercube, while producing equivalent quality placement. An integrated place and route program for the Intel iPSC/2 Hypercube is currently being developed.

Sargent, Jeff Scott↗

NASA NTRS1990

Resource allocation using constraint propagation

The concept of constraint propagation was discussed. Performance increases are possible with careful application of these constraint mechanisms. The degree of performance increase is related to the interdependence of the different activities resource usage. Although this method of applying constraints to activities and resources is often beneficial, it is obvious that this is no panacea cure for the computational woes that are experienced by dynamic resource allocation and scheduling problems. A combined effort for execution optimization in all areas of the system during development and the selection of the appropriate development environment is still the best method of producing an efficient system.

Rogers, John S.↗

NASA NTRS1989

A parallel row-based algorithm for standard cell placement with integrated error control

Sargent, Jeff S.↗

NASA NTRS1991

A geometric approach to regulator and tracker design for an aerospace plane

The paper presents a nonlinear design approach drawing from singular perturbations, feedback linearization, and variable structure control, that leads to regulators with automatic gain scheduling which exhibit similar dynamic behavior over the entire flight envelope of the aerospace plane. Additionally, design approach provides for a systematic way to counter disturbance effects as well as modeling uncertainties. The unifying feature of the three nonlinear feedback control methodologies is that they all have a geometric interpretation. First, the translational dynamics are decomposed into reduced-order slow and fast dynamics by way of a formal singular perturbation analysis. After feedback linearization the fast dynamics are robustly stabilized via a variable structure control approach. The slow dynamics are stabilized using conventional proportional-integral compensation based on the nominal slow dynamics. A number of sample command and disturbance responses at opposite ends of the flight envelope are presented for a nonlinear aerospace plane model.

Van Buren, Mark A.↗

NASA NTRS1996

A Benchmark Problem for Development of Autonomous Structural Modal Identification

This paper summarizes modal identification results obtained using an autonomous version of the Eigensystem Realization Algorithm on a dynamically complex, laboratory structure. The benchmark problem uses 48 of 768 free-decay responses measured in a complete modal survey test. The true modal parameters of the structure are well known from two previous, independent investigations. Without user involvement, the autonomous data analysis identified 24 to 33 structural modes with good to excellent accuracy in 62 seconds of CPU time (on a DEC Alpha 4000 computer). The modal identification technique described in the paper is the baseline algorithm for NASA's Autonomous Dynamics Determination (ADD) experiment scheduled to fly on International Space Station assembly flights in 1997-1999.

Pappa, Richard S.↗

NASA NTRS2018

LPV Modeling and Control for Active Flutter Suppression of a Smart Airfoil

In this paper, a novel technique of linear parameter varying (LPV) modeling and control of a smart airfoil for active flutter suppression is proposed, where the smart airfoil has a groove along its chord and contains a moving mass that is used to control the airfoil pitching and plunging motions. The new LPV modeling technique is proposed that uses mass position as a scheduling parameter to describe the physical constraint of the moving mass, in addition the hard constraint at the boundaries is realized by proper selection of the parameter varying function. Therefore, the position of the moving mass and the free stream airspeed are considered the scheduling parameters in the study. A state-feedback based LPV gain-scheduling controller with guaranteed H infinity performance is presented by utilizing the dynamics of the moving mass as scheduling parameter at a given airspeed. The numerical simulations demonstrate the effectiveness of the proposed LPV control architecture by significantly improving the performance while reducing the control effort.

Smart Airfoil↗

NASA NTRS2014

Stability Assessment and Tuning of an Adaptively Augmented Classical Controller for Launch Vehicle Flight Control

Recently, a robust and practical adaptive control scheme for launch vehicles [ [1] has been introduced. It augments a classical controller with a real-time loop-gain adaptation, and it is therefore called Adaptive Augmentation Control (AAC). The loop-gain will be increased from the nominal design when the tracking error between the (filtered) output and the (filtered) command trajectory is large; whereas it will be decreased when excitation of flex or sloshing modes are detected. There is a need to determine the range and rate of the loop-gain adaptation in order to retain (exponential) stability, which is critical in vehicle operation, and to develop some theoretically based heuristic tuning methods for the adaptive law gain parameters. The classical launch vehicle flight controller design technics are based on gain-scheduling, whereby the launch vehicle dynamics model is linearized at selected operating points along the nominal tracking command trajectory, and Linear Time-Invariant (LTI) controller design techniques are employed to ensure asymptotic stability of the tracking error dynamics, typically by meeting some prescribed Gain Margin (GM) and Phase Margin (PM) specifications. The controller gains at the design points are then scheduled, tuned and sometimes interpolated to achieve good performance and stability robustness under external disturbances (e.g. winds) and structural perturbations (e.g. vehicle modeling errors). While the GM does give a bound for loop-gain variation without losing stability, it is for constant dispersions of the loop-gain because the GM is based on frequency-domain analysis, which is applicable only for LTI systems. The real-time adaptive loop-gain variation of the AAC effectively renders the closed-loop system a time-varying system, for which it is well-known that the LTI system stability criterion is neither necessary nor sufficient when applying to a Linear Time-Varying (LTV) system in a frozen-time fashion. Therefore, a generalized stability metric for time-varying loop=gain perturbations is needed for the AAC.

VanZwieten, Tannen↗

NASA NTRS1994

Automatic generation of efficient orderings of events for scheduling applications

In scheduling a set of tasks, it is often not known with certainty how long a given event will take. We call this duration uncertainty. Duration uncertainty is a primary obstacle to the successful completion of a schedule. If a duration of one task is longer than expected, the remaining tasks are delayed. The delay may result in the abandonment of the schedule itself, a phenomenon known as schedule breakage. One response to schedule breakage is on-line, dynamic rescheduling. A more recent alternative is called proactive rescheduling. This method uses statistical data about the durations of events in order to anticipate the locations in the schedule where breakage is likely prior to the execution of the schedule. It generates alternative schedules at such sensitive points, which can be then applied by the scheduler at execution time, without the delay incurred by dynamic rescheduling. This paper proposes a technique for making proactive error management more effective. The technique is based on applying a similarity-based method of clustering to the problem of identifying similar events in a set of events.

Morris, Robert A.↗

NASA NTRS2000

NPSS on NASA's IPG: Using CORBA and Globus to Coordinate Multidisciplinary Aeroscience Applications

Within NASA's High Performance Computing and Communication (HPCC) program, the NASA Glenn Research Center is developing an environment for the analysis/design of aircraft engines called the Numerical Propulsion System Simulation (NPSS). The vision for NPSS is to create a "numerical test cell" enabling full engine simulations overnight on cost-effective computing platforms. To this end, NPSS integrates multiple disciplines such as aerodynamics, structures, and heat transfer and supports "numerical zooming" between O-dimensional to 1-, 2-, and 3-dimensional component engine codes. In order to facilitate the timely and cost-effective capture of complex physical processes, NPSS uses object-oriented technologies such as C++ objects to encapsulate individual engine components and CORBA ORBs for object communication and deployment across heterogeneous computing platforms. Recently, the HPCC program has initiated a concept called the Information Power Grid (IPG), a virtual computing environment that integrates computers and other resources at different sites. IPG implements a range of Grid services such as resource discovery, scheduling, security, instrumentation, and data access, many of which are provided by the Globus toolkit. IPG facilities have the potential to benefit NPSS considerably. For example, NPSS should in principle be able to use Grid services to discover dynamically and then co-schedule the resources required for a particular engine simulation, rather than relying on manual placement of ORBs as at present. Grid services can also be used to initiate simulation components on parallel computers (MPPs) and to address inter-site security issues that currently hinder the coupling of components across multiple sites. These considerations led NASA Glenn and Globus project personnel to formulate a collaborative project designed to evaluate whether and how benefits such as those just listed can be achieved in practice. This project involves firstly development of the basic techniques required to achieve co-existence of commodity object technologies and Grid technologies; and secondly the evaluation of these techniques in the context of NPSS-oriented challenge problems. The work on basic techniques seeks to understand how "commodity" technologies (CORBA, DCOM, Excel, etc.) can be used in concert with specialized "Grid" technologies (for security, MPP scheduling, etc.). In principle, this coordinated use should be straightforward because of the Globus and IPG philosophy of providing low-level Grid mechanisms that can be used to implement a wide variety of application-level programming models. (Globus technologies have previously been used to implement Grid-enabled message-passing libraries, collaborative environments, and parameter study tools, among others.) Results obtained to date are encouraging: we have successfully demonstrated a CORBA to Globus resource manager gateway that allows the use of CORBA RPCs to control submission and execution of programs on workstations and MPPs; a gateway from the CORBA Trader service to the Grid information service; and a preliminary integration of CORBA and Grid security mechanisms. The two challenge problems that we consider are the following: 1) Desktop-controlled parameter study. Here, an Excel spreadsheet is used to define and control a CFD parameter study, via a CORBA interface to a high throughput broker that runs individual cases on different IPG resources. 2) Aviation safety. Here, about 100 near real time jobs running NPSS need to be submitted, run and data returned in near real time. Evaluation will address such issues as time to port, execution time, potential scalability of simulation, and reliability of resources. The full paper will present the following information: 1. A detailed analysis of the requirements that NPSS applications place on IPG. 2. A description of the techniques used to meet these requirements via the coordinated use of CORBA and Globus. 3. A description of results obtained to date in the first two challenge problems.

Lopez, Isaac↗

NASA NTRS1986

The evaluation of the OSGLR algorithm for restructurable controls

The detection and isolation of commercial aircraft control surface and actuator failures using the orthogonal series generalized likelihood ratio (OSGLR) test was evaluated. The OSGLR algorithm was chosen as the most promising algorithm based on a preliminary evaluation of three failure detection and isolation (FDI) algorithms (the detection filter, the generalized likelihood ratio test, and the OSGLR test) and a survey of the literature. One difficulty of analytic FDI techniques and the OSGLR algorithm in particular is their sensitivity to modeling errors. Therefore, methods of improving the robustness of the algorithm were examined with the incorporation of age-weighting into the algorithm being the most effective approach, significantly reducing the sensitivity of the algorithm to modeling errors. The steady-state implementation of the algorithm based on a single cruise linear model was evaluated using a nonlinear simulation of a C-130 aircraft. A number of off-nominal no-failure flight conditions including maneuvers, nonzero flap deflections, different turbulence levels and steady winds were tested. Based on the no-failure decision functions produced by off-nominal flight conditions, the failure detection performance at the nominal flight condition was determined. The extension of the algorithm to a wider flight envelope by scheduling the linear models used by the algorithm on dynamic pressure and flap deflection was also considered. Since simply scheduling the linear models over the entire flight envelope is unlikely to be adequate, scheduling of the steady-state implentation of the algorithm was briefly investigated.

Bonnice, W. F.↗

NASA NTRS1992

Coordinating space telescope operations in an integrated planning and scheduling architecture

The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

Muscettola, Nicola↗

NASA NTRS2021

An Efficient Approach for Scheduling Imaging Tasks Across a Fleet of Satellites

Dynamically retasking satellites in response to scientific alerts is challenging because the tasks and opportunities of one satellite can influence this of another. This abstract focuses on our high-level approach for scheduling imaging tasks across a constellation of satellite, which is subject to orbital and other practical constraints such as finding a feasible up-/down- link schedule. Our approach is inspired by combining insights from two existing approaches about the structure of these problems to create an efficient, new approach. We show that our approach stacks up favorably against two baselines–an optimal solver as well as a naive, greedy approach.

Maillard, Adrien↗